/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:02:09,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:02:09,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:02:09,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:02:09,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:02:09,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:02:09,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:02:09,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:02:09,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:02:09,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:02:09,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:02:09,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:02:09,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:02:09,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:02:09,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:02:09,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:02:09,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:02:09,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:02:09,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:02:09,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:02:09,085 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:02:09,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:02:09,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:02:09,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:02:09,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:02:09,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:02:09,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:02:09,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:02:09,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:02:09,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:02:09,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:02:09,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:02:09,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:02:09,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:02:09,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:02:09,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:02:09,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:02:09,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:02:09,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:02:09,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:02:09,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:02:09,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:02:09,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:02:09,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:02:09,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:02:09,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:02:09,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:02:09,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:02:09,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:02:09,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:02:09,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:02:09,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:02:09,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:02:09,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:02:09,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:02:09,121 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:02:09,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:02:09,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:02:09,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:02:09,121 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:02:09,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:02:09,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:02:09,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:02:09,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:02:09,122 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:02:09,122 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:02:09,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:02:09,122 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:02:09,122 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 06:02:09,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:02:09,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:02:09,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:02:09,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:02:09,375 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:02:09,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-08 06:02:09,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4580bc9/f1af401bf360490d9bfd889c6a0a3661/FLAG682323d05 [2022-04-08 06:02:09,812 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:02:09,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-08 06:02:09,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4580bc9/f1af401bf360490d9bfd889c6a0a3661/FLAG682323d05 [2022-04-08 06:02:09,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4580bc9/f1af401bf360490d9bfd889c6a0a3661 [2022-04-08 06:02:09,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:02:09,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:02:09,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:02:09,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:02:09,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:02:09,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:02:09" (1/1) ... [2022-04-08 06:02:09,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e041938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:09, skipping insertion in model container [2022-04-08 06:02:09,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:02:09" (1/1) ... [2022-04-08 06:02:09,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:02:09,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:02:10,006 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_unwindbound50.c[535,548] [2022-04-08 06:02:10,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:02:10,034 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:02:10,044 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_unwindbound50.c[535,548] [2022-04-08 06:02:10,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:02:10,068 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:02:10,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10 WrapperNode [2022-04-08 06:02:10,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:02:10,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:02:10,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:02:10,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:02:10,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (1/1) ... [2022-04-08 06:02:10,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (1/1) ... [2022-04-08 06:02:10,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (1/1) ... [2022-04-08 06:02:10,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (1/1) ... [2022-04-08 06:02:10,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (1/1) ... [2022-04-08 06:02:10,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (1/1) ... [2022-04-08 06:02:10,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (1/1) ... [2022-04-08 06:02:10,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:02:10,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:02:10,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:02:10,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:02:10,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (1/1) ... [2022-04-08 06:02:10,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:02:10,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:10,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 06:02:10,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 06:02:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:02:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:02:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:02:10,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:02:10,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:02:10,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:02:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:02:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:02:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:02:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:02:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 06:02:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:02:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:02:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:02:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:02:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:02:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:02:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:02:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:02:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:02:10,271 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:02:10,273 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:02:10,472 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:02:10,484 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:02:10,485 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 06:02:10,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:02:10 BoogieIcfgContainer [2022-04-08 06:02:10,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:02:10,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:02:10,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:02:10,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:02:10,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:02:09" (1/3) ... [2022-04-08 06:02:10,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338f2e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:02:10, skipping insertion in model container [2022-04-08 06:02:10,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:02:10" (2/3) ... [2022-04-08 06:02:10,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338f2e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:02:10, skipping insertion in model container [2022-04-08 06:02:10,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:02:10" (3/3) ... [2022-04-08 06:02:10,505 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2022-04-08 06:02:10,508 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:02:10,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:02:10,543 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:02:10,548 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 06:02:10,548 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:02:10,566 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-08 06:02:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 06:02:10,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:10,573 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:10,573 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-08 06:02:10,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:10,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1899123731] [2022-04-08 06:02:10,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-08 06:02:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:10,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514281240] [2022-04-08 06:02:10,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:10,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:10,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445093295] [2022-04-08 06:02:10,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:10,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:10,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:10,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:10,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 06:02:10,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:02:10,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:10,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 06:02:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:10,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:10,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-08 06:02:10,973 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-08 06:02:10,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 06:02:10,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-08 06:02:10,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-08 06:02:10,975 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-08 06:02:10,976 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-08 06:02:10,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 06:02:10,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-08 06:02:10,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 06:02:10,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-08 06:02:10,977 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-08 06:02:10,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 06:02:10,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 06:02:10,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 06:02:10,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-08 06:02:10,979 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-08 06:02:10,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 06:02:10,980 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-08 06:02:10,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 06:02:10,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 06:02:10,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 06:02:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 06:02:10,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:02:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:10,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514281240] [2022-04-08 06:02:10,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:10,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445093295] [2022-04-08 06:02:10,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445093295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:10,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:10,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 06:02:10,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:10,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1899123731] [2022-04-08 06:02:10,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1899123731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:10,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:10,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 06:02:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672190475] [2022-04-08 06:02:10,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:10,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 06:02:10,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:11,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:02:11,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:11,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 06:02:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 06:02:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 06:02:11,061 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-08 06:02:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:11,149 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-08 06:02:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 06:02:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 06:02:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:02:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 06:02:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:02:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 06:02:11,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-08 06:02:11,291 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-08 06:02:11,299 INFO L225 Difference]: With dead ends: 67 [2022-04-08 06:02:11,300 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 06:02:11,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 06:02:11,307 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-08 06:02:11,308 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-08 06:02:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 06:02:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 06:02:11,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:11,335 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-08 06:02:11,336 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-08 06:02:11,336 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-08 06:02:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:11,341 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 06:02:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:02:11,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:11,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:11,343 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-08 06:02:11,343 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-08 06:02:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:11,347 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 06:02:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:02:11,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:11,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:11,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:11,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:11,349 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-08 06:02:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 06:02:11,353 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-08 06:02:11,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:11,354 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 06:02:11,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:02:11,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 06:02:11,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:02:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 06:02:11,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:11,407 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:11,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 06:02:11,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-08 06:02:11,620 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-08 06:02:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:11,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [419953893] [2022-04-08 06:02:11,622 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-08 06:02:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983154225] [2022-04-08 06:02:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:11,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:11,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898739302] [2022-04-08 06:02:11,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:11,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:11,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:11,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:11,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 06:02:11,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:02:11,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:11,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 06:02:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:11,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:11,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-08 06:02:11,902 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-08 06:02:11,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,904 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-08 06:02:11,905 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-08 06:02:11,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,909 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-08 06:02:11,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:11,914 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-08 06:02:11,914 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-08 06:02:11,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {370#false} is VALID [2022-04-08 06:02:11,916 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-08 06:02:11,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-08 06:02:11,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-08 06:02:11,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-08 06:02:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:11,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:02:11,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983154225] [2022-04-08 06:02:11,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:11,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898739302] [2022-04-08 06:02:11,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898739302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:11,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:11,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:11,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:11,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [419953893] [2022-04-08 06:02:11,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [419953893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:11,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:11,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922686602] [2022-04-08 06:02:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 06:02:11,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:11,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:02:11,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:11,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:02:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:02:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:02:11,946 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-08 06:02:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:12,063 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-08 06:02:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:02:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 06:02:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:02:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 06:02:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:02:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 06:02:12,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-08 06:02:12,120 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-08 06:02:12,126 INFO L225 Difference]: With dead ends: 41 [2022-04-08 06:02:12,126 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 06:02:12,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:02:12,133 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-08 06:02:12,134 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-08 06:02:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 06:02:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 06:02:12,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:12,157 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-08 06:02:12,157 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-08 06:02:12,160 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-08 06:02:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:12,167 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 06:02:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 06:02:12,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:12,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:12,170 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-08 06:02:12,171 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-08 06:02:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:12,180 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 06:02:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 06:02:12,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:12,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:12,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:12,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:12,181 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-08 06:02:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-08 06:02:12,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-08 06:02:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:12,184 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-08 06:02:12,184 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:02:12,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-08 06:02:12,235 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-08 06:02:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 06:02:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 06:02:12,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:12,237 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:12,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:12,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 06:02:12,452 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-08 06:02:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:12,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17839342] [2022-04-08 06:02:12,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-08 06:02:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:12,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640536404] [2022-04-08 06:02:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:12,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:12,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570248747] [2022-04-08 06:02:12,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:12,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:12,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:12,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:12,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 06:02:12,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:02:12,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:12,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:02:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:12,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:12,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-08 06:02:12,934 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-08 06:02:12,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 06:02:12,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-08 06:02:12,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-08 06:02:12,935 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-08 06:02:12,935 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-08 06:02:12,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 06:02:12,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 06:02:12,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 06:02:12,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-08 06:02:12,936 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-08 06:02:12,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 06:02:12,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 06:02:12,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 06:02:12,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-08 06:02:14,541 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-08 06:02:14,542 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-08 06:02:14,543 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 < 50);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-08 06:02:15,375 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-08 06:02:15,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:02:15,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-08 06:02:15,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-08 06:02:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:15,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:02:15,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:15,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640536404] [2022-04-08 06:02:15,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:15,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570248747] [2022-04-08 06:02:15,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570248747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:15,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:15,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:02:15,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:15,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17839342] [2022-04-08 06:02:15,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17839342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:15,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:15,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:02:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356657128] [2022-04-08 06:02:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:15,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 06:02:15,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:15,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:02:17,787 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-08 06:02:17,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:02:17,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:17,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:02:17,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:02:17,789 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-08 06:02:23,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:02:28,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:02:31,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:02:33,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:02:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:33,347 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-08 06:02:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:02:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 06:02:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:02:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 06:02:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:02:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 06:02:33,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-08 06:02:38,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:38,084 INFO L225 Difference]: With dead ends: 53 [2022-04-08 06:02:38,084 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 06:02:38,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:02:38,085 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:38,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-04-08 06:02:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 06:02:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 06:02:38,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:38,107 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-08 06:02:38,107 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-08 06:02:38,108 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-08 06:02:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:38,111 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 06:02:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 06:02:38,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:38,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:38,112 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-08 06:02:38,112 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-08 06:02:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:38,115 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 06:02:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 06:02:38,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:38,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:38,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:38,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:38,117 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-08 06:02:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-08 06:02:38,119 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-08 06:02:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:38,119 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-08 06:02:38,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:02:38,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-08 06:02:44,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-08 06:02:44,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 06:02:44,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:44,232 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:44,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:44,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:44,433 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:44,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-08 06:02:44,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:44,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125820065] [2022-04-08 06:02:44,434 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-08 06:02:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:44,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548280558] [2022-04-08 06:02:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:44,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:44,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727210145] [2022-04-08 06:02:44,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:44,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:44,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:44,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:44,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 06:02:44,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:44,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:44,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 06:02:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:44,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:44,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 06:02:44,728 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-08 06:02:44,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:02:44,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 06:02:44,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 06:02:44,729 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-08 06:02:44,729 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-08 06:02:44,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:02:44,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:02:44,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:02:44,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 06:02:44,730 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-08 06:02:44,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:02:44,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:02:44,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:02:44,731 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 06:02:44,731 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-08 06:02:44,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 06:02:44,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 50);havoc #t~post6; {1042#true} is VALID [2022-04-08 06:02:44,734 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-08 06:02:44,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:02:44,735 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-08 06:02:44,735 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-08 06:02:44,736 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-08 06:02:44,737 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-08 06:02:44,738 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-08 06:02:44,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:02:44,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 06:02:44,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 06:02:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:44,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:45,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 06:02:45,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 06:02:45,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:02:45,202 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-08 06:02:45,202 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-08 06:02:45,203 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-08 06:02:45,205 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-08 06:02:45,210 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-08 06:02:45,211 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-08 06:02:45,211 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-08 06:02:45,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 50);havoc #t~post6; {1042#true} is VALID [2022-04-08 06:02:45,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 06:02:45,211 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-08 06:02:45,212 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 06:02:45,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:02:45,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:02:45,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:02:45,212 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-08 06:02:45,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 06:02:45,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:02:45,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:02:45,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:02:45,213 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-08 06:02:45,213 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-08 06:02:45,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 06:02:45,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 06:02:45,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:02:45,214 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-08 06:02:45,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 06:02:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:45,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548280558] [2022-04-08 06:02:45,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:45,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727210145] [2022-04-08 06:02:45,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727210145] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:45,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:45,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 06:02:45,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:45,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125820065] [2022-04-08 06:02:45,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125820065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:45,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:45,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:02:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849207749] [2022-04-08 06:02:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:45,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 06:02:45,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:45,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:02:45,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:45,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:02:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:45,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:02:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:02:45,238 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-08 06:02:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:45,655 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-08 06:02:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:02:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 06:02:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:02:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 06:02:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:02:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 06:02:45,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 06:02:45,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:45,709 INFO L225 Difference]: With dead ends: 57 [2022-04-08 06:02:45,710 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 06:02:45,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:02:45,711 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:45,711 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.1s Time] [2022-04-08 06:02:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 06:02:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-08 06:02:45,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:45,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 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-08 06:02:45,736 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 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-08 06:02:45,736 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 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-08 06:02:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:45,739 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 06:02:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 06:02:45,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:45,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:45,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 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 52 states. [2022-04-08 06:02:45,740 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 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 52 states. [2022-04-08 06:02:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:45,743 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 06:02:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 06:02:45,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:45,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:45,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:45,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 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-08 06:02:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-08 06:02:45,746 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-08 06:02:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:45,746 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-08 06:02:45,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:02:45,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-08 06:02:46,073 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-08 06:02:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 06:02:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 06:02:46,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:46,074 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-08 06:02:46,092 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-08 06:02:46,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:46,280 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-08 06:02:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:46,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772762916] [2022-04-08 06:02:46,281 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-08 06:02:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:46,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920381555] [2022-04-08 06:02:46,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:46,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:46,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:46,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667192021] [2022-04-08 06:02:46,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:46,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:46,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:46,298 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:46,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 06:02:46,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:46,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:46,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:02:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:46,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:46,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-08 06:02:46,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#(<= ~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; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,690 INFO L272 TraceCheckUtils]: 11: Hoare triple {1529#(<= ~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)); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,691 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,694 INFO L272 TraceCheckUtils]: 19: Hoare triple {1578#(<= ~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)); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,696 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(<= |main_#t~post7| 1)} is VALID [2022-04-08 06:02:46,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1522#false} is VALID [2022-04-08 06:02:46,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-08 06:02:46,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 50);havoc #t~post8; {1522#false} is VALID [2022-04-08 06:02:46,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-08 06:02:46,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 50);havoc #t~post6; {1522#false} is VALID [2022-04-08 06:02:46,698 INFO L272 TraceCheckUtils]: 31: Hoare triple {1522#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)); {1522#false} is VALID [2022-04-08 06:02:46,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-08 06:02:46,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 06:02:46,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 06:02:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:46,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:02:46,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:46,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920381555] [2022-04-08 06:02:46,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:46,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667192021] [2022-04-08 06:02:46,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667192021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:46,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:46,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:02:46,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:46,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772762916] [2022-04-08 06:02:46,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772762916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:46,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:46,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:02:46,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335857682] [2022-04-08 06:02:46,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:46,701 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-08 06:02:46,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:46,701 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-08 06:02:46,730 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-08 06:02:46,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:02:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:46,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:02:46,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:02:46,731 INFO L87 Difference]: Start difference. First operand 36 states and 43 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-08 06:02:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:46,874 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-08 06:02:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:02:46,875 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-08 06:02:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:46,875 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-08 06:02:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 06:02:46,877 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-08 06:02:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 06:02:46,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-08 06:02:46,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:46,945 INFO L225 Difference]: With dead ends: 65 [2022-04-08 06:02:46,945 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 06:02:46,946 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-08 06:02:46,946 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-08 06:02:46,947 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-08 06:02:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 06:02:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 06:02:46,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:46,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:02:46,978 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:02:46,979 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:02:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:46,993 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 06:02:46,993 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 06:02:46,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:46,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:46,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 06:02:46,994 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 06:02:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:46,996 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 06:02:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 06:02:46,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:46,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:46,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:46,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:02:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-08 06:02:46,999 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-08 06:02:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:46,999 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-08 06:02:46,999 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-08 06:02:46,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-08 06:02:48,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 06:02:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 06:02:48,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:48,116 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-08 06:02:48,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:48,316 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:48,316 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:48,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-08 06:02:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:48,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926451418] [2022-04-08 06:02:48,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-08 06:02:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:48,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292836294] [2022-04-08 06:02:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:48,339 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:48,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745353960] [2022-04-08 06:02:48,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:48,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:48,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:48,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:48,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 06:02:48,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:48,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:48,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:02:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:48,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:48,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-08 06:02:48,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(<= ~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; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,644 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#(<= ~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)); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:48,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:48,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {1993#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:48,649 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~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)); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:48,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:48,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:48,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:48,653 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:48,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:48,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:48,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {2018#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:48,656 INFO L272 TraceCheckUtils]: 27: Hoare triple {2018#(<= ~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)); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:48,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:48,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:48,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:48,658 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:48,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:48,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2043#(<= |main_#t~post8| 2)} is VALID [2022-04-08 06:02:48,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 50);havoc #t~post8; {1937#false} is VALID [2022-04-08 06:02:48,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-08 06:02:48,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 50);havoc #t~post6; {1937#false} is VALID [2022-04-08 06:02:48,663 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#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)); {1937#false} is VALID [2022-04-08 06:02:48,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-08 06:02:48,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-08 06:02:48,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-08 06:02:48,664 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-08 06:02:48,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:48,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-08 06:02:48,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-08 06:02:48,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-08 06:02:48,921 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#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)); {1937#false} is VALID [2022-04-08 06:02:48,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 50);havoc #t~post6; {1937#false} is VALID [2022-04-08 06:02:48,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-08 06:02:48,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {1937#false} is VALID [2022-04-08 06:02:48,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {2087#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2083#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:02:48,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 50)} assume !(~r~0 > 0); {2087#(< ~counter~0 50)} is VALID [2022-04-08 06:02:48,923 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 50)} #96#return; {2087#(< ~counter~0 50)} is VALID [2022-04-08 06:02:48,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 06:02:48,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 06:02:48,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 06:02:48,923 INFO L272 TraceCheckUtils]: 27: Hoare triple {2087#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1936#true} is VALID [2022-04-08 06:02:48,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {2087#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {2087#(< ~counter~0 50)} is VALID [2022-04-08 06:02:48,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2087#(< ~counter~0 50)} is VALID [2022-04-08 06:02:48,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 49)} assume !!(0 != ~r~0); {2112#(< ~counter~0 49)} is VALID [2022-04-08 06:02:48,925 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 49)} #94#return; {2112#(< ~counter~0 49)} is VALID [2022-04-08 06:02:48,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 06:02:48,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 06:02:48,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 06:02:48,926 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1936#true} is VALID [2022-04-08 06:02:48,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2112#(< ~counter~0 49)} is VALID [2022-04-08 06:02:48,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {2137#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2112#(< ~counter~0 49)} is VALID [2022-04-08 06:02:48,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2137#(< ~counter~0 48)} is VALID [2022-04-08 06:02:48,927 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2137#(< ~counter~0 48)} #92#return; {2137#(< ~counter~0 48)} is VALID [2022-04-08 06:02:48,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 06:02:48,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 06:02:48,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 06:02:48,928 INFO L272 TraceCheckUtils]: 11: Hoare triple {2137#(< ~counter~0 48)} 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)); {1936#true} is VALID [2022-04-08 06:02:48,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2137#(< ~counter~0 48)} #90#return; {2137#(< ~counter~0 48)} is VALID [2022-04-08 06:02:48,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 06:02:48,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 06:02:48,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 06:02:48,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {2137#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1936#true} is VALID [2022-04-08 06:02:48,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(< ~counter~0 48)} 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; {2137#(< ~counter~0 48)} is VALID [2022-04-08 06:02:48,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#(< ~counter~0 48)} call #t~ret9 := main(); {2137#(< ~counter~0 48)} is VALID [2022-04-08 06:02:48,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#(< ~counter~0 48)} {1936#true} #102#return; {2137#(< ~counter~0 48)} is VALID [2022-04-08 06:02:48,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#(< ~counter~0 48)} assume true; {2137#(< ~counter~0 48)} is VALID [2022-04-08 06:02:48,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2137#(< ~counter~0 48)} is VALID [2022-04-08 06:02:48,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-08 06:02:48,931 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-08 06:02:48,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292836294] [2022-04-08 06:02:48,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745353960] [2022-04-08 06:02:48,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745353960] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:02:48,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:02:48,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-08 06:02:48,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:48,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [926451418] [2022-04-08 06:02:48,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [926451418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:48,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:48,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:02:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127300899] [2022-04-08 06:02:48,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:48,933 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-08 06:02:48,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:48,933 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-08 06:02:48,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:48,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:02:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:48,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:02:48,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:02:48,971 INFO L87 Difference]: Start difference. First operand 44 states and 51 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-08 06:02:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:49,160 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-08 06:02:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:02:49,160 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-08 06:02:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:49,161 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-08 06:02:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 06:02:49,163 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-08 06:02:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 06:02:49,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-08 06:02:49,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:49,239 INFO L225 Difference]: With dead ends: 74 [2022-04-08 06:02:49,239 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 06:02:49,240 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-08 06:02:49,240 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:49,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:02:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 06:02:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-08 06:02:49,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:49,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:02:49,293 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:02:49,293 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:02:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:49,295 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 06:02:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 06:02:49,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:49,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:49,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-08 06:02:49,296 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-08 06:02:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:49,299 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 06:02:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 06:02:49,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:49,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:49,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:49,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:02:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-08 06:02:49,303 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-08 06:02:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:49,305 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-08 06:02:49,305 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-08 06:02:49,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-08 06:02:50,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-08 06:02:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 06:02:50,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:50,313 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-08 06:02:50,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:50,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:50,514 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-08 06:02:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:50,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245102727] [2022-04-08 06:02:50,515 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-08 06:02:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:50,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604589993] [2022-04-08 06:02:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:50,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:50,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301010512] [2022-04-08 06:02:50,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:50,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:50,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:50,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:50,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 06:02:50,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:50,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:50,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:02:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:50,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:50,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-08 06:02:50,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2557#(<= ~counter~0 0)} {2549#true} #102#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {2557#(<= ~counter~0 0)} call #t~ret9 := main(); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {2557#(<= ~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; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,871 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #90#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,872 INFO L272 TraceCheckUtils]: 11: Hoare triple {2557#(<= ~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)); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,876 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #92#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {2557#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:50,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {2557#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:50,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {2606#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:50,878 INFO L272 TraceCheckUtils]: 19: Hoare triple {2606#(<= ~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)); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:50,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#(<= ~counter~0 1)} ~cond := #in~cond; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:50,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#(<= ~counter~0 1)} assume !(0 == ~cond); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:50,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {2606#(<= ~counter~0 1)} assume true; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:50,879 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2606#(<= ~counter~0 1)} {2606#(<= ~counter~0 1)} #94#return; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:50,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {2606#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:50,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {2606#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:50,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {2631#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:50,881 INFO L272 TraceCheckUtils]: 27: Hoare triple {2631#(<= ~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)); {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:50,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#(<= ~counter~0 2)} ~cond := #in~cond; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:50,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {2631#(<= ~counter~0 2)} assume !(0 == ~cond); {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:50,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {2631#(<= ~counter~0 2)} assume true; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:50,882 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2631#(<= ~counter~0 2)} {2631#(<= ~counter~0 2)} #96#return; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:50,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {2631#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:50,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {2631#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2656#(<= |main_#t~post7| 2)} is VALID [2022-04-08 06:02:50,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {2656#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {2550#false} is VALID [2022-04-08 06:02:50,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-08 06:02:50,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 50);havoc #t~post8; {2550#false} is VALID [2022-04-08 06:02:50,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-08 06:02:50,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 50);havoc #t~post6; {2550#false} is VALID [2022-04-08 06:02:50,884 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#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)); {2550#false} is VALID [2022-04-08 06:02:50,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-08 06:02:50,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-08 06:02:50,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-08 06:02:50,885 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-08 06:02:50,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:51,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-08 06:02:51,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-08 06:02:51,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-08 06:02:51,125 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#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)); {2550#false} is VALID [2022-04-08 06:02:51,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 50);havoc #t~post6; {2550#false} is VALID [2022-04-08 06:02:51,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-08 06:02:51,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 50);havoc #t~post8; {2550#false} is VALID [2022-04-08 06:02:51,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-08 06:02:51,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {2550#false} is VALID [2022-04-08 06:02:51,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {2712#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2708#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:02:51,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {2712#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2712#(< ~counter~0 50)} is VALID [2022-04-08 06:02:51,128 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2549#true} {2712#(< ~counter~0 50)} #96#return; {2712#(< ~counter~0 50)} is VALID [2022-04-08 06:02:51,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 06:02:51,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 06:02:51,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 06:02:51,129 INFO L272 TraceCheckUtils]: 27: Hoare triple {2712#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2549#true} is VALID [2022-04-08 06:02:51,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {2712#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {2712#(< ~counter~0 50)} is VALID [2022-04-08 06:02:51,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {2737#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2712#(< ~counter~0 50)} is VALID [2022-04-08 06:02:51,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(< ~counter~0 49)} assume !!(0 != ~r~0); {2737#(< ~counter~0 49)} is VALID [2022-04-08 06:02:51,131 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2737#(< ~counter~0 49)} #94#return; {2737#(< ~counter~0 49)} is VALID [2022-04-08 06:02:51,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 06:02:51,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 06:02:51,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 06:02:51,131 INFO L272 TraceCheckUtils]: 19: Hoare triple {2737#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2549#true} is VALID [2022-04-08 06:02:51,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {2737#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2737#(< ~counter~0 49)} is VALID [2022-04-08 06:02:51,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2737#(< ~counter~0 49)} is VALID [2022-04-08 06:02:51,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2762#(< ~counter~0 48)} is VALID [2022-04-08 06:02:51,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2549#true} {2762#(< ~counter~0 48)} #92#return; {2762#(< ~counter~0 48)} is VALID [2022-04-08 06:02:51,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 06:02:51,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 06:02:51,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 06:02:51,134 INFO L272 TraceCheckUtils]: 11: Hoare triple {2762#(< ~counter~0 48)} 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)); {2549#true} is VALID [2022-04-08 06:02:51,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2549#true} {2762#(< ~counter~0 48)} #90#return; {2762#(< ~counter~0 48)} is VALID [2022-04-08 06:02:51,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 06:02:51,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 06:02:51,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 06:02:51,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {2762#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2549#true} is VALID [2022-04-08 06:02:51,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#(< ~counter~0 48)} 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; {2762#(< ~counter~0 48)} is VALID [2022-04-08 06:02:51,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#(< ~counter~0 48)} call #t~ret9 := main(); {2762#(< ~counter~0 48)} is VALID [2022-04-08 06:02:51,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#(< ~counter~0 48)} {2549#true} #102#return; {2762#(< ~counter~0 48)} is VALID [2022-04-08 06:02:51,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#(< ~counter~0 48)} assume true; {2762#(< ~counter~0 48)} is VALID [2022-04-08 06:02:51,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2762#(< ~counter~0 48)} is VALID [2022-04-08 06:02:51,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-08 06:02:51,137 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-08 06:02:51,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:51,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604589993] [2022-04-08 06:02:51,138 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:51,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301010512] [2022-04-08 06:02:51,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301010512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:51,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:51,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 06:02:51,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:51,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245102727] [2022-04-08 06:02:51,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245102727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:51,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:51,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:02:51,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704837595] [2022-04-08 06:02:51,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:51,139 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-08 06:02:51,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:51,140 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-08 06:02:51,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:51,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:02:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:02:51,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:02:51,175 INFO L87 Difference]: Start difference. First operand 52 states and 60 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-08 06:02:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:51,388 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-08 06:02:51,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:02:51,389 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-08 06:02:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:51,389 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-08 06:02:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 06:02:51,391 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-08 06:02:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 06:02:51,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-08 06:02:51,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:51,465 INFO L225 Difference]: With dead ends: 75 [2022-04-08 06:02:51,465 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 06:02:51,465 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-08 06:02:51,466 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-08 06:02:51,466 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-08 06:02:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 06:02:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 06:02:51,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:51,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:02:51,524 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:02:51,524 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:02:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:51,526 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 06:02:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 06:02:51,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:51,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:51,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 06:02:51,527 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 06:02:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:51,529 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 06:02:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 06:02:51,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:51,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:51,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:51,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:02:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-08 06:02:51,532 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-08 06:02:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:51,532 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-08 06:02:51,532 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-08 06:02:51,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-08 06:02:52,250 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-08 06:02:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 06:02:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 06:02:52,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:52,251 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-08 06:02:52,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:52,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:52,452 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-08 06:02:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:52,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2117737877] [2022-04-08 06:02:52,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-08 06:02:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:52,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530650502] [2022-04-08 06:02:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:52,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:52,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767352635] [2022-04-08 06:02:52,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:52,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:52,471 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:52,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 06:02:52,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:52,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:52,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:02:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:52,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:52,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-08 06:02:52,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3184#true} is VALID [2022-04-08 06:02:52,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:02:52,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #102#return; {3184#true} is VALID [2022-04-08 06:02:52,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret9 := main(); {3184#true} is VALID [2022-04-08 06:02:52,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#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; {3184#true} is VALID [2022-04-08 06:02:52,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {3184#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3184#true} is VALID [2022-04-08 06:02:52,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:02:52,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:02:52,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:02:52,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3184#true} {3184#true} #90#return; {3184#true} is VALID [2022-04-08 06:02:52,723 INFO L272 TraceCheckUtils]: 11: Hoare triple {3184#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)); {3184#true} is VALID [2022-04-08 06:02:52,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:02:52,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:02:52,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:02:52,723 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3184#true} {3184#true} #92#return; {3184#true} is VALID [2022-04-08 06:02:52,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3184#true} is VALID [2022-04-08 06:02:52,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3184#true} is VALID [2022-04-08 06:02:52,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !!(#t~post6 < 50);havoc #t~post6; {3184#true} is VALID [2022-04-08 06:02:52,724 INFO L272 TraceCheckUtils]: 19: Hoare triple {3184#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)); {3184#true} is VALID [2022-04-08 06:02:52,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:02:52,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:02:52,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:02:52,724 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3184#true} {3184#true} #94#return; {3184#true} is VALID [2022-04-08 06:02:52,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} assume !!(0 != ~r~0); {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 06:02:52,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {3261#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 06:02:52,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {3261#(not (= main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 06:02:52,726 INFO L272 TraceCheckUtils]: 27: Hoare triple {3261#(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)); {3184#true} is VALID [2022-04-08 06:02:52,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:02:52,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:02:52,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:02:52,727 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3184#true} {3261#(not (= main_~r~0 0))} #96#return; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 06:02:52,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {3261#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:02:52,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:02:52,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:02:52,734 INFO L272 TraceCheckUtils]: 35: Hoare triple {3286#(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)); {3184#true} is VALID [2022-04-08 06:02:52,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:02:52,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:02:52,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:02:52,736 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3184#true} {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:02:52,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3185#false} is VALID [2022-04-08 06:02:52,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3185#false} is VALID [2022-04-08 06:02:52,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume !(#t~post6 < 50);havoc #t~post6; {3185#false} is VALID [2022-04-08 06:02:52,738 INFO L272 TraceCheckUtils]: 43: Hoare triple {3185#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)); {3185#false} is VALID [2022-04-08 06:02:52,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-08 06:02:52,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-08 06:02:52,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-08 06:02:52,742 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-08 06:02:52,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:02:52,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:52,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530650502] [2022-04-08 06:02:52,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767352635] [2022-04-08 06:02:52,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767352635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:52,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:52,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:52,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2117737877] [2022-04-08 06:02:52,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2117737877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:52,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:52,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957175953] [2022-04-08 06:02:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:52,746 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-08 06:02:52,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:52,747 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-08 06:02:52,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:52,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:02:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:02:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:02:52,780 INFO L87 Difference]: Start difference. First operand 54 states and 62 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-08 06:02:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:52,977 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-08 06:02:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:02:52,977 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-08 06:02:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:52,977 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-08 06:02:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 06:02:52,980 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-08 06:02:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 06:02:52,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-08 06:02:53,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:53,082 INFO L225 Difference]: With dead ends: 101 [2022-04-08 06:02:53,082 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 06:02:53,083 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-08 06:02:53,083 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-08 06:02:53,084 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-08 06:02:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 06:02:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-08 06:02:53,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:53,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:02:53,155 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:02:53,156 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:02:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:53,160 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 06:02:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 06:02:53,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:53,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:53,161 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), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-08 06:02:53,161 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), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-08 06:02:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:53,164 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 06:02:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 06:02:53,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:53,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:53,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:53,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:53,166 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), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:02:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-08 06:02:53,168 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-08 06:02:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:53,168 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-08 06:02:53,168 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-08 06:02:53,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-08 06:02:55,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 86 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 06:02:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 06:02:55,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:55,308 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-08 06:02:55,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:55,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-08 06:02:55,509 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-08 06:02:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:55,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853659884] [2022-04-08 06:02:55,510 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-08 06:02:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:55,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232905541] [2022-04-08 06:02:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:55,521 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:55,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938205041] [2022-04-08 06:02:55,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:55,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:55,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:55,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:55,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 06:02:55,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:55,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:55,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:02:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:55,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:55,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-08 06:02:55,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#(<= ~counter~0 0)} {3830#true} #102#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#(<= ~counter~0 0)} call #t~ret9 := main(); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#(<= ~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; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,890 INFO L272 TraceCheckUtils]: 6: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #90#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,892 INFO L272 TraceCheckUtils]: 11: Hoare triple {3838#(<= ~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)); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,894 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #92#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {3838#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:55,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:55,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:55,897 INFO L272 TraceCheckUtils]: 19: Hoare triple {3887#(<= ~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)); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:55,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {3887#(<= ~counter~0 1)} ~cond := #in~cond; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:55,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {3887#(<= ~counter~0 1)} assume !(0 == ~cond); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:55,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {3887#(<= ~counter~0 1)} assume true; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:55,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3887#(<= ~counter~0 1)} {3887#(<= ~counter~0 1)} #94#return; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:55,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {3887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:55,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {3887#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:55,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {3912#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:55,901 INFO L272 TraceCheckUtils]: 27: Hoare triple {3912#(<= ~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)); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:55,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {3912#(<= ~counter~0 2)} ~cond := #in~cond; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:55,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= ~counter~0 2)} assume !(0 == ~cond); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:55,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= ~counter~0 2)} assume true; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:55,902 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3912#(<= ~counter~0 2)} {3912#(<= ~counter~0 2)} #96#return; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:55,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {3912#(<= ~counter~0 2)} assume !(~r~0 > 0); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:55,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {3912#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:55,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {3937#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:55,904 INFO L272 TraceCheckUtils]: 35: Hoare triple {3937#(<= ~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)); {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:55,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(<= ~counter~0 3)} ~cond := #in~cond; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:55,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(<= ~counter~0 3)} assume !(0 == ~cond); {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:55,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {3937#(<= ~counter~0 3)} assume true; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:55,906 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3937#(<= ~counter~0 3)} {3937#(<= ~counter~0 3)} #98#return; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:55,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:55,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3962#(<= |main_#t~post8| 3)} is VALID [2022-04-08 06:02:55,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {3962#(<= |main_#t~post8| 3)} assume !(#t~post8 < 50);havoc #t~post8; {3831#false} is VALID [2022-04-08 06:02:55,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-08 06:02:55,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 50);havoc #t~post6; {3831#false} is VALID [2022-04-08 06:02:55,908 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#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)); {3831#false} is VALID [2022-04-08 06:02:55,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-08 06:02:55,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-08 06:02:55,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-08 06:02:55,910 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-08 06:02:55,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:56,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-08 06:02:56,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-08 06:02:56,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-08 06:02:56,206 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#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)); {3831#false} is VALID [2022-04-08 06:02:56,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 50);havoc #t~post6; {3831#false} is VALID [2022-04-08 06:02:56,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-08 06:02:56,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {4002#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {3831#false} is VALID [2022-04-08 06:02:56,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {4006#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4002#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:02:56,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {4006#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4006#(< ~counter~0 50)} is VALID [2022-04-08 06:02:56,208 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3830#true} {4006#(< ~counter~0 50)} #98#return; {4006#(< ~counter~0 50)} is VALID [2022-04-08 06:02:56,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:02:56,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:02:56,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:02:56,209 INFO L272 TraceCheckUtils]: 35: Hoare triple {4006#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 06:02:56,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {4006#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {4006#(< ~counter~0 50)} is VALID [2022-04-08 06:02:56,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {4031#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4006#(< ~counter~0 50)} is VALID [2022-04-08 06:02:56,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(< ~counter~0 49)} assume !(~r~0 > 0); {4031#(< ~counter~0 49)} is VALID [2022-04-08 06:02:56,211 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3830#true} {4031#(< ~counter~0 49)} #96#return; {4031#(< ~counter~0 49)} is VALID [2022-04-08 06:02:56,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:02:56,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:02:56,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:02:56,211 INFO L272 TraceCheckUtils]: 27: Hoare triple {4031#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 06:02:56,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {4031#(< ~counter~0 49)} is VALID [2022-04-08 06:02:56,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {4056#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4031#(< ~counter~0 49)} is VALID [2022-04-08 06:02:56,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(< ~counter~0 48)} assume !!(0 != ~r~0); {4056#(< ~counter~0 48)} is VALID [2022-04-08 06:02:56,219 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3830#true} {4056#(< ~counter~0 48)} #94#return; {4056#(< ~counter~0 48)} is VALID [2022-04-08 06:02:56,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:02:56,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:02:56,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:02:56,220 INFO L272 TraceCheckUtils]: 19: Hoare triple {4056#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 06:02:56,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {4056#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {4056#(< ~counter~0 48)} is VALID [2022-04-08 06:02:56,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {4081#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4056#(< ~counter~0 48)} is VALID [2022-04-08 06:02:56,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {4081#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4081#(< ~counter~0 47)} is VALID [2022-04-08 06:02:56,222 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3830#true} {4081#(< ~counter~0 47)} #92#return; {4081#(< ~counter~0 47)} is VALID [2022-04-08 06:02:56,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:02:56,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:02:56,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:02:56,222 INFO L272 TraceCheckUtils]: 11: Hoare triple {4081#(< ~counter~0 47)} 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)); {3830#true} is VALID [2022-04-08 06:02:56,223 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3830#true} {4081#(< ~counter~0 47)} #90#return; {4081#(< ~counter~0 47)} is VALID [2022-04-08 06:02:56,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:02:56,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:02:56,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:02:56,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {4081#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 06:02:56,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {4081#(< ~counter~0 47)} 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; {4081#(< ~counter~0 47)} is VALID [2022-04-08 06:02:56,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {4081#(< ~counter~0 47)} call #t~ret9 := main(); {4081#(< ~counter~0 47)} is VALID [2022-04-08 06:02:56,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4081#(< ~counter~0 47)} {3830#true} #102#return; {4081#(< ~counter~0 47)} is VALID [2022-04-08 06:02:56,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {4081#(< ~counter~0 47)} assume true; {4081#(< ~counter~0 47)} is VALID [2022-04-08 06:02:56,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4081#(< ~counter~0 47)} is VALID [2022-04-08 06:02:56,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-08 06:02:56,227 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-08 06:02:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:56,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232905541] [2022-04-08 06:02:56,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:56,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938205041] [2022-04-08 06:02:56,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938205041] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:56,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:56,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 06:02:56,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:56,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853659884] [2022-04-08 06:02:56,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853659884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:56,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:56,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 06:02:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432724653] [2022-04-08 06:02:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:56,229 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-08 06:02:56,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:56,230 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-08 06:02:56,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:56,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 06:02:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:56,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 06:02:56,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:02:56,269 INFO L87 Difference]: Start difference. First operand 70 states and 87 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-08 06:02:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:56,520 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-08 06:02:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:02:56,520 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-08 06:02:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:56,521 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-08 06:02:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 06:02:56,523 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-08 06:02:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 06:02:56,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-08 06:02:56,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:56,606 INFO L225 Difference]: With dead ends: 118 [2022-04-08 06:02:56,606 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 06:02:56,607 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-08 06:02:56,607 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:56,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:02:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 06:02:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-08 06:02:56,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:56,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:02:56,703 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:02:56,704 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:02:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:56,707 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 06:02:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 06:02:56,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:56,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:56,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-08 06:02:56,708 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-08 06:02:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:56,710 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 06:02:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 06:02:56,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:56,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:56,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:56,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:02:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-08 06:02:56,714 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-08 06:02:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:56,714 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-08 06:02:56,715 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-08 06:02:56,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-08 06:02:58,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-08 06:02:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 06:02:58,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:58,874 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-08 06:02:58,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 06:02:59,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:59,075 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-08 06:02:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:59,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100098862] [2022-04-08 06:02:59,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-08 06:02:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:59,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605117836] [2022-04-08 06:02:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:59,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:59,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112987740] [2022-04-08 06:02:59,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:02:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:59,101 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:59,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 06:02:59,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:02:59,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:59,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:02:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:59,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:59,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-08 06:02:59,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4703#(<= ~counter~0 0)} {4695#true} #102#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {4703#(<= ~counter~0 0)} call #t~ret9 := main(); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {4703#(<= ~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; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,450 INFO L272 TraceCheckUtils]: 6: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #90#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,452 INFO L272 TraceCheckUtils]: 11: Hoare triple {4703#(<= ~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)); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,453 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #92#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {4703#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:59,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {4703#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:59,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {4752#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:59,455 INFO L272 TraceCheckUtils]: 19: Hoare triple {4752#(<= ~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)); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:59,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {4752#(<= ~counter~0 1)} ~cond := #in~cond; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:59,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {4752#(<= ~counter~0 1)} assume !(0 == ~cond); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:59,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {4752#(<= ~counter~0 1)} assume true; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:59,456 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4752#(<= ~counter~0 1)} {4752#(<= ~counter~0 1)} #94#return; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:59,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {4752#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:59,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {4752#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:59,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {4777#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:59,458 INFO L272 TraceCheckUtils]: 27: Hoare triple {4777#(<= ~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)); {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:59,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {4777#(<= ~counter~0 2)} ~cond := #in~cond; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:59,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {4777#(<= ~counter~0 2)} assume !(0 == ~cond); {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:59,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {4777#(<= ~counter~0 2)} assume true; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:59,459 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4777#(<= ~counter~0 2)} {4777#(<= ~counter~0 2)} #96#return; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:59,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {4777#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:59,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {4777#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:59,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {4802#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:59,461 INFO L272 TraceCheckUtils]: 35: Hoare triple {4802#(<= ~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)); {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:59,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {4802#(<= ~counter~0 3)} ~cond := #in~cond; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:59,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {4802#(<= ~counter~0 3)} assume !(0 == ~cond); {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:59,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {4802#(<= ~counter~0 3)} assume true; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:59,462 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4802#(<= ~counter~0 3)} {4802#(<= ~counter~0 3)} #96#return; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:59,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {4802#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:59,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {4802#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4827#(<= |main_#t~post7| 3)} is VALID [2022-04-08 06:02:59,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#(<= |main_#t~post7| 3)} assume !(#t~post7 < 50);havoc #t~post7; {4696#false} is VALID [2022-04-08 06:02:59,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-08 06:02:59,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 50);havoc #t~post8; {4696#false} is VALID [2022-04-08 06:02:59,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-08 06:02:59,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 50);havoc #t~post6; {4696#false} is VALID [2022-04-08 06:02:59,464 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#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)); {4696#false} is VALID [2022-04-08 06:02:59,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-08 06:02:59,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-08 06:02:59,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-08 06:02:59,464 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-08 06:02:59,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:59,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-08 06:02:59,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-08 06:02:59,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-08 06:02:59,717 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#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)); {4696#false} is VALID [2022-04-08 06:02:59,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 50);havoc #t~post6; {4696#false} is VALID [2022-04-08 06:02:59,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-08 06:02:59,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 50);havoc #t~post8; {4696#false} is VALID [2022-04-08 06:02:59,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-08 06:02:59,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {4696#false} is VALID [2022-04-08 06:02:59,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {4883#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4879#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:02:59,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {4883#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4883#(< ~counter~0 50)} is VALID [2022-04-08 06:02:59,719 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4695#true} {4883#(< ~counter~0 50)} #96#return; {4883#(< ~counter~0 50)} is VALID [2022-04-08 06:02:59,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:02:59,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:02:59,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:02:59,719 INFO L272 TraceCheckUtils]: 35: Hoare triple {4883#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 06:02:59,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {4883#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {4883#(< ~counter~0 50)} is VALID [2022-04-08 06:02:59,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {4908#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4883#(< ~counter~0 50)} is VALID [2022-04-08 06:02:59,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {4908#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4908#(< ~counter~0 49)} is VALID [2022-04-08 06:02:59,721 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4695#true} {4908#(< ~counter~0 49)} #96#return; {4908#(< ~counter~0 49)} is VALID [2022-04-08 06:02:59,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:02:59,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:02:59,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:02:59,722 INFO L272 TraceCheckUtils]: 27: Hoare triple {4908#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 06:02:59,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {4908#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {4908#(< ~counter~0 49)} is VALID [2022-04-08 06:02:59,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {4933#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4908#(< ~counter~0 49)} is VALID [2022-04-08 06:02:59,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 48)} assume !!(0 != ~r~0); {4933#(< ~counter~0 48)} is VALID [2022-04-08 06:02:59,723 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4695#true} {4933#(< ~counter~0 48)} #94#return; {4933#(< ~counter~0 48)} is VALID [2022-04-08 06:02:59,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:02:59,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:02:59,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:02:59,724 INFO L272 TraceCheckUtils]: 19: Hoare triple {4933#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 06:02:59,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {4933#(< ~counter~0 48)} is VALID [2022-04-08 06:02:59,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4933#(< ~counter~0 48)} is VALID [2022-04-08 06:02:59,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4958#(< ~counter~0 47)} is VALID [2022-04-08 06:02:59,725 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4695#true} {4958#(< ~counter~0 47)} #92#return; {4958#(< ~counter~0 47)} is VALID [2022-04-08 06:02:59,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:02:59,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:02:59,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:02:59,725 INFO L272 TraceCheckUtils]: 11: Hoare triple {4958#(< ~counter~0 47)} 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)); {4695#true} is VALID [2022-04-08 06:02:59,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4695#true} {4958#(< ~counter~0 47)} #90#return; {4958#(< ~counter~0 47)} is VALID [2022-04-08 06:02:59,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:02:59,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:02:59,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:02:59,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {4958#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 06:02:59,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {4958#(< ~counter~0 47)} 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; {4958#(< ~counter~0 47)} is VALID [2022-04-08 06:02:59,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {4958#(< ~counter~0 47)} call #t~ret9 := main(); {4958#(< ~counter~0 47)} is VALID [2022-04-08 06:02:59,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4958#(< ~counter~0 47)} {4695#true} #102#return; {4958#(< ~counter~0 47)} is VALID [2022-04-08 06:02:59,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#(< ~counter~0 47)} assume true; {4958#(< ~counter~0 47)} is VALID [2022-04-08 06:02:59,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4958#(< ~counter~0 47)} is VALID [2022-04-08 06:02:59,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-08 06:02:59,733 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-08 06:02:59,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:59,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605117836] [2022-04-08 06:02:59,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:59,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112987740] [2022-04-08 06:02:59,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112987740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:59,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:59,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 06:02:59,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100098862] [2022-04-08 06:02:59,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100098862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:59,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:59,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 06:02:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852589226] [2022-04-08 06:02:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:59,735 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-08 06:02:59,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:59,735 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-08 06:02:59,768 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-08 06:02:59,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 06:02:59,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 06:02:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:02:59,768 INFO L87 Difference]: Start difference. First operand 80 states and 99 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-08 06:03:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:00,028 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-08 06:03:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:03:00,028 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-08 06:03:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:00,028 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-08 06:03:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 06:03:00,030 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-08 06:03:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 06:03:00,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-08 06:03:00,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:00,119 INFO L225 Difference]: With dead ends: 119 [2022-04-08 06:03:00,119 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 06:03:00,120 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-08 06:03:00,120 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:00,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:03:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 06:03:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 06:03:00,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:00,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:03:00,211 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:03:00,211 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:03:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:00,213 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 06:03:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:03:00,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:00,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:00,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-08 06:03:00,214 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-08 06:03:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:00,216 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 06:03:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:03:00,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:00,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:00,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:00,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:03:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-08 06:03:00,219 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-08 06:03:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:00,219 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-08 06:03:00,219 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-08 06:03:00,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-08 06:03:00,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:03:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 06:03:00,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:00,957 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-08 06:03:00,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:01,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 06:03:01,158 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-08 06:03:01,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:01,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2075485364] [2022-04-08 06:03:01,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-08 06:03:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:01,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284225941] [2022-04-08 06:03:01,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:01,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:01,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:01,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244256743] [2022-04-08 06:03:01,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:01,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:01,171 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:01,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 06:03:01,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:01,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:01,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:03:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:01,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:01,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 06:03:01,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5582#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret9 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#(<= ~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; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,507 INFO L272 TraceCheckUtils]: 6: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,508 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #90#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,509 INFO L272 TraceCheckUtils]: 11: Hoare triple {5590#(<= ~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)); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,510 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #92#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {5590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:01,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {5590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:01,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {5639#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:01,512 INFO L272 TraceCheckUtils]: 19: Hoare triple {5639#(<= ~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)); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:01,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {5639#(<= ~counter~0 1)} ~cond := #in~cond; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:01,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {5639#(<= ~counter~0 1)} assume !(0 == ~cond); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:01,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(<= ~counter~0 1)} assume true; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:01,513 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5639#(<= ~counter~0 1)} {5639#(<= ~counter~0 1)} #94#return; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:01,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {5639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:01,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {5639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:01,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {5664#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:01,515 INFO L272 TraceCheckUtils]: 27: Hoare triple {5664#(<= ~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)); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:01,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {5664#(<= ~counter~0 2)} ~cond := #in~cond; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:01,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {5664#(<= ~counter~0 2)} assume !(0 == ~cond); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:01,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {5664#(<= ~counter~0 2)} assume true; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:01,516 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5664#(<= ~counter~0 2)} {5664#(<= ~counter~0 2)} #96#return; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:01,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= ~counter~0 2)} assume !(~r~0 > 0); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:01,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {5664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:01,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {5689#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:01,518 INFO L272 TraceCheckUtils]: 35: Hoare triple {5689#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:01,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:01,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:01,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:01,519 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #98#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:01,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {5689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:01,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {5689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:01,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:01,521 INFO L272 TraceCheckUtils]: 43: Hoare triple {5714#(<= ~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)); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:01,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {5714#(<= ~counter~0 4)} ~cond := #in~cond; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:01,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {5714#(<= ~counter~0 4)} assume !(0 == ~cond); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:01,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {5714#(<= ~counter~0 4)} assume true; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:01,522 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5714#(<= ~counter~0 4)} {5714#(<= ~counter~0 4)} #98#return; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:01,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {5714#(<= ~counter~0 4)} assume !(~r~0 < 0); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:01,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {5714#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5739#(<= |main_#t~post6| 4)} is VALID [2022-04-08 06:03:01,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {5739#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {5583#false} is VALID [2022-04-08 06:03:01,534 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#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)); {5583#false} is VALID [2022-04-08 06:03:01,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-08 06:03:01,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 06:03:01,534 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 06:03:01,534 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-08 06:03:01,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:01,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 06:03:01,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 06:03:01,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-08 06:03:01,836 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#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)); {5583#false} is VALID [2022-04-08 06:03:01,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {5767#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {5583#false} is VALID [2022-04-08 06:03:01,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {5771#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5767#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:03:01,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {5771#(< ~counter~0 50)} assume !(~r~0 < 0); {5771#(< ~counter~0 50)} is VALID [2022-04-08 06:03:01,839 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5582#true} {5771#(< ~counter~0 50)} #98#return; {5771#(< ~counter~0 50)} is VALID [2022-04-08 06:03:01,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:03:01,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:03:01,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:03:01,839 INFO L272 TraceCheckUtils]: 43: Hoare triple {5771#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 06:03:01,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {5771#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {5771#(< ~counter~0 50)} is VALID [2022-04-08 06:03:01,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {5796#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5771#(< ~counter~0 50)} is VALID [2022-04-08 06:03:01,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {5796#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5796#(< ~counter~0 49)} is VALID [2022-04-08 06:03:01,841 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5582#true} {5796#(< ~counter~0 49)} #98#return; {5796#(< ~counter~0 49)} is VALID [2022-04-08 06:03:01,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:03:01,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:03:01,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:03:01,841 INFO L272 TraceCheckUtils]: 35: Hoare triple {5796#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 06:03:01,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {5796#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {5796#(< ~counter~0 49)} is VALID [2022-04-08 06:03:01,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {5821#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5796#(< ~counter~0 49)} is VALID [2022-04-08 06:03:01,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {5821#(< ~counter~0 48)} assume !(~r~0 > 0); {5821#(< ~counter~0 48)} is VALID [2022-04-08 06:03:01,845 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5582#true} {5821#(< ~counter~0 48)} #96#return; {5821#(< ~counter~0 48)} is VALID [2022-04-08 06:03:01,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:03:01,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:03:01,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:03:01,845 INFO L272 TraceCheckUtils]: 27: Hoare triple {5821#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 06:03:01,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {5821#(< ~counter~0 48)} is VALID [2022-04-08 06:03:01,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5821#(< ~counter~0 48)} is VALID [2022-04-08 06:03:01,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {5846#(< ~counter~0 47)} assume !!(0 != ~r~0); {5846#(< ~counter~0 47)} is VALID [2022-04-08 06:03:01,847 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5582#true} {5846#(< ~counter~0 47)} #94#return; {5846#(< ~counter~0 47)} is VALID [2022-04-08 06:03:01,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:03:01,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:03:01,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:03:01,848 INFO L272 TraceCheckUtils]: 19: Hoare triple {5846#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 06:03:01,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {5846#(< ~counter~0 47)} is VALID [2022-04-08 06:03:01,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 47)} is VALID [2022-04-08 06:03:01,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {5871#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5871#(< ~counter~0 46)} is VALID [2022-04-08 06:03:01,850 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5871#(< ~counter~0 46)} #92#return; {5871#(< ~counter~0 46)} is VALID [2022-04-08 06:03:01,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:03:01,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:03:01,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:03:01,850 INFO L272 TraceCheckUtils]: 11: Hoare triple {5871#(< ~counter~0 46)} 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)); {5582#true} is VALID [2022-04-08 06:03:01,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5871#(< ~counter~0 46)} #90#return; {5871#(< ~counter~0 46)} is VALID [2022-04-08 06:03:01,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:03:01,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:03:01,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:03:01,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {5871#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 06:03:01,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#(< ~counter~0 46)} 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; {5871#(< ~counter~0 46)} is VALID [2022-04-08 06:03:01,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#(< ~counter~0 46)} call #t~ret9 := main(); {5871#(< ~counter~0 46)} is VALID [2022-04-08 06:03:01,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(< ~counter~0 46)} {5582#true} #102#return; {5871#(< ~counter~0 46)} is VALID [2022-04-08 06:03:01,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(< ~counter~0 46)} assume true; {5871#(< ~counter~0 46)} is VALID [2022-04-08 06:03:01,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5871#(< ~counter~0 46)} is VALID [2022-04-08 06:03:01,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 06:03:01,854 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-08 06:03:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:01,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284225941] [2022-04-08 06:03:01,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:01,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244256743] [2022-04-08 06:03:01,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244256743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:01,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:01,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:03:01,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:01,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2075485364] [2022-04-08 06:03:01,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2075485364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:01,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:01,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:03:01,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181799301] [2022-04-08 06:03:01,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:01,856 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-08 06:03:01,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:01,856 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-08 06:03:01,895 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-08 06:03:01,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:03:01,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:03:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:03:01,896 INFO L87 Difference]: Start difference. First operand 82 states and 101 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-08 06:03:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:02,210 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-08 06:03:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:03:02,210 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-08 06:03:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:02,210 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-08 06:03:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 06:03:02,212 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-08 06:03:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 06:03:02,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 06:03:02,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:02,284 INFO L225 Difference]: With dead ends: 99 [2022-04-08 06:03:02,284 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 06:03:02,284 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-08 06:03:02,285 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:02,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 06:03:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-08 06:03:02,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:02,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:02,362 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:02,363 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:02,365 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 06:03:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:03:02,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:02,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:02,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-08 06:03:02,366 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-08 06:03:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:02,368 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 06:03:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:03:02,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:02,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:02,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:02,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-08 06:03:02,371 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-08 06:03:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:02,371 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-08 06:03:02,372 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-08 06:03:02,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-08 06:03:03,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-08 06:03:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 06:03:03,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:03,433 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-08 06:03:03,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:03,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 06:03:03,635 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-08 06:03:03,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:03,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1542434250] [2022-04-08 06:03:03,637 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-08 06:03:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:03,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304846651] [2022-04-08 06:03:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:03,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:03,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:03,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647479598] [2022-04-08 06:03:03,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:03:03,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:03,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:03,648 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:03,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 06:03:03,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:03:03,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:03,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:03:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:03,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:03,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-08 06:03:03,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6503#(<= ~counter~0 0)} {6495#true} #102#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {6503#(<= ~counter~0 0)} call #t~ret9 := main(); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {6503#(<= ~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; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #90#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,987 INFO L272 TraceCheckUtils]: 11: Hoare triple {6503#(<= ~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)); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,988 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #92#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {6503#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:03,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {6503#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:03,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {6552#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:04,000 INFO L272 TraceCheckUtils]: 19: Hoare triple {6552#(<= ~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)); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:04,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {6552#(<= ~counter~0 1)} ~cond := #in~cond; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:04,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {6552#(<= ~counter~0 1)} assume !(0 == ~cond); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:04,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= ~counter~0 1)} assume true; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:04,002 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6552#(<= ~counter~0 1)} {6552#(<= ~counter~0 1)} #94#return; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:04,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {6552#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:04,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {6552#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:04,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {6577#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:04,004 INFO L272 TraceCheckUtils]: 27: Hoare triple {6577#(<= ~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)); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:04,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {6577#(<= ~counter~0 2)} ~cond := #in~cond; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:04,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {6577#(<= ~counter~0 2)} assume !(0 == ~cond); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:04,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {6577#(<= ~counter~0 2)} assume true; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:04,005 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6577#(<= ~counter~0 2)} {6577#(<= ~counter~0 2)} #96#return; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:04,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(<= ~counter~0 2)} assume !(~r~0 > 0); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:04,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {6577#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:04,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:04,007 INFO L272 TraceCheckUtils]: 35: Hoare triple {6602#(<= ~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)); {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:04,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {6602#(<= ~counter~0 3)} ~cond := #in~cond; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:04,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {6602#(<= ~counter~0 3)} assume !(0 == ~cond); {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:04,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {6602#(<= ~counter~0 3)} assume true; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:04,008 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6602#(<= ~counter~0 3)} {6602#(<= ~counter~0 3)} #98#return; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:04,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {6602#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:04,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {6602#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:04,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {6627#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:04,010 INFO L272 TraceCheckUtils]: 43: Hoare triple {6627#(<= ~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)); {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:04,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {6627#(<= ~counter~0 4)} ~cond := #in~cond; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:04,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {6627#(<= ~counter~0 4)} assume !(0 == ~cond); {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:04,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {6627#(<= ~counter~0 4)} assume true; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:04,011 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6627#(<= ~counter~0 4)} {6627#(<= ~counter~0 4)} #98#return; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:04,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {6627#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:04,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {6627#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6652#(<= |main_#t~post8| 4)} is VALID [2022-04-08 06:03:04,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#(<= |main_#t~post8| 4)} assume !(#t~post8 < 50);havoc #t~post8; {6496#false} is VALID [2022-04-08 06:03:04,012 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-08 06:03:04,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 50);havoc #t~post6; {6496#false} is VALID [2022-04-08 06:03:04,012 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#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)); {6496#false} is VALID [2022-04-08 06:03:04,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-08 06:03:04,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-08 06:03:04,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-08 06:03:04,013 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-08 06:03:04,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:04,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-08 06:03:04,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-08 06:03:04,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-08 06:03:04,343 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#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)); {6496#false} is VALID [2022-04-08 06:03:04,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 50);havoc #t~post6; {6496#false} is VALID [2022-04-08 06:03:04,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-08 06:03:04,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {6692#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {6496#false} is VALID [2022-04-08 06:03:04,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {6696#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6692#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:03:04,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {6696#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6696#(< ~counter~0 50)} is VALID [2022-04-08 06:03:04,345 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6495#true} {6696#(< ~counter~0 50)} #98#return; {6696#(< ~counter~0 50)} is VALID [2022-04-08 06:03:04,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:03:04,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:03:04,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:03:04,345 INFO L272 TraceCheckUtils]: 43: Hoare triple {6696#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 06:03:04,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {6696#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {6696#(< ~counter~0 50)} is VALID [2022-04-08 06:03:04,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {6721#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6696#(< ~counter~0 50)} is VALID [2022-04-08 06:03:04,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {6721#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6721#(< ~counter~0 49)} is VALID [2022-04-08 06:03:04,348 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6495#true} {6721#(< ~counter~0 49)} #98#return; {6721#(< ~counter~0 49)} is VALID [2022-04-08 06:03:04,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:03:04,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:03:04,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:03:04,348 INFO L272 TraceCheckUtils]: 35: Hoare triple {6721#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 06:03:04,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {6721#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {6721#(< ~counter~0 49)} is VALID [2022-04-08 06:03:04,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {6746#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6721#(< ~counter~0 49)} is VALID [2022-04-08 06:03:04,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {6746#(< ~counter~0 48)} assume !(~r~0 > 0); {6746#(< ~counter~0 48)} is VALID [2022-04-08 06:03:04,350 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6495#true} {6746#(< ~counter~0 48)} #96#return; {6746#(< ~counter~0 48)} is VALID [2022-04-08 06:03:04,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:03:04,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:03:04,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:03:04,351 INFO L272 TraceCheckUtils]: 27: Hoare triple {6746#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 06:03:04,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {6746#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {6746#(< ~counter~0 48)} is VALID [2022-04-08 06:03:04,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {6771#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6746#(< ~counter~0 48)} is VALID [2022-04-08 06:03:04,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#(< ~counter~0 47)} assume !!(0 != ~r~0); {6771#(< ~counter~0 47)} is VALID [2022-04-08 06:03:04,353 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6495#true} {6771#(< ~counter~0 47)} #94#return; {6771#(< ~counter~0 47)} is VALID [2022-04-08 06:03:04,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:03:04,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:03:04,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:03:04,353 INFO L272 TraceCheckUtils]: 19: Hoare triple {6771#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 06:03:04,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {6771#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {6771#(< ~counter~0 47)} is VALID [2022-04-08 06:03:04,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {6796#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6771#(< ~counter~0 47)} is VALID [2022-04-08 06:03:04,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {6796#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6796#(< ~counter~0 46)} is VALID [2022-04-08 06:03:04,355 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6495#true} {6796#(< ~counter~0 46)} #92#return; {6796#(< ~counter~0 46)} is VALID [2022-04-08 06:03:04,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:03:04,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:03:04,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:03:04,355 INFO L272 TraceCheckUtils]: 11: Hoare triple {6796#(< ~counter~0 46)} 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)); {6495#true} is VALID [2022-04-08 06:03:04,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6495#true} {6796#(< ~counter~0 46)} #90#return; {6796#(< ~counter~0 46)} is VALID [2022-04-08 06:03:04,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:03:04,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:03:04,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:03:04,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {6796#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 06:03:04,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {6796#(< ~counter~0 46)} 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; {6796#(< ~counter~0 46)} is VALID [2022-04-08 06:03:04,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {6796#(< ~counter~0 46)} call #t~ret9 := main(); {6796#(< ~counter~0 46)} is VALID [2022-04-08 06:03:04,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6796#(< ~counter~0 46)} {6495#true} #102#return; {6796#(< ~counter~0 46)} is VALID [2022-04-08 06:03:04,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {6796#(< ~counter~0 46)} assume true; {6796#(< ~counter~0 46)} is VALID [2022-04-08 06:03:04,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6796#(< ~counter~0 46)} is VALID [2022-04-08 06:03:04,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-08 06:03:04,359 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-08 06:03:04,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:04,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304846651] [2022-04-08 06:03:04,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:04,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647479598] [2022-04-08 06:03:04,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647479598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:04,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:04,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:03:04,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:04,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1542434250] [2022-04-08 06:03:04,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1542434250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:04,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:04,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:03:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533723591] [2022-04-08 06:03:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:04,361 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-08 06:03:04,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:04,361 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-08 06:03:04,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:04,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:03:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:04,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:03:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:03:04,409 INFO L87 Difference]: Start difference. First operand 91 states and 112 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-08 06:03:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:04,705 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-08 06:03:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:03:04,705 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-08 06:03:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:04,705 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-08 06:03:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 06:03:04,707 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-08 06:03:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 06:03:04,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-08 06:03:04,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:04,809 INFO L225 Difference]: With dead ends: 132 [2022-04-08 06:03:04,809 INFO L226 Difference]: Without dead ends: 95 [2022-04-08 06:03:04,810 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-08 06:03:04,810 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:04,811 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:03:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-08 06:03:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-08 06:03:04,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:04,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:04,900 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:04,900 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:04,903 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 06:03:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 06:03:04,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:04,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:04,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-08 06:03:04,904 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-08 06:03:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:04,907 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 06:03:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 06:03:04,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:04,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:04,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:04,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-08 06:03:04,910 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-08 06:03:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:04,910 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-08 06:03:04,910 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-08 06:03:04,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-08 06:03:05,849 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-08 06:03:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:03:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 06:03:05,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:05,850 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-08 06:03:05,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:06,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 06:03:06,056 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-08 06:03:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:06,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106045771] [2022-04-08 06:03:06,057 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-08 06:03:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:06,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523927128] [2022-04-08 06:03:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:06,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:06,068 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:06,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894360279] [2022-04-08 06:03:06,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:03:06,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:06,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:06,070 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:06,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 06:03:06,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 06:03:06,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:06,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:03:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:06,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:06,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-08 06:03:06,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7504#(<= ~counter~0 0)} {7496#true} #102#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {7504#(<= ~counter~0 0)} call #t~ret9 := main(); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {7504#(<= ~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; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,481 INFO L272 TraceCheckUtils]: 6: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #90#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,482 INFO L272 TraceCheckUtils]: 11: Hoare triple {7504#(<= ~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)); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,484 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #92#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {7504#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {7504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {7553#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,485 INFO L272 TraceCheckUtils]: 19: Hoare triple {7553#(<= ~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)); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {7553#(<= ~counter~0 1)} ~cond := #in~cond; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(<= ~counter~0 1)} assume !(0 == ~cond); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {7553#(<= ~counter~0 1)} assume true; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,487 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7553#(<= ~counter~0 1)} {7553#(<= ~counter~0 1)} #94#return; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {7553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {7553#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {7578#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,488 INFO L272 TraceCheckUtils]: 27: Hoare triple {7578#(<= ~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)); {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {7578#(<= ~counter~0 2)} ~cond := #in~cond; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {7578#(<= ~counter~0 2)} assume !(0 == ~cond); {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {7578#(<= ~counter~0 2)} assume true; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,490 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7578#(<= ~counter~0 2)} {7578#(<= ~counter~0 2)} #96#return; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {7578#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {7578#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {7603#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,494 INFO L272 TraceCheckUtils]: 35: Hoare triple {7603#(<= ~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)); {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 3)} ~cond := #in~cond; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {7603#(<= ~counter~0 3)} assume !(0 == ~cond); {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {7603#(<= ~counter~0 3)} assume true; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,495 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7603#(<= ~counter~0 3)} {7603#(<= ~counter~0 3)} #96#return; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {7603#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {7603#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {7628#(<= ~counter~0 4)} assume !!(#t~post7 < 50);havoc #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,497 INFO L272 TraceCheckUtils]: 43: Hoare triple {7628#(<= ~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)); {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {7628#(<= ~counter~0 4)} ~cond := #in~cond; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {7628#(<= ~counter~0 4)} assume !(0 == ~cond); {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {7628#(<= ~counter~0 4)} assume true; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,499 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7628#(<= ~counter~0 4)} {7628#(<= ~counter~0 4)} #96#return; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {7628#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {7628#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7653#(<= |main_#t~post7| 4)} is VALID [2022-04-08 06:03:06,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {7653#(<= |main_#t~post7| 4)} assume !(#t~post7 < 50);havoc #t~post7; {7497#false} is VALID [2022-04-08 06:03:06,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-08 06:03:06,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 50);havoc #t~post8; {7497#false} is VALID [2022-04-08 06:03:06,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-08 06:03:06,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 50);havoc #t~post6; {7497#false} is VALID [2022-04-08 06:03:06,501 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#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)); {7497#false} is VALID [2022-04-08 06:03:06,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-08 06:03:06,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-08 06:03:06,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-08 06:03:06,502 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-08 06:03:06,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:06,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-08 06:03:06,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-08 06:03:06,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-08 06:03:06,818 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#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)); {7497#false} is VALID [2022-04-08 06:03:06,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 50);havoc #t~post6; {7497#false} is VALID [2022-04-08 06:03:06,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-08 06:03:06,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 50);havoc #t~post8; {7497#false} is VALID [2022-04-08 06:03:06,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-08 06:03:06,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {7497#false} is VALID [2022-04-08 06:03:06,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {7709#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7705#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:03:06,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {7709#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7709#(< ~counter~0 50)} is VALID [2022-04-08 06:03:06,820 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7496#true} {7709#(< ~counter~0 50)} #96#return; {7709#(< ~counter~0 50)} is VALID [2022-04-08 06:03:06,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:03:06,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:03:06,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:03:06,820 INFO L272 TraceCheckUtils]: 43: Hoare triple {7709#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 06:03:06,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {7709#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {7709#(< ~counter~0 50)} is VALID [2022-04-08 06:03:06,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {7734#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7709#(< ~counter~0 50)} is VALID [2022-04-08 06:03:06,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {7734#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7734#(< ~counter~0 49)} is VALID [2022-04-08 06:03:06,822 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7496#true} {7734#(< ~counter~0 49)} #96#return; {7734#(< ~counter~0 49)} is VALID [2022-04-08 06:03:06,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:03:06,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:03:06,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:03:06,822 INFO L272 TraceCheckUtils]: 35: Hoare triple {7734#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 06:03:06,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {7734#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {7734#(< ~counter~0 49)} is VALID [2022-04-08 06:03:06,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {7759#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7734#(< ~counter~0 49)} is VALID [2022-04-08 06:03:06,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {7759#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7759#(< ~counter~0 48)} is VALID [2022-04-08 06:03:06,823 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7496#true} {7759#(< ~counter~0 48)} #96#return; {7759#(< ~counter~0 48)} is VALID [2022-04-08 06:03:06,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:03:06,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:03:06,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:03:06,824 INFO L272 TraceCheckUtils]: 27: Hoare triple {7759#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 06:03:06,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {7759#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {7759#(< ~counter~0 48)} is VALID [2022-04-08 06:03:06,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {7784#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7759#(< ~counter~0 48)} is VALID [2022-04-08 06:03:06,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(< ~counter~0 47)} assume !!(0 != ~r~0); {7784#(< ~counter~0 47)} is VALID [2022-04-08 06:03:06,825 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7496#true} {7784#(< ~counter~0 47)} #94#return; {7784#(< ~counter~0 47)} is VALID [2022-04-08 06:03:06,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:03:06,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:03:06,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:03:06,826 INFO L272 TraceCheckUtils]: 19: Hoare triple {7784#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 06:03:06,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {7784#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {7784#(< ~counter~0 47)} is VALID [2022-04-08 06:03:06,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7784#(< ~counter~0 47)} is VALID [2022-04-08 06:03:06,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7809#(< ~counter~0 46)} is VALID [2022-04-08 06:03:06,827 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7496#true} {7809#(< ~counter~0 46)} #92#return; {7809#(< ~counter~0 46)} is VALID [2022-04-08 06:03:06,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:03:06,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:03:06,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:03:06,827 INFO L272 TraceCheckUtils]: 11: Hoare triple {7809#(< ~counter~0 46)} 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)); {7496#true} is VALID [2022-04-08 06:03:06,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7496#true} {7809#(< ~counter~0 46)} #90#return; {7809#(< ~counter~0 46)} is VALID [2022-04-08 06:03:06,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:03:06,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:03:06,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:03:06,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {7809#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 06:03:06,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#(< ~counter~0 46)} 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; {7809#(< ~counter~0 46)} is VALID [2022-04-08 06:03:06,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(< ~counter~0 46)} call #t~ret9 := main(); {7809#(< ~counter~0 46)} is VALID [2022-04-08 06:03:06,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(< ~counter~0 46)} {7496#true} #102#return; {7809#(< ~counter~0 46)} is VALID [2022-04-08 06:03:06,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(< ~counter~0 46)} assume true; {7809#(< ~counter~0 46)} is VALID [2022-04-08 06:03:06,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7809#(< ~counter~0 46)} is VALID [2022-04-08 06:03:06,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-08 06:03:06,830 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-08 06:03:06,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:06,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523927128] [2022-04-08 06:03:06,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:06,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894360279] [2022-04-08 06:03:06,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894360279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:06,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:06,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:03:06,831 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:06,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106045771] [2022-04-08 06:03:06,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106045771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:06,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:06,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:03:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032790596] [2022-04-08 06:03:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:06,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 06:03:06,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:06,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:03:06,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:06,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:03:06,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:06,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:03:06,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:03:06,884 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:03:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:07,181 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-08 06:03:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 06:03:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 06:03:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:03:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 06:03:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:03:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 06:03:07,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-08 06:03:07,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:07,281 INFO L225 Difference]: With dead ends: 133 [2022-04-08 06:03:07,281 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 06:03:07,282 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-08 06:03:07,282 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:07,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 06:03:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-08 06:03:07,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:07,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:07,370 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:07,370 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:07,372 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 06:03:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:03:07,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:07,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:07,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-08 06:03:07,374 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-08 06:03:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:07,378 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 06:03:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:03:07,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:07,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:07,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:07,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:03:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-08 06:03:07,386 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-08 06:03:07,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:07,386 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-08 06:03:07,386 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:03:07,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-08 06:03:07,843 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-08 06:03:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:03:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 06:03:07,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:07,847 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-08 06:03:07,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:08,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 06:03:08,047 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-08 06:03:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1250878899] [2022-04-08 06:03:08,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-08 06:03:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525720928] [2022-04-08 06:03:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:08,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:08,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223346856] [2022-04-08 06:03:08,060 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:03:08,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:08,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:08,061 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:08,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 06:03:08,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:03:08,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:08,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:03:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:08,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:08,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 06:03:08,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #102#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret9 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {8527#(<= ~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; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,461 INFO L272 TraceCheckUtils]: 6: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #90#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,463 INFO L272 TraceCheckUtils]: 11: Hoare triple {8527#(<= ~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)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,464 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #92#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {8527#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:08,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {8527#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:08,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {8576#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:08,466 INFO L272 TraceCheckUtils]: 19: Hoare triple {8576#(<= ~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)); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:08,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {8576#(<= ~counter~0 1)} ~cond := #in~cond; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:08,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {8576#(<= ~counter~0 1)} assume !(0 == ~cond); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:08,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {8576#(<= ~counter~0 1)} assume true; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:08,468 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8576#(<= ~counter~0 1)} {8576#(<= ~counter~0 1)} #94#return; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:08,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {8576#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:08,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {8576#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:08,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {8601#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:08,469 INFO L272 TraceCheckUtils]: 27: Hoare triple {8601#(<= ~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)); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:08,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {8601#(<= ~counter~0 2)} ~cond := #in~cond; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:08,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#(<= ~counter~0 2)} assume !(0 == ~cond); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:08,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {8601#(<= ~counter~0 2)} assume true; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:08,470 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8601#(<= ~counter~0 2)} {8601#(<= ~counter~0 2)} #96#return; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:08,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {8601#(<= ~counter~0 2)} assume !(~r~0 > 0); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:08,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:08,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {8626#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:08,472 INFO L272 TraceCheckUtils]: 35: Hoare triple {8626#(<= ~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)); {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:08,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= ~counter~0 3)} ~cond := #in~cond; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:08,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {8626#(<= ~counter~0 3)} assume !(0 == ~cond); {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:08,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {8626#(<= ~counter~0 3)} assume true; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:08,474 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8626#(<= ~counter~0 3)} {8626#(<= ~counter~0 3)} #98#return; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:08,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {8626#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:08,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {8626#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:08,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {8651#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:08,475 INFO L272 TraceCheckUtils]: 43: Hoare triple {8651#(<= ~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)); {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:08,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(<= ~counter~0 4)} ~cond := #in~cond; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:08,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(<= ~counter~0 4)} assume !(0 == ~cond); {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:08,476 INFO L290 TraceCheckUtils]: 46: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:08,476 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8651#(<= ~counter~0 4)} {8651#(<= ~counter~0 4)} #98#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:08,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {8651#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:08,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {8651#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:08,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:08,478 INFO L272 TraceCheckUtils]: 51: Hoare triple {8676#(<= ~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)); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:08,478 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#(<= ~counter~0 5)} ~cond := #in~cond; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:08,479 INFO L290 TraceCheckUtils]: 53: Hoare triple {8676#(<= ~counter~0 5)} assume !(0 == ~cond); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:08,479 INFO L290 TraceCheckUtils]: 54: Hoare triple {8676#(<= ~counter~0 5)} assume true; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:08,479 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8676#(<= ~counter~0 5)} {8676#(<= ~counter~0 5)} #98#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:08,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#(<= ~counter~0 5)} assume !(~r~0 < 0); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:08,480 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8701#(<= |main_#t~post6| 5)} is VALID [2022-04-08 06:03:08,480 INFO L290 TraceCheckUtils]: 58: Hoare triple {8701#(<= |main_#t~post6| 5)} assume !(#t~post6 < 50);havoc #t~post6; {8520#false} is VALID [2022-04-08 06:03:08,481 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#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)); {8520#false} is VALID [2022-04-08 06:03:08,481 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 06:03:08,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 06:03:08,481 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 06:03:08,481 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-08 06:03:08,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:08,833 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 06:03:08,833 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 06:03:08,833 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 06:03:08,834 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#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)); {8520#false} is VALID [2022-04-08 06:03:08,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {8729#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {8520#false} is VALID [2022-04-08 06:03:08,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {8733#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8729#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:03:08,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {8733#(< ~counter~0 50)} assume !(~r~0 < 0); {8733#(< ~counter~0 50)} is VALID [2022-04-08 06:03:08,835 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8519#true} {8733#(< ~counter~0 50)} #98#return; {8733#(< ~counter~0 50)} is VALID [2022-04-08 06:03:08,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:03:08,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:03:08,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:03:08,835 INFO L272 TraceCheckUtils]: 51: Hoare triple {8733#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 06:03:08,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {8733#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {8733#(< ~counter~0 50)} is VALID [2022-04-08 06:03:08,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {8758#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8733#(< ~counter~0 50)} is VALID [2022-04-08 06:03:08,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {8758#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8758#(< ~counter~0 49)} is VALID [2022-04-08 06:03:08,837 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8519#true} {8758#(< ~counter~0 49)} #98#return; {8758#(< ~counter~0 49)} is VALID [2022-04-08 06:03:08,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:03:08,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:03:08,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:03:08,837 INFO L272 TraceCheckUtils]: 43: Hoare triple {8758#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 06:03:08,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {8758#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {8758#(< ~counter~0 49)} is VALID [2022-04-08 06:03:08,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {8783#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8758#(< ~counter~0 49)} is VALID [2022-04-08 06:03:08,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {8783#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8783#(< ~counter~0 48)} is VALID [2022-04-08 06:03:08,844 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8519#true} {8783#(< ~counter~0 48)} #98#return; {8783#(< ~counter~0 48)} is VALID [2022-04-08 06:03:08,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:03:08,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:03:08,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:03:08,844 INFO L272 TraceCheckUtils]: 35: Hoare triple {8783#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 06:03:08,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {8783#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {8783#(< ~counter~0 48)} is VALID [2022-04-08 06:03:08,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {8808#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8783#(< ~counter~0 48)} is VALID [2022-04-08 06:03:08,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {8808#(< ~counter~0 47)} assume !(~r~0 > 0); {8808#(< ~counter~0 47)} is VALID [2022-04-08 06:03:08,846 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8519#true} {8808#(< ~counter~0 47)} #96#return; {8808#(< ~counter~0 47)} is VALID [2022-04-08 06:03:08,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:03:08,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:03:08,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:03:08,846 INFO L272 TraceCheckUtils]: 27: Hoare triple {8808#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 06:03:08,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {8808#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {8808#(< ~counter~0 47)} is VALID [2022-04-08 06:03:08,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {8833#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8808#(< ~counter~0 47)} is VALID [2022-04-08 06:03:08,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {8833#(< ~counter~0 46)} assume !!(0 != ~r~0); {8833#(< ~counter~0 46)} is VALID [2022-04-08 06:03:08,848 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8519#true} {8833#(< ~counter~0 46)} #94#return; {8833#(< ~counter~0 46)} is VALID [2022-04-08 06:03:08,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:03:08,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:03:08,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:03:08,848 INFO L272 TraceCheckUtils]: 19: Hoare triple {8833#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 06:03:08,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {8833#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {8833#(< ~counter~0 46)} is VALID [2022-04-08 06:03:08,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8833#(< ~counter~0 46)} is VALID [2022-04-08 06:03:08,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8858#(< ~counter~0 45)} is VALID [2022-04-08 06:03:08,850 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8858#(< ~counter~0 45)} #92#return; {8858#(< ~counter~0 45)} is VALID [2022-04-08 06:03:08,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:03:08,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:03:08,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:03:08,850 INFO L272 TraceCheckUtils]: 11: Hoare triple {8858#(< ~counter~0 45)} 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)); {8519#true} is VALID [2022-04-08 06:03:08,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8858#(< ~counter~0 45)} #90#return; {8858#(< ~counter~0 45)} is VALID [2022-04-08 06:03:08,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:03:08,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:03:08,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:03:08,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {8858#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 06:03:08,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {8858#(< ~counter~0 45)} 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; {8858#(< ~counter~0 45)} is VALID [2022-04-08 06:03:08,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {8858#(< ~counter~0 45)} call #t~ret9 := main(); {8858#(< ~counter~0 45)} is VALID [2022-04-08 06:03:08,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8858#(< ~counter~0 45)} {8519#true} #102#return; {8858#(< ~counter~0 45)} is VALID [2022-04-08 06:03:08,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {8858#(< ~counter~0 45)} assume true; {8858#(< ~counter~0 45)} is VALID [2022-04-08 06:03:08,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8858#(< ~counter~0 45)} is VALID [2022-04-08 06:03:08,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 06:03:08,853 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-08 06:03:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:08,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525720928] [2022-04-08 06:03:08,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:08,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223346856] [2022-04-08 06:03:08,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223346856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:08,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:08,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 06:03:08,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:08,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1250878899] [2022-04-08 06:03:08,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1250878899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:08,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:08,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:03:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099732420] [2022-04-08 06:03:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:08,854 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-08 06:03:08,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:08,855 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-08 06:03:08,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:08,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:03:08,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:03:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:03:08,898 INFO L87 Difference]: Start difference. First operand 96 states and 118 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-08 06:03:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:09,256 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-08 06:03:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 06:03:09,256 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-08 06:03:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:09,257 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-08 06:03:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 06:03:09,259 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-08 06:03:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 06:03:09,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-08 06:03:09,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:09,358 INFO L225 Difference]: With dead ends: 116 [2022-04-08 06:03:09,358 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 06:03:09,359 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-08 06:03:09,359 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:09,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 06:03:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-08 06:03:09,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:09,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:09,457 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:09,457 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:09,460 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 06:03:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 06:03:09,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:09,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:09,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-08 06:03:09,461 INFO L87 Difference]: Start difference. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-08 06:03:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:09,463 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 06:03:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 06:03:09,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:09,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:09,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:09,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-08 06:03:09,467 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-08 06:03:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:09,467 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-08 06:03:09,467 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-08 06:03:09,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-08 06:03:11,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-08 06:03:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 06:03:11,538 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:11,538 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-08 06:03:11,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:11,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:11,739 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-08 06:03:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:11,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374910370] [2022-04-08 06:03:11,740 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-08 06:03:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:11,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886219659] [2022-04-08 06:03:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:11,752 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:11,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286003450] [2022-04-08 06:03:11,752 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:03:11,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:11,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:11,754 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:11,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 06:03:11,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:03:11,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:11,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:03:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:11,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:12,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-08 06:03:12,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9590#(<= ~counter~0 0)} {9582#true} #102#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {9590#(<= ~counter~0 0)} call #t~ret9 := main(); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {9590#(<= ~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; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {9590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #90#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,132 INFO L272 TraceCheckUtils]: 11: Hoare triple {9590#(<= ~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)); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #92#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {9590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:12,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {9590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:12,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {9639#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:12,135 INFO L272 TraceCheckUtils]: 19: Hoare triple {9639#(<= ~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)); {9639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:12,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {9639#(<= ~counter~0 1)} ~cond := #in~cond; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:12,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {9639#(<= ~counter~0 1)} assume !(0 == ~cond); {9639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:12,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {9639#(<= ~counter~0 1)} assume true; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:12,136 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9639#(<= ~counter~0 1)} {9639#(<= ~counter~0 1)} #94#return; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:12,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {9639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9639#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:12,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {9639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:12,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {9664#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:12,138 INFO L272 TraceCheckUtils]: 27: Hoare triple {9664#(<= ~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)); {9664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:12,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {9664#(<= ~counter~0 2)} ~cond := #in~cond; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:12,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {9664#(<= ~counter~0 2)} assume !(0 == ~cond); {9664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:12,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {9664#(<= ~counter~0 2)} assume true; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:12,139 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9664#(<= ~counter~0 2)} {9664#(<= ~counter~0 2)} #96#return; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:12,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {9664#(<= ~counter~0 2)} assume !(~r~0 > 0); {9664#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:12,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {9664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:12,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {9689#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:12,141 INFO L272 TraceCheckUtils]: 35: Hoare triple {9689#(<= ~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)); {9689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:12,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {9689#(<= ~counter~0 3)} ~cond := #in~cond; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:12,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {9689#(<= ~counter~0 3)} assume !(0 == ~cond); {9689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:12,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {9689#(<= ~counter~0 3)} assume true; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:12,142 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9689#(<= ~counter~0 3)} {9689#(<= ~counter~0 3)} #98#return; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:12,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {9689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:12,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {9689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:12,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {9714#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:12,143 INFO L272 TraceCheckUtils]: 43: Hoare triple {9714#(<= ~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)); {9714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:12,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {9714#(<= ~counter~0 4)} ~cond := #in~cond; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:12,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {9714#(<= ~counter~0 4)} assume !(0 == ~cond); {9714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:12,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {9714#(<= ~counter~0 4)} assume true; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:12,150 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9714#(<= ~counter~0 4)} {9714#(<= ~counter~0 4)} #98#return; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:12,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {9714#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:12,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {9714#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:12,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {9739#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:12,153 INFO L272 TraceCheckUtils]: 51: Hoare triple {9739#(<= ~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)); {9739#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:12,153 INFO L290 TraceCheckUtils]: 52: Hoare triple {9739#(<= ~counter~0 5)} ~cond := #in~cond; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:12,153 INFO L290 TraceCheckUtils]: 53: Hoare triple {9739#(<= ~counter~0 5)} assume !(0 == ~cond); {9739#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:12,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {9739#(<= ~counter~0 5)} assume true; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:12,154 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9739#(<= ~counter~0 5)} {9739#(<= ~counter~0 5)} #98#return; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:12,154 INFO L290 TraceCheckUtils]: 56: Hoare triple {9739#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:12,154 INFO L290 TraceCheckUtils]: 57: Hoare triple {9739#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9764#(<= |main_#t~post8| 5)} is VALID [2022-04-08 06:03:12,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {9764#(<= |main_#t~post8| 5)} assume !(#t~post8 < 50);havoc #t~post8; {9583#false} is VALID [2022-04-08 06:03:12,155 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-08 06:03:12,155 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 50);havoc #t~post6; {9583#false} is VALID [2022-04-08 06:03:12,155 INFO L272 TraceCheckUtils]: 61: Hoare triple {9583#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)); {9583#false} is VALID [2022-04-08 06:03:12,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-08 06:03:12,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-08 06:03:12,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-08 06:03:12,156 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-08 06:03:12,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:12,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-08 06:03:12,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-08 06:03:12,491 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-08 06:03:12,491 INFO L272 TraceCheckUtils]: 61: Hoare triple {9583#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)); {9583#false} is VALID [2022-04-08 06:03:12,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 50);havoc #t~post6; {9583#false} is VALID [2022-04-08 06:03:12,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-08 06:03:12,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {9804#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {9583#false} is VALID [2022-04-08 06:03:12,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {9808#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9804#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:03:12,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {9808#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9808#(< ~counter~0 50)} is VALID [2022-04-08 06:03:12,493 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9582#true} {9808#(< ~counter~0 50)} #98#return; {9808#(< ~counter~0 50)} is VALID [2022-04-08 06:03:12,493 INFO L290 TraceCheckUtils]: 54: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 06:03:12,493 INFO L290 TraceCheckUtils]: 53: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 06:03:12,493 INFO L290 TraceCheckUtils]: 52: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 06:03:12,493 INFO L272 TraceCheckUtils]: 51: Hoare triple {9808#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 06:03:12,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {9808#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {9808#(< ~counter~0 50)} is VALID [2022-04-08 06:03:12,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {9833#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9808#(< ~counter~0 50)} is VALID [2022-04-08 06:03:12,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {9833#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9833#(< ~counter~0 49)} is VALID [2022-04-08 06:03:12,495 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9582#true} {9833#(< ~counter~0 49)} #98#return; {9833#(< ~counter~0 49)} is VALID [2022-04-08 06:03:12,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 06:03:12,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 06:03:12,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 06:03:12,495 INFO L272 TraceCheckUtils]: 43: Hoare triple {9833#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 06:03:12,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {9833#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {9833#(< ~counter~0 49)} is VALID [2022-04-08 06:03:12,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {9858#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9833#(< ~counter~0 49)} is VALID [2022-04-08 06:03:12,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {9858#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9858#(< ~counter~0 48)} is VALID [2022-04-08 06:03:12,497 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9582#true} {9858#(< ~counter~0 48)} #98#return; {9858#(< ~counter~0 48)} is VALID [2022-04-08 06:03:12,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 06:03:12,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 06:03:12,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 06:03:12,497 INFO L272 TraceCheckUtils]: 35: Hoare triple {9858#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 06:03:12,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {9858#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {9858#(< ~counter~0 48)} is VALID [2022-04-08 06:03:12,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {9883#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9858#(< ~counter~0 48)} is VALID [2022-04-08 06:03:12,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {9883#(< ~counter~0 47)} assume !(~r~0 > 0); {9883#(< ~counter~0 47)} is VALID [2022-04-08 06:03:12,499 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9582#true} {9883#(< ~counter~0 47)} #96#return; {9883#(< ~counter~0 47)} is VALID [2022-04-08 06:03:12,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 06:03:12,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 06:03:12,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 06:03:12,499 INFO L272 TraceCheckUtils]: 27: Hoare triple {9883#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 06:03:12,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {9883#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {9883#(< ~counter~0 47)} is VALID [2022-04-08 06:03:12,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {9908#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9883#(< ~counter~0 47)} is VALID [2022-04-08 06:03:12,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {9908#(< ~counter~0 46)} assume !!(0 != ~r~0); {9908#(< ~counter~0 46)} is VALID [2022-04-08 06:03:12,501 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9582#true} {9908#(< ~counter~0 46)} #94#return; {9908#(< ~counter~0 46)} is VALID [2022-04-08 06:03:12,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 06:03:12,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 06:03:12,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 06:03:12,501 INFO L272 TraceCheckUtils]: 19: Hoare triple {9908#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 06:03:12,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {9908#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {9908#(< ~counter~0 46)} is VALID [2022-04-08 06:03:12,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {9933#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9908#(< ~counter~0 46)} is VALID [2022-04-08 06:03:12,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {9933#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9933#(< ~counter~0 45)} is VALID [2022-04-08 06:03:12,502 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9582#true} {9933#(< ~counter~0 45)} #92#return; {9933#(< ~counter~0 45)} is VALID [2022-04-08 06:03:12,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 06:03:12,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 06:03:12,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 06:03:12,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {9933#(< ~counter~0 45)} 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)); {9582#true} is VALID [2022-04-08 06:03:12,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9582#true} {9933#(< ~counter~0 45)} #90#return; {9933#(< ~counter~0 45)} is VALID [2022-04-08 06:03:12,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 06:03:12,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 06:03:12,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 06:03:12,503 INFO L272 TraceCheckUtils]: 6: Hoare triple {9933#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9582#true} is VALID [2022-04-08 06:03:12,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {9933#(< ~counter~0 45)} 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; {9933#(< ~counter~0 45)} is VALID [2022-04-08 06:03:12,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {9933#(< ~counter~0 45)} call #t~ret9 := main(); {9933#(< ~counter~0 45)} is VALID [2022-04-08 06:03:12,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9933#(< ~counter~0 45)} {9582#true} #102#return; {9933#(< ~counter~0 45)} is VALID [2022-04-08 06:03:12,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {9933#(< ~counter~0 45)} assume true; {9933#(< ~counter~0 45)} is VALID [2022-04-08 06:03:12,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9933#(< ~counter~0 45)} is VALID [2022-04-08 06:03:12,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-08 06:03:12,505 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-08 06:03:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886219659] [2022-04-08 06:03:12,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:12,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286003450] [2022-04-08 06:03:12,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286003450] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:12,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:12,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 06:03:12,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:12,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1374910370] [2022-04-08 06:03:12,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1374910370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:12,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:12,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:03:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862503874] [2022-04-08 06:03:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:12,507 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-08 06:03:12,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:12,507 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-08 06:03:12,549 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-08 06:03:12,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:03:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:12,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:03:12,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:03:12,550 INFO L87 Difference]: Start difference. First operand 106 states and 131 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-08 06:03:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:12,953 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-08 06:03:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:03:12,953 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-08 06:03:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:12,954 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-08 06:03:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 06:03:12,971 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-08 06:03:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 06:03:12,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-08 06:03:13,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:13,074 INFO L225 Difference]: With dead ends: 149 [2022-04-08 06:03:13,074 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 06:03:13,074 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-08 06:03:13,075 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:13,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 155 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 06:03:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-08 06:03:13,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:13,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:13,181 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:13,182 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:13,184 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 06:03:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 06:03:13,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:13,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:13,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-08 06:03:13,185 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-08 06:03:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:13,187 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 06:03:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 06:03:13,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:13,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:13,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:13,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-08 06:03:13,191 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-08 06:03:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:13,191 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-08 06:03:13,191 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-08 06:03:13,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-08 06:03:14,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-08 06:03:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 06:03:14,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:14,207 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-08 06:03:14,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:14,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 06:03:14,415 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-08 06:03:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:14,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569063080] [2022-04-08 06:03:14,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-08 06:03:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:14,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245082422] [2022-04-08 06:03:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:14,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:14,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328363530] [2022-04-08 06:03:14,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:14,435 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:14,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 06:03:14,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:14,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:14,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:03:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:14,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:14,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-08 06:03:14,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {10733#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10741#(<= ~counter~0 0)} {10733#true} #102#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {10741#(<= ~counter~0 0)} call #t~ret9 := main(); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {10741#(<= ~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; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,790 INFO L272 TraceCheckUtils]: 6: Hoare triple {10741#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,791 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #90#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,791 INFO L272 TraceCheckUtils]: 11: Hoare triple {10741#(<= ~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)); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,793 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #92#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {10741#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:14,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {10741#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:14,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {10790#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:14,794 INFO L272 TraceCheckUtils]: 19: Hoare triple {10790#(<= ~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)); {10790#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:14,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {10790#(<= ~counter~0 1)} ~cond := #in~cond; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:14,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {10790#(<= ~counter~0 1)} assume !(0 == ~cond); {10790#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:14,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {10790#(<= ~counter~0 1)} assume true; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:14,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10790#(<= ~counter~0 1)} {10790#(<= ~counter~0 1)} #94#return; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:14,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {10790#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10790#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:14,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {10790#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:14,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {10815#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:14,797 INFO L272 TraceCheckUtils]: 27: Hoare triple {10815#(<= ~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)); {10815#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:14,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {10815#(<= ~counter~0 2)} ~cond := #in~cond; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:14,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {10815#(<= ~counter~0 2)} assume !(0 == ~cond); {10815#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:14,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {10815#(<= ~counter~0 2)} assume true; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:14,799 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10815#(<= ~counter~0 2)} {10815#(<= ~counter~0 2)} #96#return; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:14,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {10815#(<= ~counter~0 2)} assume !(~r~0 > 0); {10815#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:14,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {10815#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:14,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:14,800 INFO L272 TraceCheckUtils]: 35: Hoare triple {10840#(<= ~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)); {10840#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:14,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#(<= ~counter~0 3)} ~cond := #in~cond; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:14,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {10840#(<= ~counter~0 3)} assume !(0 == ~cond); {10840#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:14,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {10840#(<= ~counter~0 3)} assume true; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:14,802 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10840#(<= ~counter~0 3)} {10840#(<= ~counter~0 3)} #98#return; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:14,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {10840#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:14,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {10840#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:14,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {10865#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:14,803 INFO L272 TraceCheckUtils]: 43: Hoare triple {10865#(<= ~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)); {10865#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:14,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {10865#(<= ~counter~0 4)} ~cond := #in~cond; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:14,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {10865#(<= ~counter~0 4)} assume !(0 == ~cond); {10865#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:14,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {10865#(<= ~counter~0 4)} assume true; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:14,804 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10865#(<= ~counter~0 4)} {10865#(<= ~counter~0 4)} #98#return; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:14,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {10865#(<= ~counter~0 4)} assume !(~r~0 < 0); {10865#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:14,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {10865#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:14,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {10890#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:14,806 INFO L272 TraceCheckUtils]: 51: Hoare triple {10890#(<= ~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)); {10890#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:14,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#(<= ~counter~0 5)} ~cond := #in~cond; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:14,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#(<= ~counter~0 5)} assume !(0 == ~cond); {10890#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:14,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#(<= ~counter~0 5)} assume true; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:14,807 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#(<= ~counter~0 5)} {10890#(<= ~counter~0 5)} #94#return; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:14,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {10890#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10890#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:14,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {10890#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10915#(<= |main_#t~post7| 5)} is VALID [2022-04-08 06:03:14,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {10915#(<= |main_#t~post7| 5)} assume !(#t~post7 < 50);havoc #t~post7; {10734#false} is VALID [2022-04-08 06:03:14,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-08 06:03:14,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 50);havoc #t~post8; {10734#false} is VALID [2022-04-08 06:03:14,809 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-08 06:03:14,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 50);havoc #t~post6; {10734#false} is VALID [2022-04-08 06:03:14,809 INFO L272 TraceCheckUtils]: 63: Hoare triple {10734#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)); {10734#false} is VALID [2022-04-08 06:03:14,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-08 06:03:14,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-08 06:03:14,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-08 06:03:14,809 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-08 06:03:14,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:15,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-08 06:03:15,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-08 06:03:15,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-08 06:03:15,162 INFO L272 TraceCheckUtils]: 63: Hoare triple {10734#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)); {10734#false} is VALID [2022-04-08 06:03:15,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 50);havoc #t~post6; {10734#false} is VALID [2022-04-08 06:03:15,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-08 06:03:15,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 50);havoc #t~post8; {10734#false} is VALID [2022-04-08 06:03:15,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-08 06:03:15,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {10967#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {10734#false} is VALID [2022-04-08 06:03:15,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {10971#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10967#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:03:15,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {10971#(< ~counter~0 50)} assume !!(0 != ~r~0); {10971#(< ~counter~0 50)} is VALID [2022-04-08 06:03:15,163 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10733#true} {10971#(< ~counter~0 50)} #94#return; {10971#(< ~counter~0 50)} is VALID [2022-04-08 06:03:15,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 06:03:15,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 06:03:15,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 06:03:15,164 INFO L272 TraceCheckUtils]: 51: Hoare triple {10971#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 06:03:15,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {10971#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {10971#(< ~counter~0 50)} is VALID [2022-04-08 06:03:15,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {10996#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10971#(< ~counter~0 50)} is VALID [2022-04-08 06:03:15,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {10996#(< ~counter~0 49)} assume !(~r~0 < 0); {10996#(< ~counter~0 49)} is VALID [2022-04-08 06:03:15,165 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10733#true} {10996#(< ~counter~0 49)} #98#return; {10996#(< ~counter~0 49)} is VALID [2022-04-08 06:03:15,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 06:03:15,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 06:03:15,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 06:03:15,166 INFO L272 TraceCheckUtils]: 43: Hoare triple {10996#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 06:03:15,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {10996#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {10996#(< ~counter~0 49)} is VALID [2022-04-08 06:03:15,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {11021#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10996#(< ~counter~0 49)} is VALID [2022-04-08 06:03:15,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {11021#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11021#(< ~counter~0 48)} is VALID [2022-04-08 06:03:15,167 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10733#true} {11021#(< ~counter~0 48)} #98#return; {11021#(< ~counter~0 48)} is VALID [2022-04-08 06:03:15,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 06:03:15,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 06:03:15,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 06:03:15,168 INFO L272 TraceCheckUtils]: 35: Hoare triple {11021#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 06:03:15,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {11021#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {11021#(< ~counter~0 48)} is VALID [2022-04-08 06:03:15,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {11046#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11021#(< ~counter~0 48)} is VALID [2022-04-08 06:03:15,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {11046#(< ~counter~0 47)} assume !(~r~0 > 0); {11046#(< ~counter~0 47)} is VALID [2022-04-08 06:03:15,169 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10733#true} {11046#(< ~counter~0 47)} #96#return; {11046#(< ~counter~0 47)} is VALID [2022-04-08 06:03:15,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 06:03:15,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 06:03:15,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 06:03:15,170 INFO L272 TraceCheckUtils]: 27: Hoare triple {11046#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 06:03:15,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {11046#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {11046#(< ~counter~0 47)} is VALID [2022-04-08 06:03:15,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {11071#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11046#(< ~counter~0 47)} is VALID [2022-04-08 06:03:15,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {11071#(< ~counter~0 46)} assume !!(0 != ~r~0); {11071#(< ~counter~0 46)} is VALID [2022-04-08 06:03:15,171 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10733#true} {11071#(< ~counter~0 46)} #94#return; {11071#(< ~counter~0 46)} is VALID [2022-04-08 06:03:15,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 06:03:15,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 06:03:15,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 06:03:15,171 INFO L272 TraceCheckUtils]: 19: Hoare triple {11071#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 06:03:15,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {11071#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {11071#(< ~counter~0 46)} is VALID [2022-04-08 06:03:15,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {11096#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11071#(< ~counter~0 46)} is VALID [2022-04-08 06:03:15,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {11096#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11096#(< ~counter~0 45)} is VALID [2022-04-08 06:03:15,173 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10733#true} {11096#(< ~counter~0 45)} #92#return; {11096#(< ~counter~0 45)} is VALID [2022-04-08 06:03:15,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 06:03:15,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 06:03:15,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 06:03:15,173 INFO L272 TraceCheckUtils]: 11: Hoare triple {11096#(< ~counter~0 45)} 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)); {10733#true} is VALID [2022-04-08 06:03:15,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10733#true} {11096#(< ~counter~0 45)} #90#return; {11096#(< ~counter~0 45)} is VALID [2022-04-08 06:03:15,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 06:03:15,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 06:03:15,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 06:03:15,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {11096#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10733#true} is VALID [2022-04-08 06:03:15,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {11096#(< ~counter~0 45)} 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; {11096#(< ~counter~0 45)} is VALID [2022-04-08 06:03:15,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {11096#(< ~counter~0 45)} call #t~ret9 := main(); {11096#(< ~counter~0 45)} is VALID [2022-04-08 06:03:15,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11096#(< ~counter~0 45)} {10733#true} #102#return; {11096#(< ~counter~0 45)} is VALID [2022-04-08 06:03:15,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {11096#(< ~counter~0 45)} assume true; {11096#(< ~counter~0 45)} is VALID [2022-04-08 06:03:15,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {10733#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11096#(< ~counter~0 45)} is VALID [2022-04-08 06:03:15,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-08 06:03:15,176 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-08 06:03:15,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:15,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245082422] [2022-04-08 06:03:15,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:15,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328363530] [2022-04-08 06:03:15,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328363530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:15,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:15,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 06:03:15,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:15,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569063080] [2022-04-08 06:03:15,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569063080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:15,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:15,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:03:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662103620] [2022-04-08 06:03:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:15,178 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-08 06:03:15,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:15,178 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-08 06:03:15,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:15,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:03:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:15,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:03:15,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:03:15,223 INFO L87 Difference]: Start difference. First operand 109 states and 135 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-08 06:03:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:15,628 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-08 06:03:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 06:03:15,628 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-08 06:03:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:15,629 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-08 06:03:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 06:03:15,631 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-08 06:03:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 06:03:15,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-08 06:03:15,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:15,751 INFO L225 Difference]: With dead ends: 151 [2022-04-08 06:03:15,751 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 06:03:15,752 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-08 06:03:15,752 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 38 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:15,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 182 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 06:03:15,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-08 06:03:15,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:15,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:15,861 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:15,861 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:15,864 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 06:03:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:03:15,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:15,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:15,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-08 06:03:15,865 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-08 06:03:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:15,868 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 06:03:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:03:15,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:15,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:15,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:15,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:03:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-08 06:03:15,871 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-08 06:03:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:15,872 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-08 06:03:15,872 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-08 06:03:15,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-08 06:03:18,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 139 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:03:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 06:03:18,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:18,116 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-08 06:03:18,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:18,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 06:03:18,327 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-08 06:03:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:18,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [119196621] [2022-04-08 06:03:18,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-08 06:03:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:18,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533623390] [2022-04-08 06:03:18,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:18,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:18,340 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:18,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361557073] [2022-04-08 06:03:18,341 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:03:18,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:18,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:18,342 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:18,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 06:03:18,421 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:03:18,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:18,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:03:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:18,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:18,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-08 06:03:18,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11924#(<= ~counter~0 0)} {11916#true} #102#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {11924#(<= ~counter~0 0)} call #t~ret9 := main(); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {11924#(<= ~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; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {11924#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #90#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,786 INFO L272 TraceCheckUtils]: 11: Hoare triple {11924#(<= ~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)); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,787 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #92#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {11924#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:18,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {11924#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:18,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {11973#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:18,789 INFO L272 TraceCheckUtils]: 19: Hoare triple {11973#(<= ~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)); {11973#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:18,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {11973#(<= ~counter~0 1)} ~cond := #in~cond; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:18,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {11973#(<= ~counter~0 1)} assume !(0 == ~cond); {11973#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:18,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {11973#(<= ~counter~0 1)} assume true; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:18,790 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11973#(<= ~counter~0 1)} {11973#(<= ~counter~0 1)} #94#return; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:18,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {11973#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11973#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:18,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {11973#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:18,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {11998#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:18,792 INFO L272 TraceCheckUtils]: 27: Hoare triple {11998#(<= ~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)); {11998#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:18,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(<= ~counter~0 2)} ~cond := #in~cond; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:18,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {11998#(<= ~counter~0 2)} assume !(0 == ~cond); {11998#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:18,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {11998#(<= ~counter~0 2)} assume true; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:18,804 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11998#(<= ~counter~0 2)} {11998#(<= ~counter~0 2)} #96#return; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:18,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {11998#(<= ~counter~0 2)} assume !(~r~0 > 0); {11998#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:18,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {11998#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:18,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {12023#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:18,806 INFO L272 TraceCheckUtils]: 35: Hoare triple {12023#(<= ~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)); {12023#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:18,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {12023#(<= ~counter~0 3)} ~cond := #in~cond; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:18,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {12023#(<= ~counter~0 3)} assume !(0 == ~cond); {12023#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:18,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {12023#(<= ~counter~0 3)} assume true; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:18,807 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12023#(<= ~counter~0 3)} {12023#(<= ~counter~0 3)} #98#return; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:18,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {12023#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:18,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {12023#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:18,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {12048#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:18,809 INFO L272 TraceCheckUtils]: 43: Hoare triple {12048#(<= ~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)); {12048#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:18,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {12048#(<= ~counter~0 4)} ~cond := #in~cond; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:18,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {12048#(<= ~counter~0 4)} assume !(0 == ~cond); {12048#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:18,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {12048#(<= ~counter~0 4)} assume true; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:18,811 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12048#(<= ~counter~0 4)} {12048#(<= ~counter~0 4)} #98#return; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:18,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {12048#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:18,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {12048#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:18,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {12073#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:18,812 INFO L272 TraceCheckUtils]: 51: Hoare triple {12073#(<= ~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)); {12073#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:18,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {12073#(<= ~counter~0 5)} ~cond := #in~cond; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:18,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {12073#(<= ~counter~0 5)} assume !(0 == ~cond); {12073#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:18,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {12073#(<= ~counter~0 5)} assume true; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:18,814 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12073#(<= ~counter~0 5)} {12073#(<= ~counter~0 5)} #98#return; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:18,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {12073#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:18,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {12073#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:18,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {12098#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:18,815 INFO L272 TraceCheckUtils]: 59: Hoare triple {12098#(<= ~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)); {12098#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:18,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {12098#(<= ~counter~0 6)} ~cond := #in~cond; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:18,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {12098#(<= ~counter~0 6)} assume !(0 == ~cond); {12098#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:18,824 INFO L290 TraceCheckUtils]: 62: Hoare triple {12098#(<= ~counter~0 6)} assume true; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:18,824 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12098#(<= ~counter~0 6)} {12098#(<= ~counter~0 6)} #98#return; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:18,825 INFO L290 TraceCheckUtils]: 64: Hoare triple {12098#(<= ~counter~0 6)} assume !(~r~0 < 0); {12098#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:18,825 INFO L290 TraceCheckUtils]: 65: Hoare triple {12098#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12123#(<= |main_#t~post6| 6)} is VALID [2022-04-08 06:03:18,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {12123#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {11917#false} is VALID [2022-04-08 06:03:18,826 INFO L272 TraceCheckUtils]: 67: Hoare triple {11917#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)); {11917#false} is VALID [2022-04-08 06:03:18,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-08 06:03:18,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-08 06:03:18,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-08 06:03:18,826 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-08 06:03:18,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:19,219 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-08 06:03:19,219 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-08 06:03:19,219 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-08 06:03:19,219 INFO L272 TraceCheckUtils]: 67: Hoare triple {11917#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)); {11917#false} is VALID [2022-04-08 06:03:19,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {12151#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {11917#false} is VALID [2022-04-08 06:03:19,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {12155#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12151#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:03:19,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {12155#(< ~counter~0 50)} assume !(~r~0 < 0); {12155#(< ~counter~0 50)} is VALID [2022-04-08 06:03:19,221 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11916#true} {12155#(< ~counter~0 50)} #98#return; {12155#(< ~counter~0 50)} is VALID [2022-04-08 06:03:19,221 INFO L290 TraceCheckUtils]: 62: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 06:03:19,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 06:03:19,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 06:03:19,221 INFO L272 TraceCheckUtils]: 59: Hoare triple {12155#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 06:03:19,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {12155#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {12155#(< ~counter~0 50)} is VALID [2022-04-08 06:03:19,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {12180#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12155#(< ~counter~0 50)} is VALID [2022-04-08 06:03:19,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {12180#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12180#(< ~counter~0 49)} is VALID [2022-04-08 06:03:19,223 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11916#true} {12180#(< ~counter~0 49)} #98#return; {12180#(< ~counter~0 49)} is VALID [2022-04-08 06:03:19,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 06:03:19,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 06:03:19,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 06:03:19,223 INFO L272 TraceCheckUtils]: 51: Hoare triple {12180#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 06:03:19,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {12180#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {12180#(< ~counter~0 49)} is VALID [2022-04-08 06:03:19,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {12205#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12180#(< ~counter~0 49)} is VALID [2022-04-08 06:03:19,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {12205#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12205#(< ~counter~0 48)} is VALID [2022-04-08 06:03:19,225 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11916#true} {12205#(< ~counter~0 48)} #98#return; {12205#(< ~counter~0 48)} is VALID [2022-04-08 06:03:19,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 06:03:19,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 06:03:19,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 06:03:19,225 INFO L272 TraceCheckUtils]: 43: Hoare triple {12205#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 06:03:19,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {12205#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {12205#(< ~counter~0 48)} is VALID [2022-04-08 06:03:19,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {12230#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12205#(< ~counter~0 48)} is VALID [2022-04-08 06:03:19,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {12230#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12230#(< ~counter~0 47)} is VALID [2022-04-08 06:03:19,227 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11916#true} {12230#(< ~counter~0 47)} #98#return; {12230#(< ~counter~0 47)} is VALID [2022-04-08 06:03:19,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 06:03:19,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 06:03:19,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 06:03:19,227 INFO L272 TraceCheckUtils]: 35: Hoare triple {12230#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 06:03:19,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {12230#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {12230#(< ~counter~0 47)} is VALID [2022-04-08 06:03:19,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {12255#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12230#(< ~counter~0 47)} is VALID [2022-04-08 06:03:19,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {12255#(< ~counter~0 46)} assume !(~r~0 > 0); {12255#(< ~counter~0 46)} is VALID [2022-04-08 06:03:19,229 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11916#true} {12255#(< ~counter~0 46)} #96#return; {12255#(< ~counter~0 46)} is VALID [2022-04-08 06:03:19,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 06:03:19,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 06:03:19,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 06:03:19,229 INFO L272 TraceCheckUtils]: 27: Hoare triple {12255#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 06:03:19,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {12255#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {12255#(< ~counter~0 46)} is VALID [2022-04-08 06:03:19,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {12280#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12255#(< ~counter~0 46)} is VALID [2022-04-08 06:03:19,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {12280#(< ~counter~0 45)} assume !!(0 != ~r~0); {12280#(< ~counter~0 45)} is VALID [2022-04-08 06:03:19,230 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11916#true} {12280#(< ~counter~0 45)} #94#return; {12280#(< ~counter~0 45)} is VALID [2022-04-08 06:03:19,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 06:03:19,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 06:03:19,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 06:03:19,231 INFO L272 TraceCheckUtils]: 19: Hoare triple {12280#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 06:03:19,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {12280#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {12280#(< ~counter~0 45)} is VALID [2022-04-08 06:03:19,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {12305#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12280#(< ~counter~0 45)} is VALID [2022-04-08 06:03:19,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {12305#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12305#(< ~counter~0 44)} is VALID [2022-04-08 06:03:19,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11916#true} {12305#(< ~counter~0 44)} #92#return; {12305#(< ~counter~0 44)} is VALID [2022-04-08 06:03:19,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 06:03:19,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 06:03:19,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 06:03:19,233 INFO L272 TraceCheckUtils]: 11: Hoare triple {12305#(< ~counter~0 44)} 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)); {11916#true} is VALID [2022-04-08 06:03:19,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11916#true} {12305#(< ~counter~0 44)} #90#return; {12305#(< ~counter~0 44)} is VALID [2022-04-08 06:03:19,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 06:03:19,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 06:03:19,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 06:03:19,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {12305#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11916#true} is VALID [2022-04-08 06:03:19,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {12305#(< ~counter~0 44)} 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; {12305#(< ~counter~0 44)} is VALID [2022-04-08 06:03:19,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {12305#(< ~counter~0 44)} call #t~ret9 := main(); {12305#(< ~counter~0 44)} is VALID [2022-04-08 06:03:19,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12305#(< ~counter~0 44)} {11916#true} #102#return; {12305#(< ~counter~0 44)} is VALID [2022-04-08 06:03:19,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {12305#(< ~counter~0 44)} assume true; {12305#(< ~counter~0 44)} is VALID [2022-04-08 06:03:19,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12305#(< ~counter~0 44)} is VALID [2022-04-08 06:03:19,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-08 06:03:19,235 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-08 06:03:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:19,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533623390] [2022-04-08 06:03:19,236 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:19,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361557073] [2022-04-08 06:03:19,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361557073] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:19,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:19,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 06:03:19,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:19,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [119196621] [2022-04-08 06:03:19,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [119196621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:19,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:19,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:03:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096361660] [2022-04-08 06:03:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:19,237 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-08 06:03:19,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:19,237 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-08 06:03:19,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:19,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:03:19,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:19,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:03:19,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:03:19,285 INFO L87 Difference]: Start difference. First operand 114 states and 140 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-08 06:03:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:19,742 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-08 06:03:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 06:03:19,742 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-08 06:03:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:19,743 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-08 06:03:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 06:03:19,745 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-08 06:03:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 06:03:19,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-08 06:03:19,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:19,865 INFO L225 Difference]: With dead ends: 137 [2022-04-08 06:03:19,865 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 06:03:19,865 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-08 06:03:19,866 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:19,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 189 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 06:03:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-08 06:03:20,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:20,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:03:20,018 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:03:20,019 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:03:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:20,024 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 06:03:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 06:03:20,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:20,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:20,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-08 06:03:20,026 INFO L87 Difference]: Start difference. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-08 06:03:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:20,029 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 06:03:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 06:03:20,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:20,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:20,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:20,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:03:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-08 06:03:20,032 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-08 06:03:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:20,035 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-08 06:03:20,035 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-08 06:03:20,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-08 06:03:20,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-08 06:03:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 06:03:20,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:20,927 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-08 06:03:20,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:21,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 06:03:21,131 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:21,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-08 06:03:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:21,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495034591] [2022-04-08 06:03:21,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-08 06:03:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:21,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709851137] [2022-04-08 06:03:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:21,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:21,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616561606] [2022-04-08 06:03:21,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:21,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:21,144 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 06:03:21,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:21,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:21,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:03:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:21,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:21,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-08 06:03:21,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13153#true} is VALID [2022-04-08 06:03:21,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #102#return; {13153#true} is VALID [2022-04-08 06:03:21,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret9 := main(); {13153#true} is VALID [2022-04-08 06:03:21,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#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; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L272 TraceCheckUtils]: 6: Hoare triple {13153#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13153#true} {13153#true} #90#return; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L272 TraceCheckUtils]: 11: Hoare triple {13153#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)); {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13153#true} {13153#true} #92#return; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {13153#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {13153#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {13153#true} assume !!(#t~post6 < 50);havoc #t~post6; {13153#true} is VALID [2022-04-08 06:03:21,408 INFO L272 TraceCheckUtils]: 19: Hoare triple {13153#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)); {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13153#true} {13153#true} #94#return; {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {13153#true} assume !!(0 != ~r~0); {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {13153#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {13153#true} assume !!(#t~post7 < 50);havoc #t~post7; {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L272 TraceCheckUtils]: 27: Hoare triple {13153#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)); {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13153#true} {13153#true} #96#return; {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {13153#true} assume !(~r~0 > 0); {13153#true} is VALID [2022-04-08 06:03:21,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {13153#true} assume !!(#t~post8 < 50);havoc #t~post8; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L272 TraceCheckUtils]: 35: Hoare triple {13153#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)); {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {13153#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {13153#true} assume !!(#t~post8 < 50);havoc #t~post8; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L272 TraceCheckUtils]: 43: Hoare triple {13153#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)); {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 06:03:21,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 06:03:21,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,411 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-08 06:03:21,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {13153#true} assume !(~r~0 < 0); {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:21,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {13302#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:21,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {13302#(not (< main_~r~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:21,420 INFO L272 TraceCheckUtils]: 51: Hoare triple {13302#(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)); {13153#true} is VALID [2022-04-08 06:03:21,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 06:03:21,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 06:03:21,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,421 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13153#true} {13302#(not (< main_~r~0 0))} #94#return; {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:21,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {13302#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:03:21,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:03:21,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 50);havoc #t~post7; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:03:21,422 INFO L272 TraceCheckUtils]: 59: Hoare triple {13327#(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)); {13153#true} is VALID [2022-04-08 06:03:21,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 06:03:21,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 06:03:21,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 06:03:21,423 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13153#true} {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {13154#false} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {13154#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13154#false} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {13154#false} assume !(#t~post8 < 50);havoc #t~post8; {13154#false} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13154#false} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} assume !(#t~post6 < 50);havoc #t~post6; {13154#false} is VALID [2022-04-08 06:03:21,424 INFO L272 TraceCheckUtils]: 69: Hoare triple {13154#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)); {13154#false} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 06:03:21,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 06:03:21,425 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-08 06:03:21,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:03:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709851137] [2022-04-08 06:03:21,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616561606] [2022-04-08 06:03:21,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616561606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:21,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:21,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:03:21,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:21,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495034591] [2022-04-08 06:03:21,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495034591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:21,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:21,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:03:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189172612] [2022-04-08 06:03:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:21,427 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-08 06:03:21,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:21,428 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-08 06:03:21,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:21,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:03:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:03:21,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:03:21,465 INFO L87 Difference]: Start difference. First operand 125 states and 155 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-08 06:03:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:21,678 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-08 06:03:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:03:21,678 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-08 06:03:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:21,679 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-08 06:03:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:03:21,680 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-08 06:03:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:03:21,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 06:03:21,743 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-08 06:03:21,746 INFO L225 Difference]: With dead ends: 180 [2022-04-08 06:03:21,746 INFO L226 Difference]: Without dead ends: 143 [2022-04-08 06:03:21,746 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-08 06:03:21,747 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-08 06:03:21,747 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-08 06:03:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-08 06:03:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-08 06:03:21,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:21,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:21,922 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:21,922 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:21,925 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 06:03:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 06:03:21,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:21,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:21,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-08 06:03:21,926 INFO L87 Difference]: Start difference. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-08 06:03:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:21,929 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 06:03:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 06:03:21,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:21,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:21,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:21,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-08 06:03:21,932 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-08 06:03:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:21,933 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-08 06:03:21,933 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-08 06:03:21,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-08 06:03:22,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-08 06:03:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 06:03:22,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:22,765 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-08 06:03:22,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:22,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 06:03:22,983 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-08 06:03:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:22,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [301974010] [2022-04-08 06:03:22,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-08 06:03:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:22,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750935320] [2022-04-08 06:03:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:22,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:22,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034388310] [2022-04-08 06:03:22,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:22,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:22,996 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:23,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 06:03:23,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:23,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:23,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:03:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:23,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:23,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-08 06:03:23,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14303#(<= ~counter~0 0)} {14295#true} #102#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {14303#(<= ~counter~0 0)} call #t~ret9 := main(); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {14303#(<= ~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; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {14303#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,464 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #90#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,464 INFO L272 TraceCheckUtils]: 11: Hoare triple {14303#(<= ~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)); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #92#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {14303#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:23,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {14303#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:23,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {14352#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:23,467 INFO L272 TraceCheckUtils]: 19: Hoare triple {14352#(<= ~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)); {14352#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:23,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {14352#(<= ~counter~0 1)} ~cond := #in~cond; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:23,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {14352#(<= ~counter~0 1)} assume !(0 == ~cond); {14352#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:23,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {14352#(<= ~counter~0 1)} assume true; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:23,469 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14352#(<= ~counter~0 1)} {14352#(<= ~counter~0 1)} #94#return; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:23,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {14352#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14352#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:23,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {14352#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:23,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {14377#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:23,470 INFO L272 TraceCheckUtils]: 27: Hoare triple {14377#(<= ~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)); {14377#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:23,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {14377#(<= ~counter~0 2)} ~cond := #in~cond; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:23,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {14377#(<= ~counter~0 2)} assume !(0 == ~cond); {14377#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:23,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {14377#(<= ~counter~0 2)} assume true; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:23,471 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14377#(<= ~counter~0 2)} {14377#(<= ~counter~0 2)} #96#return; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:23,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {14377#(<= ~counter~0 2)} assume !(~r~0 > 0); {14377#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:23,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {14377#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:23,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {14402#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:23,473 INFO L272 TraceCheckUtils]: 35: Hoare triple {14402#(<= ~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)); {14402#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:23,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {14402#(<= ~counter~0 3)} ~cond := #in~cond; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:23,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {14402#(<= ~counter~0 3)} assume !(0 == ~cond); {14402#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:23,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {14402#(<= ~counter~0 3)} assume true; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:23,474 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14402#(<= ~counter~0 3)} {14402#(<= ~counter~0 3)} #98#return; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:23,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {14402#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:23,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {14402#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:23,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {14427#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:23,476 INFO L272 TraceCheckUtils]: 43: Hoare triple {14427#(<= ~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)); {14427#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:23,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {14427#(<= ~counter~0 4)} ~cond := #in~cond; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:23,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {14427#(<= ~counter~0 4)} assume !(0 == ~cond); {14427#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:23,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {14427#(<= ~counter~0 4)} assume true; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:23,478 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14427#(<= ~counter~0 4)} {14427#(<= ~counter~0 4)} #98#return; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:23,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {14427#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:23,478 INFO L290 TraceCheckUtils]: 49: Hoare triple {14427#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:23,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {14452#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:23,479 INFO L272 TraceCheckUtils]: 51: Hoare triple {14452#(<= ~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)); {14452#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:23,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {14452#(<= ~counter~0 5)} ~cond := #in~cond; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:23,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {14452#(<= ~counter~0 5)} assume !(0 == ~cond); {14452#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:23,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {14452#(<= ~counter~0 5)} assume true; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:23,481 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14452#(<= ~counter~0 5)} {14452#(<= ~counter~0 5)} #98#return; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:23,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {14452#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:23,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {14452#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:23,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {14477#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:23,482 INFO L272 TraceCheckUtils]: 59: Hoare triple {14477#(<= ~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)); {14477#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:23,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {14477#(<= ~counter~0 6)} ~cond := #in~cond; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:23,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {14477#(<= ~counter~0 6)} assume !(0 == ~cond); {14477#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:23,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {14477#(<= ~counter~0 6)} assume true; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:23,483 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14477#(<= ~counter~0 6)} {14477#(<= ~counter~0 6)} #98#return; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:23,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {14477#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:23,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {14477#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14502#(<= |main_#t~post8| 6)} is VALID [2022-04-08 06:03:23,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {14502#(<= |main_#t~post8| 6)} assume !(#t~post8 < 50);havoc #t~post8; {14296#false} is VALID [2022-04-08 06:03:23,485 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-08 06:03:23,485 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 50);havoc #t~post6; {14296#false} is VALID [2022-04-08 06:03:23,485 INFO L272 TraceCheckUtils]: 69: Hoare triple {14296#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)); {14296#false} is VALID [2022-04-08 06:03:23,485 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-08 06:03:23,485 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-08 06:03:23,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-08 06:03:23,485 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-08 06:03:23,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:23,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-08 06:03:23,849 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-08 06:03:23,849 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-08 06:03:23,849 INFO L272 TraceCheckUtils]: 69: Hoare triple {14296#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)); {14296#false} is VALID [2022-04-08 06:03:23,849 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 50);havoc #t~post6; {14296#false} is VALID [2022-04-08 06:03:23,849 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-08 06:03:23,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {14542#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {14296#false} is VALID [2022-04-08 06:03:23,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {14546#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14542#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:03:23,850 INFO L290 TraceCheckUtils]: 64: Hoare triple {14546#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14546#(< ~counter~0 50)} is VALID [2022-04-08 06:03:23,850 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14295#true} {14546#(< ~counter~0 50)} #98#return; {14546#(< ~counter~0 50)} is VALID [2022-04-08 06:03:23,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 06:03:23,850 INFO L290 TraceCheckUtils]: 61: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 06:03:23,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 06:03:23,851 INFO L272 TraceCheckUtils]: 59: Hoare triple {14546#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 06:03:23,851 INFO L290 TraceCheckUtils]: 58: Hoare triple {14546#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {14546#(< ~counter~0 50)} is VALID [2022-04-08 06:03:23,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {14571#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14546#(< ~counter~0 50)} is VALID [2022-04-08 06:03:23,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {14571#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14571#(< ~counter~0 49)} is VALID [2022-04-08 06:03:23,852 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14295#true} {14571#(< ~counter~0 49)} #98#return; {14571#(< ~counter~0 49)} is VALID [2022-04-08 06:03:23,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 06:03:23,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 06:03:23,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 06:03:23,853 INFO L272 TraceCheckUtils]: 51: Hoare triple {14571#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 06:03:23,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {14571#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {14571#(< ~counter~0 49)} is VALID [2022-04-08 06:03:23,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {14596#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14571#(< ~counter~0 49)} is VALID [2022-04-08 06:03:23,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {14596#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14596#(< ~counter~0 48)} is VALID [2022-04-08 06:03:23,856 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14295#true} {14596#(< ~counter~0 48)} #98#return; {14596#(< ~counter~0 48)} is VALID [2022-04-08 06:03:23,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 06:03:23,856 INFO L290 TraceCheckUtils]: 45: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 06:03:23,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 06:03:23,857 INFO L272 TraceCheckUtils]: 43: Hoare triple {14596#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 06:03:23,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {14596#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {14596#(< ~counter~0 48)} is VALID [2022-04-08 06:03:23,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {14621#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14596#(< ~counter~0 48)} is VALID [2022-04-08 06:03:23,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {14621#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14621#(< ~counter~0 47)} is VALID [2022-04-08 06:03:23,858 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14295#true} {14621#(< ~counter~0 47)} #98#return; {14621#(< ~counter~0 47)} is VALID [2022-04-08 06:03:23,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 06:03:23,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 06:03:23,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 06:03:23,859 INFO L272 TraceCheckUtils]: 35: Hoare triple {14621#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 06:03:23,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {14621#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {14621#(< ~counter~0 47)} is VALID [2022-04-08 06:03:23,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {14646#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14621#(< ~counter~0 47)} is VALID [2022-04-08 06:03:23,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {14646#(< ~counter~0 46)} assume !(~r~0 > 0); {14646#(< ~counter~0 46)} is VALID [2022-04-08 06:03:23,860 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14295#true} {14646#(< ~counter~0 46)} #96#return; {14646#(< ~counter~0 46)} is VALID [2022-04-08 06:03:23,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 06:03:23,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 06:03:23,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 06:03:23,860 INFO L272 TraceCheckUtils]: 27: Hoare triple {14646#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 06:03:23,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {14646#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {14646#(< ~counter~0 46)} is VALID [2022-04-08 06:03:23,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {14671#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14646#(< ~counter~0 46)} is VALID [2022-04-08 06:03:23,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {14671#(< ~counter~0 45)} assume !!(0 != ~r~0); {14671#(< ~counter~0 45)} is VALID [2022-04-08 06:03:23,862 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14295#true} {14671#(< ~counter~0 45)} #94#return; {14671#(< ~counter~0 45)} is VALID [2022-04-08 06:03:23,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 06:03:23,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 06:03:23,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 06:03:23,862 INFO L272 TraceCheckUtils]: 19: Hoare triple {14671#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 06:03:23,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {14671#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {14671#(< ~counter~0 45)} is VALID [2022-04-08 06:03:23,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {14696#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14671#(< ~counter~0 45)} is VALID [2022-04-08 06:03:23,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {14696#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14696#(< ~counter~0 44)} is VALID [2022-04-08 06:03:23,864 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14295#true} {14696#(< ~counter~0 44)} #92#return; {14696#(< ~counter~0 44)} is VALID [2022-04-08 06:03:23,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 06:03:23,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 06:03:23,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 06:03:23,864 INFO L272 TraceCheckUtils]: 11: Hoare triple {14696#(< ~counter~0 44)} 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)); {14295#true} is VALID [2022-04-08 06:03:23,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14295#true} {14696#(< ~counter~0 44)} #90#return; {14696#(< ~counter~0 44)} is VALID [2022-04-08 06:03:23,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 06:03:23,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 06:03:23,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 06:03:23,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {14696#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14295#true} is VALID [2022-04-08 06:03:23,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {14696#(< ~counter~0 44)} 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; {14696#(< ~counter~0 44)} is VALID [2022-04-08 06:03:23,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {14696#(< ~counter~0 44)} call #t~ret9 := main(); {14696#(< ~counter~0 44)} is VALID [2022-04-08 06:03:23,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14696#(< ~counter~0 44)} {14295#true} #102#return; {14696#(< ~counter~0 44)} is VALID [2022-04-08 06:03:23,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {14696#(< ~counter~0 44)} assume true; {14696#(< ~counter~0 44)} is VALID [2022-04-08 06:03:23,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14696#(< ~counter~0 44)} is VALID [2022-04-08 06:03:23,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-08 06:03:23,867 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-08 06:03:23,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:23,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750935320] [2022-04-08 06:03:23,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:23,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034388310] [2022-04-08 06:03:23,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034388310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:23,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:23,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 06:03:23,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:23,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [301974010] [2022-04-08 06:03:23,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [301974010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:23,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:23,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:03:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55809614] [2022-04-08 06:03:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:23,868 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-08 06:03:23,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:23,869 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-08 06:03:23,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:23,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:03:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:03:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:03:23,919 INFO L87 Difference]: Start difference. First operand 137 states and 173 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-08 06:03:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:24,494 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-08 06:03:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 06:03:24,494 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-08 06:03:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:24,495 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-08 06:03:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 06:03:24,496 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-08 06:03:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 06:03:24,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-08 06:03:24,632 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-08 06:03:24,635 INFO L225 Difference]: With dead ends: 193 [2022-04-08 06:03:24,635 INFO L226 Difference]: Without dead ends: 144 [2022-04-08 06:03:24,635 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-08 06:03:24,635 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 53 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:24,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 197 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-08 06:03:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-08 06:03:24,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:24,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:24,792 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:24,792 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:24,795 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 06:03:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 06:03:24,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:24,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:24,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-08 06:03:24,796 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-08 06:03:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:24,799 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 06:03:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 06:03:24,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:24,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:24,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:24,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-08 06:03:24,803 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-08 06:03:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:24,803 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-08 06:03:24,803 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-08 06:03:24,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-08 06:03:27,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 176 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 06:03:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 06:03:27,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:27,143 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-08 06:03:27,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:27,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:27,355 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-08 06:03:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:27,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449882007] [2022-04-08 06:03:27,358 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:27,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-08 06:03:27,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:27,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439206135] [2022-04-08 06:03:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:27,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:27,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241019660] [2022-04-08 06:03:27,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:27,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:27,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:27,370 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:27,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 06:03:27,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:27,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:27,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:03:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:27,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:27,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-08 06:03:27,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {15712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15720#(<= ~counter~0 0)} {15712#true} #102#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {15720#(<= ~counter~0 0)} call #t~ret9 := main(); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {15720#(<= ~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; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {15720#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #90#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,762 INFO L272 TraceCheckUtils]: 11: Hoare triple {15720#(<= ~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)); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #92#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {15720#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:27,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {15720#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:27,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {15769#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:27,765 INFO L272 TraceCheckUtils]: 19: Hoare triple {15769#(<= ~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)); {15769#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:27,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {15769#(<= ~counter~0 1)} ~cond := #in~cond; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:27,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {15769#(<= ~counter~0 1)} assume !(0 == ~cond); {15769#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:27,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {15769#(<= ~counter~0 1)} assume true; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:27,766 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15769#(<= ~counter~0 1)} {15769#(<= ~counter~0 1)} #94#return; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:27,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {15769#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15769#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:27,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {15769#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:27,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {15794#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:27,767 INFO L272 TraceCheckUtils]: 27: Hoare triple {15794#(<= ~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)); {15794#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:27,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {15794#(<= ~counter~0 2)} ~cond := #in~cond; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:27,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {15794#(<= ~counter~0 2)} assume !(0 == ~cond); {15794#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:27,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {15794#(<= ~counter~0 2)} assume true; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:27,769 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15794#(<= ~counter~0 2)} {15794#(<= ~counter~0 2)} #96#return; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:27,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {15794#(<= ~counter~0 2)} assume !(~r~0 > 0); {15794#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:27,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {15794#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:27,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {15819#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:27,770 INFO L272 TraceCheckUtils]: 35: Hoare triple {15819#(<= ~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)); {15819#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:27,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {15819#(<= ~counter~0 3)} ~cond := #in~cond; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:27,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {15819#(<= ~counter~0 3)} assume !(0 == ~cond); {15819#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:27,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {15819#(<= ~counter~0 3)} assume true; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:27,772 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15819#(<= ~counter~0 3)} {15819#(<= ~counter~0 3)} #98#return; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:27,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {15819#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:27,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {15819#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:27,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {15844#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:27,773 INFO L272 TraceCheckUtils]: 43: Hoare triple {15844#(<= ~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)); {15844#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:27,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {15844#(<= ~counter~0 4)} ~cond := #in~cond; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:27,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {15844#(<= ~counter~0 4)} assume !(0 == ~cond); {15844#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:27,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {15844#(<= ~counter~0 4)} assume true; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:27,774 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15844#(<= ~counter~0 4)} {15844#(<= ~counter~0 4)} #98#return; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:27,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {15844#(<= ~counter~0 4)} assume !(~r~0 < 0); {15844#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:27,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {15844#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:27,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {15869#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:27,776 INFO L272 TraceCheckUtils]: 51: Hoare triple {15869#(<= ~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)); {15869#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:27,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {15869#(<= ~counter~0 5)} ~cond := #in~cond; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:27,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {15869#(<= ~counter~0 5)} assume !(0 == ~cond); {15869#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:27,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {15869#(<= ~counter~0 5)} assume true; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:27,777 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15869#(<= ~counter~0 5)} {15869#(<= ~counter~0 5)} #94#return; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:27,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {15869#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15869#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:27,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {15869#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:27,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {15894#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:27,779 INFO L272 TraceCheckUtils]: 59: Hoare triple {15894#(<= ~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)); {15894#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:27,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {15894#(<= ~counter~0 6)} ~cond := #in~cond; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:27,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {15894#(<= ~counter~0 6)} assume !(0 == ~cond); {15894#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:27,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {15894#(<= ~counter~0 6)} assume true; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:27,780 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15894#(<= ~counter~0 6)} {15894#(<= ~counter~0 6)} #96#return; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:27,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {15894#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:27,781 INFO L290 TraceCheckUtils]: 65: Hoare triple {15894#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15919#(<= |main_#t~post7| 6)} is VALID [2022-04-08 06:03:27,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {15919#(<= |main_#t~post7| 6)} assume !(#t~post7 < 50);havoc #t~post7; {15713#false} is VALID [2022-04-08 06:03:27,781 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-08 06:03:27,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 50);havoc #t~post8; {15713#false} is VALID [2022-04-08 06:03:27,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-08 06:03:27,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 50);havoc #t~post6; {15713#false} is VALID [2022-04-08 06:03:27,781 INFO L272 TraceCheckUtils]: 71: Hoare triple {15713#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)); {15713#false} is VALID [2022-04-08 06:03:27,781 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-08 06:03:27,782 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-08 06:03:27,782 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-08 06:03:27,782 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-08 06:03:27,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:28,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-08 06:03:28,172 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-08 06:03:28,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-08 06:03:28,172 INFO L272 TraceCheckUtils]: 71: Hoare triple {15713#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)); {15713#false} is VALID [2022-04-08 06:03:28,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 50);havoc #t~post6; {15713#false} is VALID [2022-04-08 06:03:28,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-08 06:03:28,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 50);havoc #t~post8; {15713#false} is VALID [2022-04-08 06:03:28,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-08 06:03:28,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {15971#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {15713#false} is VALID [2022-04-08 06:03:28,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {15975#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15971#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:03:28,182 INFO L290 TraceCheckUtils]: 64: Hoare triple {15975#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15975#(< ~counter~0 50)} is VALID [2022-04-08 06:03:28,183 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15712#true} {15975#(< ~counter~0 50)} #96#return; {15975#(< ~counter~0 50)} is VALID [2022-04-08 06:03:28,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 06:03:28,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 06:03:28,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 06:03:28,183 INFO L272 TraceCheckUtils]: 59: Hoare triple {15975#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 06:03:28,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {15975#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {15975#(< ~counter~0 50)} is VALID [2022-04-08 06:03:28,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {16000#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15975#(< ~counter~0 50)} is VALID [2022-04-08 06:03:28,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {16000#(< ~counter~0 49)} assume !!(0 != ~r~0); {16000#(< ~counter~0 49)} is VALID [2022-04-08 06:03:28,185 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15712#true} {16000#(< ~counter~0 49)} #94#return; {16000#(< ~counter~0 49)} is VALID [2022-04-08 06:03:28,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 06:03:28,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 06:03:28,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 06:03:28,185 INFO L272 TraceCheckUtils]: 51: Hoare triple {16000#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 06:03:28,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {16000#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {16000#(< ~counter~0 49)} is VALID [2022-04-08 06:03:28,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {16025#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16000#(< ~counter~0 49)} is VALID [2022-04-08 06:03:28,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {16025#(< ~counter~0 48)} assume !(~r~0 < 0); {16025#(< ~counter~0 48)} is VALID [2022-04-08 06:03:28,187 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15712#true} {16025#(< ~counter~0 48)} #98#return; {16025#(< ~counter~0 48)} is VALID [2022-04-08 06:03:28,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 06:03:28,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 06:03:28,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 06:03:28,187 INFO L272 TraceCheckUtils]: 43: Hoare triple {16025#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 06:03:28,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {16025#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {16025#(< ~counter~0 48)} is VALID [2022-04-08 06:03:28,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {16050#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16025#(< ~counter~0 48)} is VALID [2022-04-08 06:03:28,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {16050#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16050#(< ~counter~0 47)} is VALID [2022-04-08 06:03:28,189 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15712#true} {16050#(< ~counter~0 47)} #98#return; {16050#(< ~counter~0 47)} is VALID [2022-04-08 06:03:28,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 06:03:28,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 06:03:28,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 06:03:28,189 INFO L272 TraceCheckUtils]: 35: Hoare triple {16050#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 06:03:28,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {16050#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {16050#(< ~counter~0 47)} is VALID [2022-04-08 06:03:28,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {16075#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16050#(< ~counter~0 47)} is VALID [2022-04-08 06:03:28,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {16075#(< ~counter~0 46)} assume !(~r~0 > 0); {16075#(< ~counter~0 46)} is VALID [2022-04-08 06:03:28,191 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15712#true} {16075#(< ~counter~0 46)} #96#return; {16075#(< ~counter~0 46)} is VALID [2022-04-08 06:03:28,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 06:03:28,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 06:03:28,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 06:03:28,191 INFO L272 TraceCheckUtils]: 27: Hoare triple {16075#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 06:03:28,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {16075#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {16075#(< ~counter~0 46)} is VALID [2022-04-08 06:03:28,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {16100#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16075#(< ~counter~0 46)} is VALID [2022-04-08 06:03:28,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {16100#(< ~counter~0 45)} assume !!(0 != ~r~0); {16100#(< ~counter~0 45)} is VALID [2022-04-08 06:03:28,193 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15712#true} {16100#(< ~counter~0 45)} #94#return; {16100#(< ~counter~0 45)} is VALID [2022-04-08 06:03:28,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 06:03:28,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 06:03:28,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 06:03:28,193 INFO L272 TraceCheckUtils]: 19: Hoare triple {16100#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 06:03:28,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {16100#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {16100#(< ~counter~0 45)} is VALID [2022-04-08 06:03:28,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {16125#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16100#(< ~counter~0 45)} is VALID [2022-04-08 06:03:28,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {16125#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16125#(< ~counter~0 44)} is VALID [2022-04-08 06:03:28,194 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15712#true} {16125#(< ~counter~0 44)} #92#return; {16125#(< ~counter~0 44)} is VALID [2022-04-08 06:03:28,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 06:03:28,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 06:03:28,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 06:03:28,195 INFO L272 TraceCheckUtils]: 11: Hoare triple {16125#(< ~counter~0 44)} 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)); {15712#true} is VALID [2022-04-08 06:03:28,195 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15712#true} {16125#(< ~counter~0 44)} #90#return; {16125#(< ~counter~0 44)} is VALID [2022-04-08 06:03:28,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 06:03:28,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 06:03:28,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 06:03:28,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {16125#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15712#true} is VALID [2022-04-08 06:03:28,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {16125#(< ~counter~0 44)} 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; {16125#(< ~counter~0 44)} is VALID [2022-04-08 06:03:28,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {16125#(< ~counter~0 44)} call #t~ret9 := main(); {16125#(< ~counter~0 44)} is VALID [2022-04-08 06:03:28,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16125#(< ~counter~0 44)} {15712#true} #102#return; {16125#(< ~counter~0 44)} is VALID [2022-04-08 06:03:28,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {16125#(< ~counter~0 44)} assume true; {16125#(< ~counter~0 44)} is VALID [2022-04-08 06:03:28,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {15712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16125#(< ~counter~0 44)} is VALID [2022-04-08 06:03:28,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-08 06:03:28,197 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-08 06:03:28,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:28,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439206135] [2022-04-08 06:03:28,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:28,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241019660] [2022-04-08 06:03:28,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241019660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:28,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:28,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 06:03:28,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:28,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449882007] [2022-04-08 06:03:28,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449882007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:28,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:28,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:03:28,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200501858] [2022-04-08 06:03:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:28,199 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-08 06:03:28,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:28,200 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-08 06:03:28,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:28,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:03:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:03:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:03:28,266 INFO L87 Difference]: Start difference. First operand 140 states and 177 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-08 06:03:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:28,820 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-08 06:03:28,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:03:28,820 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-08 06:03:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:28,821 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-08 06:03:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 06:03:28,822 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-08 06:03:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 06:03:28,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-08 06:03:28,963 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-08 06:03:28,966 INFO L225 Difference]: With dead ends: 195 [2022-04-08 06:03:28,966 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 06:03:28,967 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-08 06:03:28,967 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:28,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 179 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 06:03:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 06:03:29,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:29,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:29,166 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:29,166 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:29,169 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 06:03:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:03:29,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:29,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:29,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-08 06:03:29,175 INFO L87 Difference]: Start difference. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-08 06:03:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:29,178 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 06:03:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:03:29,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:29,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:29,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:29,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:03:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-08 06:03:29,181 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-08 06:03:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:29,181 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-08 06:03:29,182 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-08 06:03:29,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-08 06:03:31,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 182 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:03:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 06:03:31,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:31,481 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-08 06:03:31,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:31,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:31,682 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:31,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-08 06:03:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:31,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [716483671] [2022-04-08 06:03:31,682 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-08 06:03:31,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:31,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778685761] [2022-04-08 06:03:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:31,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:31,695 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:31,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116462266] [2022-04-08 06:03:31,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:31,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:31,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:31,697 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:31,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 06:03:31,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:31,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:31,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:03:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:31,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:32,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-08 06:03:32,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {17163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17171#(<= ~counter~0 0)} {17163#true} #102#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {17171#(<= ~counter~0 0)} call #t~ret9 := main(); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {17171#(<= ~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; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {17171#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,133 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #90#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,133 INFO L272 TraceCheckUtils]: 11: Hoare triple {17171#(<= ~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)); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,134 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #92#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {17171#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:32,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {17171#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:32,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {17220#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:32,136 INFO L272 TraceCheckUtils]: 19: Hoare triple {17220#(<= ~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)); {17220#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:32,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {17220#(<= ~counter~0 1)} ~cond := #in~cond; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:32,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {17220#(<= ~counter~0 1)} assume !(0 == ~cond); {17220#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:32,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {17220#(<= ~counter~0 1)} assume true; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:32,137 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17220#(<= ~counter~0 1)} {17220#(<= ~counter~0 1)} #94#return; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:32,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {17220#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17220#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:32,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {17220#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:32,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {17245#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:32,139 INFO L272 TraceCheckUtils]: 27: Hoare triple {17245#(<= ~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)); {17245#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:32,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {17245#(<= ~counter~0 2)} ~cond := #in~cond; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:32,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {17245#(<= ~counter~0 2)} assume !(0 == ~cond); {17245#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:32,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {17245#(<= ~counter~0 2)} assume true; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:32,140 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17245#(<= ~counter~0 2)} {17245#(<= ~counter~0 2)} #96#return; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:32,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {17245#(<= ~counter~0 2)} assume !(~r~0 > 0); {17245#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:32,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {17245#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:32,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {17270#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:32,142 INFO L272 TraceCheckUtils]: 35: Hoare triple {17270#(<= ~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)); {17270#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:32,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {17270#(<= ~counter~0 3)} ~cond := #in~cond; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:32,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {17270#(<= ~counter~0 3)} assume !(0 == ~cond); {17270#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:32,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {17270#(<= ~counter~0 3)} assume true; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:32,143 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17270#(<= ~counter~0 3)} {17270#(<= ~counter~0 3)} #98#return; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:32,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {17270#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:32,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {17270#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:32,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {17295#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:32,145 INFO L272 TraceCheckUtils]: 43: Hoare triple {17295#(<= ~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)); {17295#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:32,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {17295#(<= ~counter~0 4)} ~cond := #in~cond; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:32,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {17295#(<= ~counter~0 4)} assume !(0 == ~cond); {17295#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:32,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {17295#(<= ~counter~0 4)} assume true; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:32,146 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17295#(<= ~counter~0 4)} {17295#(<= ~counter~0 4)} #98#return; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:32,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {17295#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:32,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {17295#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:32,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {17320#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:32,147 INFO L272 TraceCheckUtils]: 51: Hoare triple {17320#(<= ~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)); {17320#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:32,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {17320#(<= ~counter~0 5)} ~cond := #in~cond; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:32,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {17320#(<= ~counter~0 5)} assume !(0 == ~cond); {17320#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:32,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {17320#(<= ~counter~0 5)} assume true; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:32,149 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17320#(<= ~counter~0 5)} {17320#(<= ~counter~0 5)} #98#return; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:32,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {17320#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:32,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {17320#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:32,150 INFO L290 TraceCheckUtils]: 58: Hoare triple {17345#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:32,150 INFO L272 TraceCheckUtils]: 59: Hoare triple {17345#(<= ~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)); {17345#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:32,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {17345#(<= ~counter~0 6)} ~cond := #in~cond; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:32,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {17345#(<= ~counter~0 6)} assume !(0 == ~cond); {17345#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:32,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {17345#(<= ~counter~0 6)} assume true; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:32,152 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17345#(<= ~counter~0 6)} {17345#(<= ~counter~0 6)} #98#return; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:32,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {17345#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:32,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {17345#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:32,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {17370#(<= ~counter~0 7)} assume !!(#t~post8 < 50);havoc #t~post8; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:32,153 INFO L272 TraceCheckUtils]: 67: Hoare triple {17370#(<= ~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)); {17370#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:32,153 INFO L290 TraceCheckUtils]: 68: Hoare triple {17370#(<= ~counter~0 7)} ~cond := #in~cond; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:32,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {17370#(<= ~counter~0 7)} assume !(0 == ~cond); {17370#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:32,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {17370#(<= ~counter~0 7)} assume true; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:32,154 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17370#(<= ~counter~0 7)} {17370#(<= ~counter~0 7)} #98#return; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:32,155 INFO L290 TraceCheckUtils]: 72: Hoare triple {17370#(<= ~counter~0 7)} assume !(~r~0 < 0); {17370#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:32,155 INFO L290 TraceCheckUtils]: 73: Hoare triple {17370#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17395#(<= |main_#t~post6| 7)} is VALID [2022-04-08 06:03:32,155 INFO L290 TraceCheckUtils]: 74: Hoare triple {17395#(<= |main_#t~post6| 7)} assume !(#t~post6 < 50);havoc #t~post6; {17164#false} is VALID [2022-04-08 06:03:32,156 INFO L272 TraceCheckUtils]: 75: Hoare triple {17164#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)); {17164#false} is VALID [2022-04-08 06:03:32,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-08 06:03:32,156 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-08 06:03:32,156 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-08 06:03:32,156 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-08 06:03:32,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:32,580 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-08 06:03:32,580 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-08 06:03:32,580 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-08 06:03:32,580 INFO L272 TraceCheckUtils]: 75: Hoare triple {17164#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)); {17164#false} is VALID [2022-04-08 06:03:32,580 INFO L290 TraceCheckUtils]: 74: Hoare triple {17423#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {17164#false} is VALID [2022-04-08 06:03:32,581 INFO L290 TraceCheckUtils]: 73: Hoare triple {17427#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17423#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:03:32,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {17427#(< ~counter~0 50)} assume !(~r~0 < 0); {17427#(< ~counter~0 50)} is VALID [2022-04-08 06:03:32,581 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17163#true} {17427#(< ~counter~0 50)} #98#return; {17427#(< ~counter~0 50)} is VALID [2022-04-08 06:03:32,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,582 INFO L272 TraceCheckUtils]: 67: Hoare triple {17427#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 06:03:32,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {17427#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {17427#(< ~counter~0 50)} is VALID [2022-04-08 06:03:32,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {17452#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17427#(< ~counter~0 50)} is VALID [2022-04-08 06:03:32,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {17452#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17452#(< ~counter~0 49)} is VALID [2022-04-08 06:03:32,583 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17163#true} {17452#(< ~counter~0 49)} #98#return; {17452#(< ~counter~0 49)} is VALID [2022-04-08 06:03:32,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,584 INFO L272 TraceCheckUtils]: 59: Hoare triple {17452#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 06:03:32,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {17452#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {17452#(< ~counter~0 49)} is VALID [2022-04-08 06:03:32,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {17477#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17452#(< ~counter~0 49)} is VALID [2022-04-08 06:03:32,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {17477#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17477#(< ~counter~0 48)} is VALID [2022-04-08 06:03:32,585 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17163#true} {17477#(< ~counter~0 48)} #98#return; {17477#(< ~counter~0 48)} is VALID [2022-04-08 06:03:32,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,586 INFO L272 TraceCheckUtils]: 51: Hoare triple {17477#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 06:03:32,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {17477#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {17477#(< ~counter~0 48)} is VALID [2022-04-08 06:03:32,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {17502#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17477#(< ~counter~0 48)} is VALID [2022-04-08 06:03:32,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {17502#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17502#(< ~counter~0 47)} is VALID [2022-04-08 06:03:32,587 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17163#true} {17502#(< ~counter~0 47)} #98#return; {17502#(< ~counter~0 47)} is VALID [2022-04-08 06:03:32,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,587 INFO L272 TraceCheckUtils]: 43: Hoare triple {17502#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 06:03:32,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {17502#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {17502#(< ~counter~0 47)} is VALID [2022-04-08 06:03:32,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {17527#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17502#(< ~counter~0 47)} is VALID [2022-04-08 06:03:32,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {17527#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17527#(< ~counter~0 46)} is VALID [2022-04-08 06:03:32,589 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17163#true} {17527#(< ~counter~0 46)} #98#return; {17527#(< ~counter~0 46)} is VALID [2022-04-08 06:03:32,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,589 INFO L272 TraceCheckUtils]: 35: Hoare triple {17527#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 06:03:32,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {17527#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {17527#(< ~counter~0 46)} is VALID [2022-04-08 06:03:32,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {17552#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17527#(< ~counter~0 46)} is VALID [2022-04-08 06:03:32,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {17552#(< ~counter~0 45)} assume !(~r~0 > 0); {17552#(< ~counter~0 45)} is VALID [2022-04-08 06:03:32,591 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17163#true} {17552#(< ~counter~0 45)} #96#return; {17552#(< ~counter~0 45)} is VALID [2022-04-08 06:03:32,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,591 INFO L272 TraceCheckUtils]: 27: Hoare triple {17552#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 06:03:32,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {17552#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {17552#(< ~counter~0 45)} is VALID [2022-04-08 06:03:32,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {17577#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17552#(< ~counter~0 45)} is VALID [2022-04-08 06:03:32,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {17577#(< ~counter~0 44)} assume !!(0 != ~r~0); {17577#(< ~counter~0 44)} is VALID [2022-04-08 06:03:32,593 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17163#true} {17577#(< ~counter~0 44)} #94#return; {17577#(< ~counter~0 44)} is VALID [2022-04-08 06:03:32,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,593 INFO L272 TraceCheckUtils]: 19: Hoare triple {17577#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 06:03:32,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {17577#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {17577#(< ~counter~0 44)} is VALID [2022-04-08 06:03:32,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {17602#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17577#(< ~counter~0 44)} is VALID [2022-04-08 06:03:32,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {17602#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17602#(< ~counter~0 43)} is VALID [2022-04-08 06:03:32,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17163#true} {17602#(< ~counter~0 43)} #92#return; {17602#(< ~counter~0 43)} is VALID [2022-04-08 06:03:32,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {17602#(< ~counter~0 43)} 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)); {17163#true} is VALID [2022-04-08 06:03:32,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17163#true} {17602#(< ~counter~0 43)} #90#return; {17602#(< ~counter~0 43)} is VALID [2022-04-08 06:03:32,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 06:03:32,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 06:03:32,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 06:03:32,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {17602#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17163#true} is VALID [2022-04-08 06:03:32,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {17602#(< ~counter~0 43)} 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; {17602#(< ~counter~0 43)} is VALID [2022-04-08 06:03:32,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {17602#(< ~counter~0 43)} call #t~ret9 := main(); {17602#(< ~counter~0 43)} is VALID [2022-04-08 06:03:32,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17602#(< ~counter~0 43)} {17163#true} #102#return; {17602#(< ~counter~0 43)} is VALID [2022-04-08 06:03:32,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {17602#(< ~counter~0 43)} assume true; {17602#(< ~counter~0 43)} is VALID [2022-04-08 06:03:32,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {17163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17602#(< ~counter~0 43)} is VALID [2022-04-08 06:03:32,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-08 06:03:32,597 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-08 06:03:32,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:32,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778685761] [2022-04-08 06:03:32,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:32,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116462266] [2022-04-08 06:03:32,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116462266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:32,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:32,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 06:03:32,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:32,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [716483671] [2022-04-08 06:03:32,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [716483671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:32,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:32,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:03:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308846854] [2022-04-08 06:03:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:32,599 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-08 06:03:32,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:32,599 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-08 06:03:32,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:32,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:03:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:03:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:03:32,665 INFO L87 Difference]: Start difference. First operand 146 states and 183 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-08 06:03:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:33,323 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-08 06:03:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:03:33,323 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-08 06:03:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:33,323 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-08 06:03:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 06:03:33,325 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-08 06:03:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 06:03:33,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-08 06:03:33,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:33,444 INFO L225 Difference]: With dead ends: 168 [2022-04-08 06:03:33,444 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 06:03:33,445 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-08 06:03:33,445 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:33,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 221 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:03:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 06:03:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-08 06:03:33,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:33,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:33,612 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:33,612 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:33,616 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 06:03:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 06:03:33,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:33,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:33,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-08 06:03:33,617 INFO L87 Difference]: Start difference. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-08 06:03:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:33,619 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 06:03:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 06:03:33,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:33,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:33,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:33,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-08 06:03:33,624 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-08 06:03:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:33,624 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-08 06:03:33,624 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-08 06:03:33,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-08 06:03:35,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 197 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-08 06:03:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 06:03:35,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:35,948 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-08 06:03:35,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:36,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:36,155 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-08 06:03:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:36,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2026914303] [2022-04-08 06:03:36,156 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-08 06:03:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:36,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524654902] [2022-04-08 06:03:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:36,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:36,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558828844] [2022-04-08 06:03:36,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:36,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:36,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:36,179 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:36,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 06:03:36,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:36,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:36,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:03:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:36,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:36,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-08 06:03:36,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {18640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18648#(<= ~counter~0 0)} {18640#true} #102#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {18648#(<= ~counter~0 0)} call #t~ret9 := main(); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {18648#(<= ~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; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,619 INFO L272 TraceCheckUtils]: 6: Hoare triple {18648#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,620 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #90#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,621 INFO L272 TraceCheckUtils]: 11: Hoare triple {18648#(<= ~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)); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,622 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #92#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {18648#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:36,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {18648#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:36,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {18697#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:36,624 INFO L272 TraceCheckUtils]: 19: Hoare triple {18697#(<= ~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)); {18697#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:36,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {18697#(<= ~counter~0 1)} ~cond := #in~cond; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:36,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {18697#(<= ~counter~0 1)} assume !(0 == ~cond); {18697#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:36,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {18697#(<= ~counter~0 1)} assume true; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:36,625 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18697#(<= ~counter~0 1)} {18697#(<= ~counter~0 1)} #94#return; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:36,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {18697#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18697#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:36,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {18697#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:36,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {18722#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:36,626 INFO L272 TraceCheckUtils]: 27: Hoare triple {18722#(<= ~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)); {18722#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:36,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {18722#(<= ~counter~0 2)} ~cond := #in~cond; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:36,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {18722#(<= ~counter~0 2)} assume !(0 == ~cond); {18722#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:36,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {18722#(<= ~counter~0 2)} assume true; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:36,628 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18722#(<= ~counter~0 2)} {18722#(<= ~counter~0 2)} #96#return; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:36,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {18722#(<= ~counter~0 2)} assume !(~r~0 > 0); {18722#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:36,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {18722#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:36,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {18747#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:36,629 INFO L272 TraceCheckUtils]: 35: Hoare triple {18747#(<= ~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)); {18747#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:36,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {18747#(<= ~counter~0 3)} ~cond := #in~cond; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:36,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {18747#(<= ~counter~0 3)} assume !(0 == ~cond); {18747#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:36,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {18747#(<= ~counter~0 3)} assume true; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:36,630 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18747#(<= ~counter~0 3)} {18747#(<= ~counter~0 3)} #98#return; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:36,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {18747#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:36,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {18747#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:36,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {18772#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:36,632 INFO L272 TraceCheckUtils]: 43: Hoare triple {18772#(<= ~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)); {18772#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:36,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {18772#(<= ~counter~0 4)} ~cond := #in~cond; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:36,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {18772#(<= ~counter~0 4)} assume !(0 == ~cond); {18772#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:36,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {18772#(<= ~counter~0 4)} assume true; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:36,633 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18772#(<= ~counter~0 4)} {18772#(<= ~counter~0 4)} #98#return; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:36,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {18772#(<= ~counter~0 4)} assume !(~r~0 < 0); {18772#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:36,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {18772#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:36,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {18797#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:36,635 INFO L272 TraceCheckUtils]: 51: Hoare triple {18797#(<= ~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)); {18797#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:36,635 INFO L290 TraceCheckUtils]: 52: Hoare triple {18797#(<= ~counter~0 5)} ~cond := #in~cond; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:36,635 INFO L290 TraceCheckUtils]: 53: Hoare triple {18797#(<= ~counter~0 5)} assume !(0 == ~cond); {18797#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:36,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {18797#(<= ~counter~0 5)} assume true; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:36,636 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18797#(<= ~counter~0 5)} {18797#(<= ~counter~0 5)} #94#return; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:36,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {18797#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18797#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:36,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {18797#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:36,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {18822#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:36,638 INFO L272 TraceCheckUtils]: 59: Hoare triple {18822#(<= ~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)); {18822#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:36,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {18822#(<= ~counter~0 6)} ~cond := #in~cond; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:36,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {18822#(<= ~counter~0 6)} assume !(0 == ~cond); {18822#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:36,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {18822#(<= ~counter~0 6)} assume true; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:36,639 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18822#(<= ~counter~0 6)} {18822#(<= ~counter~0 6)} #96#return; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:36,639 INFO L290 TraceCheckUtils]: 64: Hoare triple {18822#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:36,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {18822#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:36,640 INFO L290 TraceCheckUtils]: 66: Hoare triple {18847#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:36,640 INFO L272 TraceCheckUtils]: 67: Hoare triple {18847#(<= ~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)); {18847#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:36,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {18847#(<= ~counter~0 7)} ~cond := #in~cond; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:36,641 INFO L290 TraceCheckUtils]: 69: Hoare triple {18847#(<= ~counter~0 7)} assume !(0 == ~cond); {18847#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:36,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {18847#(<= ~counter~0 7)} assume true; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:36,642 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18847#(<= ~counter~0 7)} {18847#(<= ~counter~0 7)} #96#return; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:36,642 INFO L290 TraceCheckUtils]: 72: Hoare triple {18847#(<= ~counter~0 7)} assume !(~r~0 > 0); {18847#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:36,642 INFO L290 TraceCheckUtils]: 73: Hoare triple {18847#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18872#(<= |main_#t~post8| 7)} is VALID [2022-04-08 06:03:36,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {18872#(<= |main_#t~post8| 7)} assume !(#t~post8 < 50);havoc #t~post8; {18641#false} is VALID [2022-04-08 06:03:36,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-08 06:03:36,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 50);havoc #t~post6; {18641#false} is VALID [2022-04-08 06:03:36,643 INFO L272 TraceCheckUtils]: 77: Hoare triple {18641#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)); {18641#false} is VALID [2022-04-08 06:03:36,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-08 06:03:36,643 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-08 06:03:36,643 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-08 06:03:36,643 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-08 06:03:36,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:37,053 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-08 06:03:37,053 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-08 06:03:37,053 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-08 06:03:37,053 INFO L272 TraceCheckUtils]: 77: Hoare triple {18641#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)); {18641#false} is VALID [2022-04-08 06:03:37,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 50);havoc #t~post6; {18641#false} is VALID [2022-04-08 06:03:37,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-08 06:03:37,054 INFO L290 TraceCheckUtils]: 74: Hoare triple {18912#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {18641#false} is VALID [2022-04-08 06:03:37,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {18916#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18912#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:03:37,054 INFO L290 TraceCheckUtils]: 72: Hoare triple {18916#(< ~counter~0 50)} assume !(~r~0 > 0); {18916#(< ~counter~0 50)} is VALID [2022-04-08 06:03:37,055 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18640#true} {18916#(< ~counter~0 50)} #96#return; {18916#(< ~counter~0 50)} is VALID [2022-04-08 06:03:37,055 INFO L290 TraceCheckUtils]: 70: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,055 INFO L290 TraceCheckUtils]: 69: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,055 INFO L290 TraceCheckUtils]: 68: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,055 INFO L272 TraceCheckUtils]: 67: Hoare triple {18916#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 06:03:37,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {18916#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {18916#(< ~counter~0 50)} is VALID [2022-04-08 06:03:37,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {18941#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18916#(< ~counter~0 50)} is VALID [2022-04-08 06:03:37,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {18941#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18941#(< ~counter~0 49)} is VALID [2022-04-08 06:03:37,057 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18640#true} {18941#(< ~counter~0 49)} #96#return; {18941#(< ~counter~0 49)} is VALID [2022-04-08 06:03:37,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,057 INFO L272 TraceCheckUtils]: 59: Hoare triple {18941#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 06:03:37,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {18941#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {18941#(< ~counter~0 49)} is VALID [2022-04-08 06:03:37,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {18966#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18941#(< ~counter~0 49)} is VALID [2022-04-08 06:03:37,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {18966#(< ~counter~0 48)} assume !!(0 != ~r~0); {18966#(< ~counter~0 48)} is VALID [2022-04-08 06:03:37,059 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18640#true} {18966#(< ~counter~0 48)} #94#return; {18966#(< ~counter~0 48)} is VALID [2022-04-08 06:03:37,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,059 INFO L272 TraceCheckUtils]: 51: Hoare triple {18966#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 06:03:37,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {18966#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {18966#(< ~counter~0 48)} is VALID [2022-04-08 06:03:37,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {18991#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18966#(< ~counter~0 48)} is VALID [2022-04-08 06:03:37,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {18991#(< ~counter~0 47)} assume !(~r~0 < 0); {18991#(< ~counter~0 47)} is VALID [2022-04-08 06:03:37,061 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18640#true} {18991#(< ~counter~0 47)} #98#return; {18991#(< ~counter~0 47)} is VALID [2022-04-08 06:03:37,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,061 INFO L272 TraceCheckUtils]: 43: Hoare triple {18991#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 06:03:37,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {18991#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {18991#(< ~counter~0 47)} is VALID [2022-04-08 06:03:37,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {19016#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18991#(< ~counter~0 47)} is VALID [2022-04-08 06:03:37,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {19016#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19016#(< ~counter~0 46)} is VALID [2022-04-08 06:03:37,062 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18640#true} {19016#(< ~counter~0 46)} #98#return; {19016#(< ~counter~0 46)} is VALID [2022-04-08 06:03:37,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,063 INFO L272 TraceCheckUtils]: 35: Hoare triple {19016#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 06:03:37,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {19016#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {19016#(< ~counter~0 46)} is VALID [2022-04-08 06:03:37,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {19041#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19016#(< ~counter~0 46)} is VALID [2022-04-08 06:03:37,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {19041#(< ~counter~0 45)} assume !(~r~0 > 0); {19041#(< ~counter~0 45)} is VALID [2022-04-08 06:03:37,064 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18640#true} {19041#(< ~counter~0 45)} #96#return; {19041#(< ~counter~0 45)} is VALID [2022-04-08 06:03:37,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,065 INFO L272 TraceCheckUtils]: 27: Hoare triple {19041#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 06:03:37,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {19041#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {19041#(< ~counter~0 45)} is VALID [2022-04-08 06:03:37,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {19066#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19041#(< ~counter~0 45)} is VALID [2022-04-08 06:03:37,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {19066#(< ~counter~0 44)} assume !!(0 != ~r~0); {19066#(< ~counter~0 44)} is VALID [2022-04-08 06:03:37,066 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18640#true} {19066#(< ~counter~0 44)} #94#return; {19066#(< ~counter~0 44)} is VALID [2022-04-08 06:03:37,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,066 INFO L272 TraceCheckUtils]: 19: Hoare triple {19066#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 06:03:37,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {19066#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {19066#(< ~counter~0 44)} is VALID [2022-04-08 06:03:37,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {19091#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19066#(< ~counter~0 44)} is VALID [2022-04-08 06:03:37,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {19091#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19091#(< ~counter~0 43)} is VALID [2022-04-08 06:03:37,068 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18640#true} {19091#(< ~counter~0 43)} #92#return; {19091#(< ~counter~0 43)} is VALID [2022-04-08 06:03:37,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {19091#(< ~counter~0 43)} 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)); {18640#true} is VALID [2022-04-08 06:03:37,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18640#true} {19091#(< ~counter~0 43)} #90#return; {19091#(< ~counter~0 43)} is VALID [2022-04-08 06:03:37,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 06:03:37,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 06:03:37,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 06:03:37,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {19091#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18640#true} is VALID [2022-04-08 06:03:37,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {19091#(< ~counter~0 43)} 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; {19091#(< ~counter~0 43)} is VALID [2022-04-08 06:03:37,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {19091#(< ~counter~0 43)} call #t~ret9 := main(); {19091#(< ~counter~0 43)} is VALID [2022-04-08 06:03:37,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19091#(< ~counter~0 43)} {18640#true} #102#return; {19091#(< ~counter~0 43)} is VALID [2022-04-08 06:03:37,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {19091#(< ~counter~0 43)} assume true; {19091#(< ~counter~0 43)} is VALID [2022-04-08 06:03:37,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {18640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19091#(< ~counter~0 43)} is VALID [2022-04-08 06:03:37,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-08 06:03:37,071 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-08 06:03:37,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:37,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524654902] [2022-04-08 06:03:37,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:37,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558828844] [2022-04-08 06:03:37,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558828844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:37,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:37,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 06:03:37,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:37,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2026914303] [2022-04-08 06:03:37,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2026914303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:37,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:37,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:03:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690662577] [2022-04-08 06:03:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:37,072 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-08 06:03:37,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:37,072 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-08 06:03:37,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:37,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:03:37,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:37,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:03:37,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:03:37,126 INFO L87 Difference]: Start difference. First operand 157 states and 198 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-08 06:03:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:37,683 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-08 06:03:37,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 06:03:37,683 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-08 06:03:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:37,683 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-08 06:03:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 06:03:37,685 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-08 06:03:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 06:03:37,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-08 06:03:37,820 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-08 06:03:37,822 INFO L225 Difference]: With dead ends: 213 [2022-04-08 06:03:37,822 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 06:03:37,822 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-08 06:03:37,822 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:37,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 193 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 06:03:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-08 06:03:38,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:38,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:38,009 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:38,009 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:38,011 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 06:03:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 06:03:38,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:38,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:38,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-08 06:03:38,013 INFO L87 Difference]: Start difference. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-08 06:03:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:38,016 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 06:03:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 06:03:38,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:38,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:38,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:38,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-08 06:03:38,020 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-08 06:03:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:38,020 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-08 06:03:38,020 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-08 06:03:38,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-08 06:03:38,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 06:03:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 06:03:38,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:38,870 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-08 06:03:38,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:39,070 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:39,070 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-08 06:03:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:39,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018586981] [2022-04-08 06:03:39,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-08 06:03:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:39,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398872263] [2022-04-08 06:03:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:39,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:39,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654215047] [2022-04-08 06:03:39,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:03:39,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:39,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:39,088 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:39,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 06:03:39,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:03:39,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:39,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:03:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:39,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:39,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-08 06:03:39,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {20229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20237#(<= ~counter~0 0)} {20229#true} #102#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {20237#(<= ~counter~0 0)} call #t~ret9 := main(); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {20237#(<= ~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; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {20237#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #90#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,705 INFO L272 TraceCheckUtils]: 11: Hoare triple {20237#(<= ~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)); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,706 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #92#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {20237#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:39,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {20237#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:39,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {20286#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:39,708 INFO L272 TraceCheckUtils]: 19: Hoare triple {20286#(<= ~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)); {20286#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:39,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {20286#(<= ~counter~0 1)} ~cond := #in~cond; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:39,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {20286#(<= ~counter~0 1)} assume !(0 == ~cond); {20286#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:39,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {20286#(<= ~counter~0 1)} assume true; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:39,709 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20286#(<= ~counter~0 1)} {20286#(<= ~counter~0 1)} #94#return; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:39,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {20286#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20286#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:39,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {20286#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:39,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {20311#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:39,711 INFO L272 TraceCheckUtils]: 27: Hoare triple {20311#(<= ~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)); {20311#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:39,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {20311#(<= ~counter~0 2)} ~cond := #in~cond; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:39,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {20311#(<= ~counter~0 2)} assume !(0 == ~cond); {20311#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:39,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {20311#(<= ~counter~0 2)} assume true; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:39,712 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20311#(<= ~counter~0 2)} {20311#(<= ~counter~0 2)} #96#return; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:39,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {20311#(<= ~counter~0 2)} assume !(~r~0 > 0); {20311#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:39,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {20311#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:39,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {20336#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:39,714 INFO L272 TraceCheckUtils]: 35: Hoare triple {20336#(<= ~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)); {20336#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:39,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {20336#(<= ~counter~0 3)} ~cond := #in~cond; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:39,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {20336#(<= ~counter~0 3)} assume !(0 == ~cond); {20336#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:39,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {20336#(<= ~counter~0 3)} assume true; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:39,715 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20336#(<= ~counter~0 3)} {20336#(<= ~counter~0 3)} #98#return; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:39,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {20336#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:39,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {20336#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:39,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {20361#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:39,717 INFO L272 TraceCheckUtils]: 43: Hoare triple {20361#(<= ~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)); {20361#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:39,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {20361#(<= ~counter~0 4)} ~cond := #in~cond; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:39,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {20361#(<= ~counter~0 4)} assume !(0 == ~cond); {20361#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:39,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {20361#(<= ~counter~0 4)} assume true; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:39,718 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20361#(<= ~counter~0 4)} {20361#(<= ~counter~0 4)} #98#return; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:39,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {20361#(<= ~counter~0 4)} assume !(~r~0 < 0); {20361#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:39,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {20361#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:39,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {20386#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:39,720 INFO L272 TraceCheckUtils]: 51: Hoare triple {20386#(<= ~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)); {20386#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:39,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {20386#(<= ~counter~0 5)} ~cond := #in~cond; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:39,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {20386#(<= ~counter~0 5)} assume !(0 == ~cond); {20386#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:39,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {20386#(<= ~counter~0 5)} assume true; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:39,721 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20386#(<= ~counter~0 5)} {20386#(<= ~counter~0 5)} #94#return; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:39,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {20386#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20386#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:39,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {20386#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:39,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {20411#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:39,723 INFO L272 TraceCheckUtils]: 59: Hoare triple {20411#(<= ~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)); {20411#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:39,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {20411#(<= ~counter~0 6)} ~cond := #in~cond; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:39,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {20411#(<= ~counter~0 6)} assume !(0 == ~cond); {20411#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:39,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {20411#(<= ~counter~0 6)} assume true; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:39,724 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20411#(<= ~counter~0 6)} {20411#(<= ~counter~0 6)} #96#return; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:39,724 INFO L290 TraceCheckUtils]: 64: Hoare triple {20411#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:39,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {20411#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:39,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {20436#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:39,725 INFO L272 TraceCheckUtils]: 67: Hoare triple {20436#(<= ~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)); {20436#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:39,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {20436#(<= ~counter~0 7)} ~cond := #in~cond; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:39,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {20436#(<= ~counter~0 7)} assume !(0 == ~cond); {20436#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:39,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {20436#(<= ~counter~0 7)} assume true; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:39,727 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20436#(<= ~counter~0 7)} {20436#(<= ~counter~0 7)} #96#return; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:39,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {20436#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:39,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {20436#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20461#(<= |main_#t~post7| 7)} is VALID [2022-04-08 06:03:39,728 INFO L290 TraceCheckUtils]: 74: Hoare triple {20461#(<= |main_#t~post7| 7)} assume !(#t~post7 < 50);havoc #t~post7; {20230#false} is VALID [2022-04-08 06:03:39,728 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-08 06:03:39,728 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 50);havoc #t~post8; {20230#false} is VALID [2022-04-08 06:03:39,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-08 06:03:39,728 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 50);havoc #t~post6; {20230#false} is VALID [2022-04-08 06:03:39,728 INFO L272 TraceCheckUtils]: 79: Hoare triple {20230#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)); {20230#false} is VALID [2022-04-08 06:03:39,728 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-08 06:03:39,728 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-08 06:03:39,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-08 06:03:39,729 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-08 06:03:39,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:40,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-08 06:03:40,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-08 06:03:40,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-08 06:03:40,162 INFO L272 TraceCheckUtils]: 79: Hoare triple {20230#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)); {20230#false} is VALID [2022-04-08 06:03:40,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 50);havoc #t~post6; {20230#false} is VALID [2022-04-08 06:03:40,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-08 06:03:40,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 50);havoc #t~post8; {20230#false} is VALID [2022-04-08 06:03:40,163 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-08 06:03:40,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {20513#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {20230#false} is VALID [2022-04-08 06:03:40,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {20517#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20513#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:03:40,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {20517#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20517#(< ~counter~0 50)} is VALID [2022-04-08 06:03:40,165 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20229#true} {20517#(< ~counter~0 50)} #96#return; {20517#(< ~counter~0 50)} is VALID [2022-04-08 06:03:40,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,165 INFO L272 TraceCheckUtils]: 67: Hoare triple {20517#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 06:03:40,165 INFO L290 TraceCheckUtils]: 66: Hoare triple {20517#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {20517#(< ~counter~0 50)} is VALID [2022-04-08 06:03:40,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {20542#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20517#(< ~counter~0 50)} is VALID [2022-04-08 06:03:40,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {20542#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20542#(< ~counter~0 49)} is VALID [2022-04-08 06:03:40,167 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20229#true} {20542#(< ~counter~0 49)} #96#return; {20542#(< ~counter~0 49)} is VALID [2022-04-08 06:03:40,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,168 INFO L272 TraceCheckUtils]: 59: Hoare triple {20542#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 06:03:40,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {20542#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {20542#(< ~counter~0 49)} is VALID [2022-04-08 06:03:40,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {20567#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20542#(< ~counter~0 49)} is VALID [2022-04-08 06:03:40,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {20567#(< ~counter~0 48)} assume !!(0 != ~r~0); {20567#(< ~counter~0 48)} is VALID [2022-04-08 06:03:40,170 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20229#true} {20567#(< ~counter~0 48)} #94#return; {20567#(< ~counter~0 48)} is VALID [2022-04-08 06:03:40,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,170 INFO L272 TraceCheckUtils]: 51: Hoare triple {20567#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 06:03:40,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {20567#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {20567#(< ~counter~0 48)} is VALID [2022-04-08 06:03:40,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {20592#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20567#(< ~counter~0 48)} is VALID [2022-04-08 06:03:40,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {20592#(< ~counter~0 47)} assume !(~r~0 < 0); {20592#(< ~counter~0 47)} is VALID [2022-04-08 06:03:40,173 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20229#true} {20592#(< ~counter~0 47)} #98#return; {20592#(< ~counter~0 47)} is VALID [2022-04-08 06:03:40,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,173 INFO L272 TraceCheckUtils]: 43: Hoare triple {20592#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 06:03:40,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {20592#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {20592#(< ~counter~0 47)} is VALID [2022-04-08 06:03:40,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {20617#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20592#(< ~counter~0 47)} is VALID [2022-04-08 06:03:40,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {20617#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20617#(< ~counter~0 46)} is VALID [2022-04-08 06:03:40,175 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20229#true} {20617#(< ~counter~0 46)} #98#return; {20617#(< ~counter~0 46)} is VALID [2022-04-08 06:03:40,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,176 INFO L272 TraceCheckUtils]: 35: Hoare triple {20617#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 06:03:40,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {20617#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {20617#(< ~counter~0 46)} is VALID [2022-04-08 06:03:40,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {20642#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20617#(< ~counter~0 46)} is VALID [2022-04-08 06:03:40,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {20642#(< ~counter~0 45)} assume !(~r~0 > 0); {20642#(< ~counter~0 45)} is VALID [2022-04-08 06:03:40,178 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20229#true} {20642#(< ~counter~0 45)} #96#return; {20642#(< ~counter~0 45)} is VALID [2022-04-08 06:03:40,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,178 INFO L272 TraceCheckUtils]: 27: Hoare triple {20642#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 06:03:40,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {20642#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {20642#(< ~counter~0 45)} is VALID [2022-04-08 06:03:40,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {20667#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20642#(< ~counter~0 45)} is VALID [2022-04-08 06:03:40,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {20667#(< ~counter~0 44)} assume !!(0 != ~r~0); {20667#(< ~counter~0 44)} is VALID [2022-04-08 06:03:40,180 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20229#true} {20667#(< ~counter~0 44)} #94#return; {20667#(< ~counter~0 44)} is VALID [2022-04-08 06:03:40,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,181 INFO L272 TraceCheckUtils]: 19: Hoare triple {20667#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 06:03:40,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {20667#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {20667#(< ~counter~0 44)} is VALID [2022-04-08 06:03:40,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {20692#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20667#(< ~counter~0 44)} is VALID [2022-04-08 06:03:40,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {20692#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20692#(< ~counter~0 43)} is VALID [2022-04-08 06:03:40,182 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20229#true} {20692#(< ~counter~0 43)} #92#return; {20692#(< ~counter~0 43)} is VALID [2022-04-08 06:03:40,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,183 INFO L272 TraceCheckUtils]: 11: Hoare triple {20692#(< ~counter~0 43)} 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)); {20229#true} is VALID [2022-04-08 06:03:40,183 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20229#true} {20692#(< ~counter~0 43)} #90#return; {20692#(< ~counter~0 43)} is VALID [2022-04-08 06:03:40,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 06:03:40,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 06:03:40,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 06:03:40,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {20692#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20229#true} is VALID [2022-04-08 06:03:40,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {20692#(< ~counter~0 43)} 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; {20692#(< ~counter~0 43)} is VALID [2022-04-08 06:03:40,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {20692#(< ~counter~0 43)} call #t~ret9 := main(); {20692#(< ~counter~0 43)} is VALID [2022-04-08 06:03:40,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20692#(< ~counter~0 43)} {20229#true} #102#return; {20692#(< ~counter~0 43)} is VALID [2022-04-08 06:03:40,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {20692#(< ~counter~0 43)} assume true; {20692#(< ~counter~0 43)} is VALID [2022-04-08 06:03:40,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {20229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20692#(< ~counter~0 43)} is VALID [2022-04-08 06:03:40,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-08 06:03:40,186 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-08 06:03:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:40,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398872263] [2022-04-08 06:03:40,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:40,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654215047] [2022-04-08 06:03:40,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654215047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:40,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:40,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 06:03:40,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:40,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018586981] [2022-04-08 06:03:40,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018586981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:40,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:40,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:03:40,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008794472] [2022-04-08 06:03:40,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:40,188 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-08 06:03:40,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:40,188 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-08 06:03:40,248 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-08 06:03:40,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:03:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:03:40,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:03:40,249 INFO L87 Difference]: Start difference. First operand 160 states and 202 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-08 06:03:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:40,939 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-08 06:03:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 06:03:40,939 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-08 06:03:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:40,939 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-08 06:03:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 06:03:40,941 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-08 06:03:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 06:03:40,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-08 06:03:41,080 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-08 06:03:41,082 INFO L225 Difference]: With dead ends: 215 [2022-04-08 06:03:41,082 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 06:03:41,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:03:41,083 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 67 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:41,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 215 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 06:03:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-08 06:03:41,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:41,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:41,262 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:41,262 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:41,265 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 06:03:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:03:41,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:41,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:41,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-08 06:03:41,265 INFO L87 Difference]: Start difference. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-08 06:03:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:41,268 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 06:03:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:03:41,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:41,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:41,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:41,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:03:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-08 06:03:41,272 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-08 06:03:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:41,273 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-08 06:03:41,273 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-08 06:03:41,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-08 06:03:43,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:03:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 06:03:43,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:43,090 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-08 06:03:43,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 06:03:43,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:43,291 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-08 06:03:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:43,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373351715] [2022-04-08 06:03:43,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-08 06:03:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:43,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910911276] [2022-04-08 06:03:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:43,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:43,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395504480] [2022-04-08 06:03:43,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:43,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:43,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:43,304 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:43,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 06:03:43,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:43,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:43,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 06:03:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:43,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:43,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-08 06:03:43,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {21852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21860#(<= ~counter~0 0)} {21852#true} #102#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {21860#(<= ~counter~0 0)} call #t~ret9 := main(); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {21860#(<= ~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; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {21860#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,794 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #90#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,794 INFO L272 TraceCheckUtils]: 11: Hoare triple {21860#(<= ~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)); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #92#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {21860#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:43,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {21860#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:43,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {21909#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:43,797 INFO L272 TraceCheckUtils]: 19: Hoare triple {21909#(<= ~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)); {21909#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:43,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {21909#(<= ~counter~0 1)} ~cond := #in~cond; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:43,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {21909#(<= ~counter~0 1)} assume !(0 == ~cond); {21909#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:43,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {21909#(<= ~counter~0 1)} assume true; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:43,799 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21909#(<= ~counter~0 1)} {21909#(<= ~counter~0 1)} #94#return; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:43,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {21909#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21909#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:43,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {21909#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:43,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {21934#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:43,801 INFO L272 TraceCheckUtils]: 27: Hoare triple {21934#(<= ~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)); {21934#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:43,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {21934#(<= ~counter~0 2)} ~cond := #in~cond; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:43,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {21934#(<= ~counter~0 2)} assume !(0 == ~cond); {21934#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:43,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {21934#(<= ~counter~0 2)} assume true; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:43,803 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21934#(<= ~counter~0 2)} {21934#(<= ~counter~0 2)} #96#return; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:43,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {21934#(<= ~counter~0 2)} assume !(~r~0 > 0); {21934#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:43,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {21934#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:43,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {21959#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:43,805 INFO L272 TraceCheckUtils]: 35: Hoare triple {21959#(<= ~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)); {21959#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:43,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {21959#(<= ~counter~0 3)} ~cond := #in~cond; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:43,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {21959#(<= ~counter~0 3)} assume !(0 == ~cond); {21959#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:43,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {21959#(<= ~counter~0 3)} assume true; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:43,806 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21959#(<= ~counter~0 3)} {21959#(<= ~counter~0 3)} #98#return; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:43,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {21959#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:43,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {21959#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:43,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {21984#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:43,808 INFO L272 TraceCheckUtils]: 43: Hoare triple {21984#(<= ~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)); {21984#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:43,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {21984#(<= ~counter~0 4)} ~cond := #in~cond; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:43,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {21984#(<= ~counter~0 4)} assume !(0 == ~cond); {21984#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:43,809 INFO L290 TraceCheckUtils]: 46: Hoare triple {21984#(<= ~counter~0 4)} assume true; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:43,809 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21984#(<= ~counter~0 4)} {21984#(<= ~counter~0 4)} #98#return; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:43,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {21984#(<= ~counter~0 4)} assume !(~r~0 < 0); {21984#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:43,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {21984#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:43,810 INFO L290 TraceCheckUtils]: 50: Hoare triple {22009#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:43,811 INFO L272 TraceCheckUtils]: 51: Hoare triple {22009#(<= ~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)); {22009#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:43,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {22009#(<= ~counter~0 5)} ~cond := #in~cond; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:43,811 INFO L290 TraceCheckUtils]: 53: Hoare triple {22009#(<= ~counter~0 5)} assume !(0 == ~cond); {22009#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:43,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {22009#(<= ~counter~0 5)} assume true; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:43,812 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22009#(<= ~counter~0 5)} {22009#(<= ~counter~0 5)} #94#return; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:43,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {22009#(<= ~counter~0 5)} assume !!(0 != ~r~0); {22009#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:43,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {22009#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:43,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {22034#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:43,814 INFO L272 TraceCheckUtils]: 59: Hoare triple {22034#(<= ~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)); {22034#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:43,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {22034#(<= ~counter~0 6)} ~cond := #in~cond; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:43,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {22034#(<= ~counter~0 6)} assume !(0 == ~cond); {22034#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:43,815 INFO L290 TraceCheckUtils]: 62: Hoare triple {22034#(<= ~counter~0 6)} assume true; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:43,815 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22034#(<= ~counter~0 6)} {22034#(<= ~counter~0 6)} #96#return; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:43,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {22034#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:43,816 INFO L290 TraceCheckUtils]: 65: Hoare triple {22034#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:43,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {22059#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:43,817 INFO L272 TraceCheckUtils]: 67: Hoare triple {22059#(<= ~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)); {22059#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:43,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {22059#(<= ~counter~0 7)} ~cond := #in~cond; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:43,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {22059#(<= ~counter~0 7)} assume !(0 == ~cond); {22059#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:43,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {22059#(<= ~counter~0 7)} assume true; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:43,818 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22059#(<= ~counter~0 7)} {22059#(<= ~counter~0 7)} #96#return; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:43,818 INFO L290 TraceCheckUtils]: 72: Hoare triple {22059#(<= ~counter~0 7)} assume !(~r~0 > 0); {22059#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:43,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {22059#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:43,819 INFO L290 TraceCheckUtils]: 74: Hoare triple {22084#(<= ~counter~0 8)} assume !!(#t~post8 < 50);havoc #t~post8; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:43,820 INFO L272 TraceCheckUtils]: 75: Hoare triple {22084#(<= ~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)); {22084#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:43,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {22084#(<= ~counter~0 8)} ~cond := #in~cond; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:43,821 INFO L290 TraceCheckUtils]: 77: Hoare triple {22084#(<= ~counter~0 8)} assume !(0 == ~cond); {22084#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:43,821 INFO L290 TraceCheckUtils]: 78: Hoare triple {22084#(<= ~counter~0 8)} assume true; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:43,821 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22084#(<= ~counter~0 8)} {22084#(<= ~counter~0 8)} #98#return; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:43,822 INFO L290 TraceCheckUtils]: 80: Hoare triple {22084#(<= ~counter~0 8)} assume !(~r~0 < 0); {22084#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:43,822 INFO L290 TraceCheckUtils]: 81: Hoare triple {22084#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22109#(<= |main_#t~post6| 8)} is VALID [2022-04-08 06:03:43,822 INFO L290 TraceCheckUtils]: 82: Hoare triple {22109#(<= |main_#t~post6| 8)} assume !(#t~post6 < 50);havoc #t~post6; {21853#false} is VALID [2022-04-08 06:03:43,823 INFO L272 TraceCheckUtils]: 83: Hoare triple {21853#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)); {21853#false} is VALID [2022-04-08 06:03:43,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-08 06:03:43,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-08 06:03:43,823 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-08 06:03:43,823 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-08 06:03:43,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:44,287 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-08 06:03:44,287 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-08 06:03:44,287 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-08 06:03:44,287 INFO L272 TraceCheckUtils]: 83: Hoare triple {21853#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)); {21853#false} is VALID [2022-04-08 06:03:44,288 INFO L290 TraceCheckUtils]: 82: Hoare triple {22137#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {21853#false} is VALID [2022-04-08 06:03:44,288 INFO L290 TraceCheckUtils]: 81: Hoare triple {22141#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22137#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:03:44,288 INFO L290 TraceCheckUtils]: 80: Hoare triple {22141#(< ~counter~0 50)} assume !(~r~0 < 0); {22141#(< ~counter~0 50)} is VALID [2022-04-08 06:03:44,289 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21852#true} {22141#(< ~counter~0 50)} #98#return; {22141#(< ~counter~0 50)} is VALID [2022-04-08 06:03:44,289 INFO L290 TraceCheckUtils]: 78: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,289 INFO L290 TraceCheckUtils]: 77: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,289 INFO L290 TraceCheckUtils]: 76: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,289 INFO L272 TraceCheckUtils]: 75: Hoare triple {22141#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {22141#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {22141#(< ~counter~0 50)} is VALID [2022-04-08 06:03:44,290 INFO L290 TraceCheckUtils]: 73: Hoare triple {22166#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22141#(< ~counter~0 50)} is VALID [2022-04-08 06:03:44,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {22166#(< ~counter~0 49)} assume !(~r~0 > 0); {22166#(< ~counter~0 49)} is VALID [2022-04-08 06:03:44,291 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21852#true} {22166#(< ~counter~0 49)} #96#return; {22166#(< ~counter~0 49)} is VALID [2022-04-08 06:03:44,291 INFO L290 TraceCheckUtils]: 70: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,291 INFO L290 TraceCheckUtils]: 69: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,291 INFO L290 TraceCheckUtils]: 68: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,291 INFO L272 TraceCheckUtils]: 67: Hoare triple {22166#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,292 INFO L290 TraceCheckUtils]: 66: Hoare triple {22166#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {22166#(< ~counter~0 49)} is VALID [2022-04-08 06:03:44,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {22191#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22166#(< ~counter~0 49)} is VALID [2022-04-08 06:03:44,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {22191#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22191#(< ~counter~0 48)} is VALID [2022-04-08 06:03:44,293 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21852#true} {22191#(< ~counter~0 48)} #96#return; {22191#(< ~counter~0 48)} is VALID [2022-04-08 06:03:44,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,293 INFO L272 TraceCheckUtils]: 59: Hoare triple {22191#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {22191#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {22191#(< ~counter~0 48)} is VALID [2022-04-08 06:03:44,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {22216#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22191#(< ~counter~0 48)} is VALID [2022-04-08 06:03:44,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {22216#(< ~counter~0 47)} assume !!(0 != ~r~0); {22216#(< ~counter~0 47)} is VALID [2022-04-08 06:03:44,295 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21852#true} {22216#(< ~counter~0 47)} #94#return; {22216#(< ~counter~0 47)} is VALID [2022-04-08 06:03:44,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,295 INFO L272 TraceCheckUtils]: 51: Hoare triple {22216#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {22216#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {22216#(< ~counter~0 47)} is VALID [2022-04-08 06:03:44,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {22241#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22216#(< ~counter~0 47)} is VALID [2022-04-08 06:03:44,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {22241#(< ~counter~0 46)} assume !(~r~0 < 0); {22241#(< ~counter~0 46)} is VALID [2022-04-08 06:03:44,297 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21852#true} {22241#(< ~counter~0 46)} #98#return; {22241#(< ~counter~0 46)} is VALID [2022-04-08 06:03:44,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,297 INFO L272 TraceCheckUtils]: 43: Hoare triple {22241#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {22241#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {22241#(< ~counter~0 46)} is VALID [2022-04-08 06:03:44,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {22266#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22241#(< ~counter~0 46)} is VALID [2022-04-08 06:03:44,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {22266#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22266#(< ~counter~0 45)} is VALID [2022-04-08 06:03:44,299 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21852#true} {22266#(< ~counter~0 45)} #98#return; {22266#(< ~counter~0 45)} is VALID [2022-04-08 06:03:44,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,299 INFO L272 TraceCheckUtils]: 35: Hoare triple {22266#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {22266#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {22266#(< ~counter~0 45)} is VALID [2022-04-08 06:03:44,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {22291#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22266#(< ~counter~0 45)} is VALID [2022-04-08 06:03:44,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {22291#(< ~counter~0 44)} assume !(~r~0 > 0); {22291#(< ~counter~0 44)} is VALID [2022-04-08 06:03:44,301 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21852#true} {22291#(< ~counter~0 44)} #96#return; {22291#(< ~counter~0 44)} is VALID [2022-04-08 06:03:44,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,301 INFO L272 TraceCheckUtils]: 27: Hoare triple {22291#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {22291#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {22291#(< ~counter~0 44)} is VALID [2022-04-08 06:03:44,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {22316#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22291#(< ~counter~0 44)} is VALID [2022-04-08 06:03:44,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {22316#(< ~counter~0 43)} assume !!(0 != ~r~0); {22316#(< ~counter~0 43)} is VALID [2022-04-08 06:03:44,303 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21852#true} {22316#(< ~counter~0 43)} #94#return; {22316#(< ~counter~0 43)} is VALID [2022-04-08 06:03:44,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,303 INFO L272 TraceCheckUtils]: 19: Hoare triple {22316#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {22316#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {22316#(< ~counter~0 43)} is VALID [2022-04-08 06:03:44,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {22341#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22316#(< ~counter~0 43)} is VALID [2022-04-08 06:03:44,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {22341#(< ~counter~0 42)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22341#(< ~counter~0 42)} is VALID [2022-04-08 06:03:44,304 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21852#true} {22341#(< ~counter~0 42)} #92#return; {22341#(< ~counter~0 42)} is VALID [2022-04-08 06:03:44,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,305 INFO L272 TraceCheckUtils]: 11: Hoare triple {22341#(< ~counter~0 42)} 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)); {21852#true} is VALID [2022-04-08 06:03:44,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21852#true} {22341#(< ~counter~0 42)} #90#return; {22341#(< ~counter~0 42)} is VALID [2022-04-08 06:03:44,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 06:03:44,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 06:03:44,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 06:03:44,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {22341#(< ~counter~0 42)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21852#true} is VALID [2022-04-08 06:03:44,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {22341#(< ~counter~0 42)} 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; {22341#(< ~counter~0 42)} is VALID [2022-04-08 06:03:44,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {22341#(< ~counter~0 42)} call #t~ret9 := main(); {22341#(< ~counter~0 42)} is VALID [2022-04-08 06:03:44,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22341#(< ~counter~0 42)} {21852#true} #102#return; {22341#(< ~counter~0 42)} is VALID [2022-04-08 06:03:44,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {22341#(< ~counter~0 42)} assume true; {22341#(< ~counter~0 42)} is VALID [2022-04-08 06:03:44,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {21852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22341#(< ~counter~0 42)} is VALID [2022-04-08 06:03:44,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-08 06:03:44,311 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-08 06:03:44,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:44,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910911276] [2022-04-08 06:03:44,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:44,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395504480] [2022-04-08 06:03:44,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395504480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:44,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:44,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 06:03:44,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:44,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373351715] [2022-04-08 06:03:44,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373351715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:44,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:44,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:03:44,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460997679] [2022-04-08 06:03:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:44,313 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-08 06:03:44,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:44,313 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-08 06:03:44,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:44,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:03:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:03:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 06:03:44,378 INFO L87 Difference]: Start difference. First operand 166 states and 208 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-08 06:03:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:45,152 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-08 06:03:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 06:03:45,152 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-08 06:03:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:45,152 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-08 06:03:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 06:03:45,154 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-08 06:03:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 06:03:45,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-08 06:03:45,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:45,294 INFO L225 Difference]: With dead ends: 188 [2022-04-08 06:03:45,295 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 06:03:45,295 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-08 06:03:45,295 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:45,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 256 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:03:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 06:03:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-08 06:03:45,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:45,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:03:45,494 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:03:45,494 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:03:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:45,497 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 06:03:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 06:03:45,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:45,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:45,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-08 06:03:45,499 INFO L87 Difference]: Start difference. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-08 06:03:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:45,502 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 06:03:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 06:03:45,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:45,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:45,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:45,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:03:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-08 06:03:45,507 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-08 06:03:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:45,507 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-08 06:03:45,507 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-08 06:03:45,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-08 06:03:47,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-08 06:03:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 06:03:47,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:47,374 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-08 06:03:47,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:47,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:47,598 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:47,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-08 06:03:47,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:47,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820396145] [2022-04-08 06:03:47,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-08 06:03:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:47,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236712378] [2022-04-08 06:03:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:47,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:47,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:47,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166051749] [2022-04-08 06:03:47,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:03:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:47,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:47,618 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:47,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 06:03:47,663 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:03:47,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:47,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 06:03:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:47,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:47,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {23501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {23501#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; {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {23501#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-08 06:03:47,893 INFO L272 TraceCheckUtils]: 11: Hoare triple {23501#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)); {23501#true} is VALID [2022-04-08 06:03:47,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,894 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-08 06:03:47,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {23501#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,895 INFO L272 TraceCheckUtils]: 19: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:47,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,895 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,896 INFO L272 TraceCheckUtils]: 27: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:47,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,897 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,898 INFO L272 TraceCheckUtils]: 35: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:47,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,899 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,899 INFO L272 TraceCheckUtils]: 43: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:47,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,900 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,901 INFO L272 TraceCheckUtils]: 51: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:47,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,902 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,903 INFO L272 TraceCheckUtils]: 59: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:47,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,907 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:47,908 INFO L290 TraceCheckUtils]: 64: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:47,908 INFO L290 TraceCheckUtils]: 65: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:47,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:47,909 INFO L272 TraceCheckUtils]: 67: Hoare triple {23699#(< 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)); {23501#true} is VALID [2022-04-08 06:03:47,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,909 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,909 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,910 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #96#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:47,910 INFO L290 TraceCheckUtils]: 72: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:47,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:47,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:47,911 INFO L272 TraceCheckUtils]: 75: Hoare triple {23699#(< 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)); {23501#true} is VALID [2022-04-08 06:03:47,911 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:47,911 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:47,911 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:47,912 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #98#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:47,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23502#false} is VALID [2022-04-08 06:03:47,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-08 06:03:47,913 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 50);havoc #t~post8; {23502#false} is VALID [2022-04-08 06:03:47,913 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-08 06:03:47,913 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 50);havoc #t~post6; {23502#false} is VALID [2022-04-08 06:03:47,913 INFO L272 TraceCheckUtils]: 85: Hoare triple {23502#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)); {23502#false} is VALID [2022-04-08 06:03:47,913 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-08 06:03:47,914 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-08 06:03:47,914 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-08 06:03:47,914 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-08 06:03:47,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:48,157 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-08 06:03:48,157 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-08 06:03:48,157 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-08 06:03:48,157 INFO L272 TraceCheckUtils]: 85: Hoare triple {23502#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)); {23502#false} is VALID [2022-04-08 06:03:48,157 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 50);havoc #t~post6; {23502#false} is VALID [2022-04-08 06:03:48,157 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-08 06:03:48,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 50);havoc #t~post8; {23502#false} is VALID [2022-04-08 06:03:48,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-08 06:03:48,158 INFO L290 TraceCheckUtils]: 80: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23502#false} is VALID [2022-04-08 06:03:48,159 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #98#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:48,159 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,159 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,159 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,159 INFO L272 TraceCheckUtils]: 75: Hoare triple {23699#(< 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)); {23501#true} is VALID [2022-04-08 06:03:48,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:48,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:48,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:48,161 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #96#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:48,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,161 INFO L272 TraceCheckUtils]: 67: Hoare triple {23699#(< 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)); {23501#true} is VALID [2022-04-08 06:03:48,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:48,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:48,162 INFO L290 TraceCheckUtils]: 64: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:03:48,162 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,163 INFO L272 TraceCheckUtils]: 59: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:48,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,164 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,164 INFO L272 TraceCheckUtils]: 51: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:48,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,166 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,166 INFO L272 TraceCheckUtils]: 43: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:48,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,167 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,167 INFO L272 TraceCheckUtils]: 35: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:48,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,169 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,169 INFO L272 TraceCheckUtils]: 27: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:48,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,170 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,171 INFO L272 TraceCheckUtils]: 19: Hoare triple {23554#(<= 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)); {23501#true} is VALID [2022-04-08 06:03:48,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {23501#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 06:03:48,172 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L272 TraceCheckUtils]: 11: Hoare triple {23501#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)); {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {23501#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {23501#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; {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-08 06:03:48,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-08 06:03:48,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 06:03:48,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {23501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23501#true} is VALID [2022-04-08 06:03:48,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-08 06:03:48,173 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-08 06:03:48,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:48,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236712378] [2022-04-08 06:03:48,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:48,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166051749] [2022-04-08 06:03:48,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166051749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:48,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:48,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-08 06:03:48,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:48,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820396145] [2022-04-08 06:03:48,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820396145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:48,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:48,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:03:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941967922] [2022-04-08 06:03:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:48,174 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-08 06:03:48,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:48,174 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-08 06:03:48,210 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-08 06:03:48,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:03:48,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:48,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:03:48,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:03:48,210 INFO L87 Difference]: Start difference. First operand 177 states and 223 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-08 06:03:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:48,828 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-08 06:03:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:03:48,828 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-08 06:03:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:48,828 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-08 06:03:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 06:03:48,829 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-08 06:03:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 06:03:48,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-08 06:03:48,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:48,934 INFO L225 Difference]: With dead ends: 407 [2022-04-08 06:03:48,934 INFO L226 Difference]: Without dead ends: 301 [2022-04-08 06:03:48,934 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-08 06:03:48,935 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:48,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 138 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:03:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-08 06:03:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-08 06:03:49,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:49,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:03:49,390 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:03:49,390 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:03:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:49,397 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 06:03:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 06:03:49,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:49,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:49,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-08 06:03:49,400 INFO L87 Difference]: Start difference. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-08 06:03:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:49,407 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 06:03:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 06:03:49,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:49,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:49,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:49,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:03:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-08 06:03:49,416 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-08 06:03:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:49,417 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-08 06:03:49,417 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-08 06:03:49,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-08 06:03:50,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-08 06:03:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 06:03:50,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:50,513 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-08 06:03:50,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:50,713 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-08 06:03:50,713 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-08 06:03:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294287207] [2022-04-08 06:03:50,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-08 06:03:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54449122] [2022-04-08 06:03:50,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:50,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:50,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166429242] [2022-04-08 06:03:50,735 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:03:50,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:50,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:50,736 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:50,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 06:03:50,865 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:03:50,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:50,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:03:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:50,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:51,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-08 06:03:51,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {26048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#(<= ~counter~0 0)} {26048#true} #102#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#(<= ~counter~0 0)} call #t~ret9 := main(); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {26056#(<= ~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; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {26056#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #90#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,349 INFO L272 TraceCheckUtils]: 11: Hoare triple {26056#(<= ~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)); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #92#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {26056#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:51,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {26056#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:51,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {26105#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:51,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {26105#(<= ~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)); {26105#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:51,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {26105#(<= ~counter~0 1)} ~cond := #in~cond; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:51,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {26105#(<= ~counter~0 1)} assume !(0 == ~cond); {26105#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:51,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {26105#(<= ~counter~0 1)} assume true; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:51,357 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26105#(<= ~counter~0 1)} {26105#(<= ~counter~0 1)} #94#return; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:51,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {26105#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26105#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:51,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {26105#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:51,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {26130#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:51,359 INFO L272 TraceCheckUtils]: 27: Hoare triple {26130#(<= ~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)); {26130#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:51,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {26130#(<= ~counter~0 2)} ~cond := #in~cond; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:51,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {26130#(<= ~counter~0 2)} assume !(0 == ~cond); {26130#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:51,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {26130#(<= ~counter~0 2)} assume true; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:51,360 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26130#(<= ~counter~0 2)} {26130#(<= ~counter~0 2)} #96#return; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:51,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {26130#(<= ~counter~0 2)} assume !(~r~0 > 0); {26130#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:51,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {26130#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:51,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {26155#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:51,362 INFO L272 TraceCheckUtils]: 35: Hoare triple {26155#(<= ~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)); {26155#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:51,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {26155#(<= ~counter~0 3)} ~cond := #in~cond; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:51,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {26155#(<= ~counter~0 3)} assume !(0 == ~cond); {26155#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:51,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {26155#(<= ~counter~0 3)} assume true; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:51,363 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26155#(<= ~counter~0 3)} {26155#(<= ~counter~0 3)} #98#return; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:51,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {26155#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:51,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {26155#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:51,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {26180#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:51,365 INFO L272 TraceCheckUtils]: 43: Hoare triple {26180#(<= ~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)); {26180#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:51,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {26180#(<= ~counter~0 4)} ~cond := #in~cond; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:51,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {26180#(<= ~counter~0 4)} assume !(0 == ~cond); {26180#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:51,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {26180#(<= ~counter~0 4)} assume true; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:51,366 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26180#(<= ~counter~0 4)} {26180#(<= ~counter~0 4)} #98#return; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:51,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {26180#(<= ~counter~0 4)} assume !(~r~0 < 0); {26180#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:51,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {26180#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:51,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {26205#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:51,368 INFO L272 TraceCheckUtils]: 51: Hoare triple {26205#(<= ~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)); {26205#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:51,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {26205#(<= ~counter~0 5)} ~cond := #in~cond; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:51,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {26205#(<= ~counter~0 5)} assume !(0 == ~cond); {26205#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:51,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {26205#(<= ~counter~0 5)} assume true; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:51,369 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26205#(<= ~counter~0 5)} {26205#(<= ~counter~0 5)} #94#return; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:51,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {26205#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26205#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:51,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {26205#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:51,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {26230#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:51,371 INFO L272 TraceCheckUtils]: 59: Hoare triple {26230#(<= ~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)); {26230#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:51,371 INFO L290 TraceCheckUtils]: 60: Hoare triple {26230#(<= ~counter~0 6)} ~cond := #in~cond; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:51,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {26230#(<= ~counter~0 6)} assume !(0 == ~cond); {26230#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:51,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {26230#(<= ~counter~0 6)} assume true; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:51,372 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26230#(<= ~counter~0 6)} {26230#(<= ~counter~0 6)} #96#return; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:51,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {26230#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:51,373 INFO L290 TraceCheckUtils]: 65: Hoare triple {26230#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:51,373 INFO L290 TraceCheckUtils]: 66: Hoare triple {26255#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:51,374 INFO L272 TraceCheckUtils]: 67: Hoare triple {26255#(<= ~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)); {26255#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:51,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {26255#(<= ~counter~0 7)} ~cond := #in~cond; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:51,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {26255#(<= ~counter~0 7)} assume !(0 == ~cond); {26255#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:51,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {26255#(<= ~counter~0 7)} assume true; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:51,375 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26255#(<= ~counter~0 7)} {26255#(<= ~counter~0 7)} #96#return; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:51,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {26255#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:51,376 INFO L290 TraceCheckUtils]: 73: Hoare triple {26255#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:51,376 INFO L290 TraceCheckUtils]: 74: Hoare triple {26280#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:51,377 INFO L272 TraceCheckUtils]: 75: Hoare triple {26280#(<= ~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)); {26280#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:51,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {26280#(<= ~counter~0 8)} ~cond := #in~cond; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:51,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {26280#(<= ~counter~0 8)} assume !(0 == ~cond); {26280#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:51,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {26280#(<= ~counter~0 8)} assume true; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:51,378 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26280#(<= ~counter~0 8)} {26280#(<= ~counter~0 8)} #96#return; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:51,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {26280#(<= ~counter~0 8)} assume !(~r~0 > 0); {26280#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:51,379 INFO L290 TraceCheckUtils]: 81: Hoare triple {26280#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26305#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:51,380 INFO L290 TraceCheckUtils]: 82: Hoare triple {26305#(<= ~counter~0 9)} assume !(#t~post8 < 50);havoc #t~post8; {26305#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:51,381 INFO L290 TraceCheckUtils]: 83: Hoare triple {26305#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26312#(<= |main_#t~post6| 9)} is VALID [2022-04-08 06:03:51,381 INFO L290 TraceCheckUtils]: 84: Hoare triple {26312#(<= |main_#t~post6| 9)} assume !(#t~post6 < 50);havoc #t~post6; {26049#false} is VALID [2022-04-08 06:03:51,381 INFO L272 TraceCheckUtils]: 85: Hoare triple {26049#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)); {26049#false} is VALID [2022-04-08 06:03:51,381 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-08 06:03:51,381 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-08 06:03:51,381 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-08 06:03:51,382 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-08 06:03:51,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:51,895 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-08 06:03:51,896 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-08 06:03:51,896 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-08 06:03:51,896 INFO L272 TraceCheckUtils]: 85: Hoare triple {26049#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)); {26049#false} is VALID [2022-04-08 06:03:51,897 INFO L290 TraceCheckUtils]: 84: Hoare triple {26340#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {26049#false} is VALID [2022-04-08 06:03:51,897 INFO L290 TraceCheckUtils]: 83: Hoare triple {26344#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26340#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:03:51,898 INFO L290 TraceCheckUtils]: 82: Hoare triple {26344#(< ~counter~0 50)} assume !(#t~post8 < 50);havoc #t~post8; {26344#(< ~counter~0 50)} is VALID [2022-04-08 06:03:51,898 INFO L290 TraceCheckUtils]: 81: Hoare triple {26351#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26344#(< ~counter~0 50)} is VALID [2022-04-08 06:03:51,899 INFO L290 TraceCheckUtils]: 80: Hoare triple {26351#(< ~counter~0 49)} assume !(~r~0 > 0); {26351#(< ~counter~0 49)} is VALID [2022-04-08 06:03:51,899 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26048#true} {26351#(< ~counter~0 49)} #96#return; {26351#(< ~counter~0 49)} is VALID [2022-04-08 06:03:51,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,900 INFO L290 TraceCheckUtils]: 76: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,900 INFO L272 TraceCheckUtils]: 75: Hoare triple {26351#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,900 INFO L290 TraceCheckUtils]: 74: Hoare triple {26351#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {26351#(< ~counter~0 49)} is VALID [2022-04-08 06:03:51,900 INFO L290 TraceCheckUtils]: 73: Hoare triple {26376#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26351#(< ~counter~0 49)} is VALID [2022-04-08 06:03:51,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {26376#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26376#(< ~counter~0 48)} is VALID [2022-04-08 06:03:51,901 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26048#true} {26376#(< ~counter~0 48)} #96#return; {26376#(< ~counter~0 48)} is VALID [2022-04-08 06:03:51,901 INFO L290 TraceCheckUtils]: 70: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,902 INFO L290 TraceCheckUtils]: 68: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,902 INFO L272 TraceCheckUtils]: 67: Hoare triple {26376#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {26376#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {26376#(< ~counter~0 48)} is VALID [2022-04-08 06:03:51,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {26401#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26376#(< ~counter~0 48)} is VALID [2022-04-08 06:03:51,910 INFO L290 TraceCheckUtils]: 64: Hoare triple {26401#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26401#(< ~counter~0 47)} is VALID [2022-04-08 06:03:51,910 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26048#true} {26401#(< ~counter~0 47)} #96#return; {26401#(< ~counter~0 47)} is VALID [2022-04-08 06:03:51,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,911 INFO L272 TraceCheckUtils]: 59: Hoare triple {26401#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {26401#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {26401#(< ~counter~0 47)} is VALID [2022-04-08 06:03:51,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {26426#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26401#(< ~counter~0 47)} is VALID [2022-04-08 06:03:51,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {26426#(< ~counter~0 46)} assume !!(0 != ~r~0); {26426#(< ~counter~0 46)} is VALID [2022-04-08 06:03:51,912 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26048#true} {26426#(< ~counter~0 46)} #94#return; {26426#(< ~counter~0 46)} is VALID [2022-04-08 06:03:51,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,912 INFO L272 TraceCheckUtils]: 51: Hoare triple {26426#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {26426#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {26426#(< ~counter~0 46)} is VALID [2022-04-08 06:03:51,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {26451#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26426#(< ~counter~0 46)} is VALID [2022-04-08 06:03:51,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {26451#(< ~counter~0 45)} assume !(~r~0 < 0); {26451#(< ~counter~0 45)} is VALID [2022-04-08 06:03:51,914 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26048#true} {26451#(< ~counter~0 45)} #98#return; {26451#(< ~counter~0 45)} is VALID [2022-04-08 06:03:51,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,914 INFO L272 TraceCheckUtils]: 43: Hoare triple {26451#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {26451#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {26451#(< ~counter~0 45)} is VALID [2022-04-08 06:03:51,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {26476#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26451#(< ~counter~0 45)} is VALID [2022-04-08 06:03:51,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {26476#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26476#(< ~counter~0 44)} is VALID [2022-04-08 06:03:51,916 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26048#true} {26476#(< ~counter~0 44)} #98#return; {26476#(< ~counter~0 44)} is VALID [2022-04-08 06:03:51,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,916 INFO L272 TraceCheckUtils]: 35: Hoare triple {26476#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {26476#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {26476#(< ~counter~0 44)} is VALID [2022-04-08 06:03:51,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {26501#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26476#(< ~counter~0 44)} is VALID [2022-04-08 06:03:51,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {26501#(< ~counter~0 43)} assume !(~r~0 > 0); {26501#(< ~counter~0 43)} is VALID [2022-04-08 06:03:51,918 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26048#true} {26501#(< ~counter~0 43)} #96#return; {26501#(< ~counter~0 43)} is VALID [2022-04-08 06:03:51,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,918 INFO L272 TraceCheckUtils]: 27: Hoare triple {26501#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {26501#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {26501#(< ~counter~0 43)} is VALID [2022-04-08 06:03:51,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {26526#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26501#(< ~counter~0 43)} is VALID [2022-04-08 06:03:51,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {26526#(< ~counter~0 42)} assume !!(0 != ~r~0); {26526#(< ~counter~0 42)} is VALID [2022-04-08 06:03:51,920 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26048#true} {26526#(< ~counter~0 42)} #94#return; {26526#(< ~counter~0 42)} is VALID [2022-04-08 06:03:51,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,920 INFO L272 TraceCheckUtils]: 19: Hoare triple {26526#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {26526#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {26526#(< ~counter~0 42)} is VALID [2022-04-08 06:03:51,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {26551#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26526#(< ~counter~0 42)} is VALID [2022-04-08 06:03:51,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {26551#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26551#(< ~counter~0 41)} is VALID [2022-04-08 06:03:51,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26048#true} {26551#(< ~counter~0 41)} #92#return; {26551#(< ~counter~0 41)} is VALID [2022-04-08 06:03:51,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,922 INFO L272 TraceCheckUtils]: 11: Hoare triple {26551#(< ~counter~0 41)} 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)); {26048#true} is VALID [2022-04-08 06:03:51,922 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26048#true} {26551#(< ~counter~0 41)} #90#return; {26551#(< ~counter~0 41)} is VALID [2022-04-08 06:03:51,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 06:03:51,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 06:03:51,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 06:03:51,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {26551#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26048#true} is VALID [2022-04-08 06:03:51,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#(< ~counter~0 41)} 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; {26551#(< ~counter~0 41)} is VALID [2022-04-08 06:03:51,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#(< ~counter~0 41)} call #t~ret9 := main(); {26551#(< ~counter~0 41)} is VALID [2022-04-08 06:03:51,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#(< ~counter~0 41)} {26048#true} #102#return; {26551#(< ~counter~0 41)} is VALID [2022-04-08 06:03:51,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#(< ~counter~0 41)} assume true; {26551#(< ~counter~0 41)} is VALID [2022-04-08 06:03:51,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {26048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26551#(< ~counter~0 41)} is VALID [2022-04-08 06:03:51,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-08 06:03:51,925 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-08 06:03:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:51,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54449122] [2022-04-08 06:03:51,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:51,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166429242] [2022-04-08 06:03:51,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166429242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:51,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:51,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 06:03:51,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:51,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294287207] [2022-04-08 06:03:51,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294287207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:51,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:51,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:03:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101078336] [2022-04-08 06:03:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:51,926 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-08 06:03:51,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:51,926 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-08 06:03:51,986 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-08 06:03:51,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:03:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:03:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 06:03:51,987 INFO L87 Difference]: Start difference. First operand 296 states and 395 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-08 06:03:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:53,104 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-08 06:03:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 06:03:53,104 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-08 06:03:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:53,105 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-08 06:03:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:03:53,107 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-08 06:03:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:03:53,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 06:03:53,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:53,271 INFO L225 Difference]: With dead ends: 362 [2022-04-08 06:03:53,271 INFO L226 Difference]: Without dead ends: 357 [2022-04-08 06:03:53,272 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-08 06:03:53,272 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:53,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 236 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:03:53,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-08 06:03:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-08 06:03:53,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:53,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:53,766 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:53,766 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:53,774 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 06:03:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 06:03:53,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:53,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:53,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-08 06:03:53,776 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-08 06:03:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:53,784 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 06:03:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 06:03:53,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:53,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:53,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:53,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-08 06:03:53,796 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-08 06:03:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:53,796 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-08 06:03:53,796 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-08 06:03:53,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-08 06:03:56,536 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-08 06:03:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-08 06:03:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 06:03:56,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:56,537 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-08 06:03:56,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:56,737 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-08 06:03:56,737 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-08 06:03:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [155587637] [2022-04-08 06:03:56,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-08 06:03:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701661092] [2022-04-08 06:03:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:56,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:56,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991291029] [2022-04-08 06:03:56,749 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:03:56,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:56,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:56,751 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:56,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 06:03:56,897 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:03:56,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:56,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 06:03:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:56,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:57,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-08 06:03:57,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {28739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28747#(<= ~counter~0 0)} {28739#true} #102#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {28747#(<= ~counter~0 0)} call #t~ret9 := main(); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {28747#(<= ~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; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {28747#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #90#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,335 INFO L272 TraceCheckUtils]: 11: Hoare triple {28747#(<= ~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)); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #92#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {28747#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {28747#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {28796#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,339 INFO L272 TraceCheckUtils]: 19: Hoare triple {28796#(<= ~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)); {28796#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {28796#(<= ~counter~0 1)} ~cond := #in~cond; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {28796#(<= ~counter~0 1)} assume !(0 == ~cond); {28796#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {28796#(<= ~counter~0 1)} assume true; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,340 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28796#(<= ~counter~0 1)} {28796#(<= ~counter~0 1)} #94#return; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {28796#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28796#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {28796#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {28821#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,342 INFO L272 TraceCheckUtils]: 27: Hoare triple {28821#(<= ~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)); {28821#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {28821#(<= ~counter~0 2)} ~cond := #in~cond; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {28821#(<= ~counter~0 2)} assume !(0 == ~cond); {28821#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {28821#(<= ~counter~0 2)} assume true; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,343 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28821#(<= ~counter~0 2)} {28821#(<= ~counter~0 2)} #96#return; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {28821#(<= ~counter~0 2)} assume !(~r~0 > 0); {28821#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {28821#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {28846#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,345 INFO L272 TraceCheckUtils]: 35: Hoare triple {28846#(<= ~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)); {28846#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {28846#(<= ~counter~0 3)} ~cond := #in~cond; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {28846#(<= ~counter~0 3)} assume !(0 == ~cond); {28846#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {28846#(<= ~counter~0 3)} assume true; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,346 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28846#(<= ~counter~0 3)} {28846#(<= ~counter~0 3)} #98#return; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {28846#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {28846#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {28871#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,353 INFO L272 TraceCheckUtils]: 43: Hoare triple {28871#(<= ~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)); {28871#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {28871#(<= ~counter~0 4)} ~cond := #in~cond; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {28871#(<= ~counter~0 4)} assume !(0 == ~cond); {28871#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {28871#(<= ~counter~0 4)} assume true; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,354 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28871#(<= ~counter~0 4)} {28871#(<= ~counter~0 4)} #98#return; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {28871#(<= ~counter~0 4)} assume !(~r~0 < 0); {28871#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {28871#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {28896#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,356 INFO L272 TraceCheckUtils]: 51: Hoare triple {28896#(<= ~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)); {28896#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {28896#(<= ~counter~0 5)} ~cond := #in~cond; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {28896#(<= ~counter~0 5)} assume !(0 == ~cond); {28896#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {28896#(<= ~counter~0 5)} assume true; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,358 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28896#(<= ~counter~0 5)} {28896#(<= ~counter~0 5)} #94#return; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {28896#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28896#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {28896#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {28921#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,360 INFO L272 TraceCheckUtils]: 59: Hoare triple {28921#(<= ~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)); {28921#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {28921#(<= ~counter~0 6)} ~cond := #in~cond; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {28921#(<= ~counter~0 6)} assume !(0 == ~cond); {28921#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {28921#(<= ~counter~0 6)} assume true; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,362 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28921#(<= ~counter~0 6)} {28921#(<= ~counter~0 6)} #96#return; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {28921#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {28921#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {28946#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,364 INFO L272 TraceCheckUtils]: 67: Hoare triple {28946#(<= ~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)); {28946#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {28946#(<= ~counter~0 7)} ~cond := #in~cond; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {28946#(<= ~counter~0 7)} assume !(0 == ~cond); {28946#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {28946#(<= ~counter~0 7)} assume true; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,366 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28946#(<= ~counter~0 7)} {28946#(<= ~counter~0 7)} #96#return; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {28946#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,366 INFO L290 TraceCheckUtils]: 73: Hoare triple {28946#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {28971#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,367 INFO L272 TraceCheckUtils]: 75: Hoare triple {28971#(<= ~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)); {28971#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {28971#(<= ~counter~0 8)} ~cond := #in~cond; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {28971#(<= ~counter~0 8)} assume !(0 == ~cond); {28971#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {28971#(<= ~counter~0 8)} assume true; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,369 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28971#(<= ~counter~0 8)} {28971#(<= ~counter~0 8)} #96#return; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,369 INFO L290 TraceCheckUtils]: 80: Hoare triple {28971#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,369 INFO L290 TraceCheckUtils]: 81: Hoare triple {28971#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28996#(<= |main_#t~post7| 8)} is VALID [2022-04-08 06:03:57,370 INFO L290 TraceCheckUtils]: 82: Hoare triple {28996#(<= |main_#t~post7| 8)} assume !(#t~post7 < 50);havoc #t~post7; {28740#false} is VALID [2022-04-08 06:03:57,370 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-08 06:03:57,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 50);havoc #t~post8; {28740#false} is VALID [2022-04-08 06:03:57,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-08 06:03:57,370 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 50);havoc #t~post6; {28740#false} is VALID [2022-04-08 06:03:57,370 INFO L272 TraceCheckUtils]: 87: Hoare triple {28740#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)); {28740#false} is VALID [2022-04-08 06:03:57,370 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-08 06:03:57,370 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-08 06:03:57,370 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-08 06:03:57,370 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-08 06:03:57,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:57,859 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-08 06:03:57,859 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-08 06:03:57,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-08 06:03:57,860 INFO L272 TraceCheckUtils]: 87: Hoare triple {28740#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)); {28740#false} is VALID [2022-04-08 06:03:57,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 50);havoc #t~post6; {28740#false} is VALID [2022-04-08 06:03:57,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-08 06:03:57,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 50);havoc #t~post8; {28740#false} is VALID [2022-04-08 06:03:57,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-08 06:03:57,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {29048#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {28740#false} is VALID [2022-04-08 06:03:57,861 INFO L290 TraceCheckUtils]: 81: Hoare triple {29052#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29048#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:03:57,861 INFO L290 TraceCheckUtils]: 80: Hoare triple {29052#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29052#(< ~counter~0 50)} is VALID [2022-04-08 06:03:57,862 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28739#true} {29052#(< ~counter~0 50)} #96#return; {29052#(< ~counter~0 50)} is VALID [2022-04-08 06:03:57,862 INFO L290 TraceCheckUtils]: 78: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,862 INFO L290 TraceCheckUtils]: 77: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,862 INFO L272 TraceCheckUtils]: 75: Hoare triple {29052#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,863 INFO L290 TraceCheckUtils]: 74: Hoare triple {29052#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {29052#(< ~counter~0 50)} is VALID [2022-04-08 06:03:57,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {29077#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29052#(< ~counter~0 50)} is VALID [2022-04-08 06:03:57,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {29077#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29077#(< ~counter~0 49)} is VALID [2022-04-08 06:03:57,865 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28739#true} {29077#(< ~counter~0 49)} #96#return; {29077#(< ~counter~0 49)} is VALID [2022-04-08 06:03:57,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,865 INFO L290 TraceCheckUtils]: 68: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,865 INFO L272 TraceCheckUtils]: 67: Hoare triple {29077#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {29077#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {29077#(< ~counter~0 49)} is VALID [2022-04-08 06:03:57,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {29102#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29077#(< ~counter~0 49)} is VALID [2022-04-08 06:03:57,867 INFO L290 TraceCheckUtils]: 64: Hoare triple {29102#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29102#(< ~counter~0 48)} is VALID [2022-04-08 06:03:57,867 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28739#true} {29102#(< ~counter~0 48)} #96#return; {29102#(< ~counter~0 48)} is VALID [2022-04-08 06:03:57,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,868 INFO L290 TraceCheckUtils]: 61: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,868 INFO L272 TraceCheckUtils]: 59: Hoare triple {29102#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,868 INFO L290 TraceCheckUtils]: 58: Hoare triple {29102#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {29102#(< ~counter~0 48)} is VALID [2022-04-08 06:03:57,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {29127#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29102#(< ~counter~0 48)} is VALID [2022-04-08 06:03:57,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {29127#(< ~counter~0 47)} assume !!(0 != ~r~0); {29127#(< ~counter~0 47)} is VALID [2022-04-08 06:03:57,870 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28739#true} {29127#(< ~counter~0 47)} #94#return; {29127#(< ~counter~0 47)} is VALID [2022-04-08 06:03:57,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,871 INFO L272 TraceCheckUtils]: 51: Hoare triple {29127#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {29127#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {29127#(< ~counter~0 47)} is VALID [2022-04-08 06:03:57,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {29152#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29127#(< ~counter~0 47)} is VALID [2022-04-08 06:03:57,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {29152#(< ~counter~0 46)} assume !(~r~0 < 0); {29152#(< ~counter~0 46)} is VALID [2022-04-08 06:03:57,873 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28739#true} {29152#(< ~counter~0 46)} #98#return; {29152#(< ~counter~0 46)} is VALID [2022-04-08 06:03:57,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,873 INFO L272 TraceCheckUtils]: 43: Hoare triple {29152#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {29152#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {29152#(< ~counter~0 46)} is VALID [2022-04-08 06:03:57,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {29177#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29152#(< ~counter~0 46)} is VALID [2022-04-08 06:03:57,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {29177#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29177#(< ~counter~0 45)} is VALID [2022-04-08 06:03:57,875 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28739#true} {29177#(< ~counter~0 45)} #98#return; {29177#(< ~counter~0 45)} is VALID [2022-04-08 06:03:57,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,876 INFO L272 TraceCheckUtils]: 35: Hoare triple {29177#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {29177#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {29177#(< ~counter~0 45)} is VALID [2022-04-08 06:03:57,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {29202#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29177#(< ~counter~0 45)} is VALID [2022-04-08 06:03:57,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {29202#(< ~counter~0 44)} assume !(~r~0 > 0); {29202#(< ~counter~0 44)} is VALID [2022-04-08 06:03:57,878 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28739#true} {29202#(< ~counter~0 44)} #96#return; {29202#(< ~counter~0 44)} is VALID [2022-04-08 06:03:57,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,879 INFO L272 TraceCheckUtils]: 27: Hoare triple {29202#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {29202#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {29202#(< ~counter~0 44)} is VALID [2022-04-08 06:03:57,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {29227#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29202#(< ~counter~0 44)} is VALID [2022-04-08 06:03:57,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {29227#(< ~counter~0 43)} assume !!(0 != ~r~0); {29227#(< ~counter~0 43)} is VALID [2022-04-08 06:03:57,881 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28739#true} {29227#(< ~counter~0 43)} #94#return; {29227#(< ~counter~0 43)} is VALID [2022-04-08 06:03:57,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,881 INFO L272 TraceCheckUtils]: 19: Hoare triple {29227#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {29227#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {29227#(< ~counter~0 43)} is VALID [2022-04-08 06:03:57,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {29252#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29227#(< ~counter~0 43)} is VALID [2022-04-08 06:03:57,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {29252#(< ~counter~0 42)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29252#(< ~counter~0 42)} is VALID [2022-04-08 06:03:57,883 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28739#true} {29252#(< ~counter~0 42)} #92#return; {29252#(< ~counter~0 42)} is VALID [2022-04-08 06:03:57,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,883 INFO L272 TraceCheckUtils]: 11: Hoare triple {29252#(< ~counter~0 42)} 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)); {28739#true} is VALID [2022-04-08 06:03:57,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28739#true} {29252#(< ~counter~0 42)} #90#return; {29252#(< ~counter~0 42)} is VALID [2022-04-08 06:03:57,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 06:03:57,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 06:03:57,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 06:03:57,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {29252#(< ~counter~0 42)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28739#true} is VALID [2022-04-08 06:03:57,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {29252#(< ~counter~0 42)} 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; {29252#(< ~counter~0 42)} is VALID [2022-04-08 06:03:57,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {29252#(< ~counter~0 42)} call #t~ret9 := main(); {29252#(< ~counter~0 42)} is VALID [2022-04-08 06:03:57,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29252#(< ~counter~0 42)} {28739#true} #102#return; {29252#(< ~counter~0 42)} is VALID [2022-04-08 06:03:57,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {29252#(< ~counter~0 42)} assume true; {29252#(< ~counter~0 42)} is VALID [2022-04-08 06:03:57,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {28739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29252#(< ~counter~0 42)} is VALID [2022-04-08 06:03:57,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-08 06:03:57,887 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-08 06:03:57,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:57,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701661092] [2022-04-08 06:03:57,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:57,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991291029] [2022-04-08 06:03:57,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991291029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:57,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:57,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 06:03:57,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:57,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [155587637] [2022-04-08 06:03:57,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [155587637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:57,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:57,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:03:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489243827] [2022-04-08 06:03:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:57,889 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-08 06:03:57,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:57,889 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-08 06:03:57,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:57,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:03:57,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:57,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:03:57,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 06:03:57,970 INFO L87 Difference]: Start difference. First operand 342 states and 460 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-08 06:03:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:58,974 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-08 06:03:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 06:03:58,975 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-08 06:03:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:58,975 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-08 06:03:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:03:58,977 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-08 06:03:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:03:58,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 06:03:59,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:59,129 INFO L225 Difference]: With dead ends: 427 [2022-04-08 06:03:59,130 INFO L226 Difference]: Without dead ends: 342 [2022-04-08 06:03:59,130 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-08 06:03:59,130 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 95 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:59,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:03:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-08 06:03:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-08 06:03:59,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:59,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:59,665 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:59,665 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:59,673 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 06:03:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:03:59,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:59,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:59,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-08 06:03:59,674 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-08 06:03:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:59,682 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 06:03:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:03:59,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:59,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:59,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:59,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-08 06:03:59,698 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-08 06:03:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:59,698 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-08 06:03:59,698 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-08 06:03:59,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-08 06:04:02,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 455 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:04:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 06:04:02,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:02,695 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-08 06:04:02,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 06:04:02,899 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-08 06:04:02,899 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-08 06:04:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:02,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848716245] [2022-04-08 06:04:02,900 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-08 06:04:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:02,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096540158] [2022-04-08 06:04:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:02,918 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:02,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239443992] [2022-04-08 06:04:02,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:04:02,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:02,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:02,920 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:02,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 06:04:02,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:04:02,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:02,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:04:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:02,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:03,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-08 06:04:03,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {31542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31550#(<= ~counter~0 0)} {31542#true} #102#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {31550#(<= ~counter~0 0)} call #t~ret9 := main(); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {31550#(<= ~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; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {31550#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #90#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {31550#(<= ~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)); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,459 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #92#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {31550#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:03,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {31550#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:03,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {31599#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:03,461 INFO L272 TraceCheckUtils]: 19: Hoare triple {31599#(<= ~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)); {31599#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:03,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {31599#(<= ~counter~0 1)} ~cond := #in~cond; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:03,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {31599#(<= ~counter~0 1)} assume !(0 == ~cond); {31599#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:03,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {31599#(<= ~counter~0 1)} assume true; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:03,463 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31599#(<= ~counter~0 1)} {31599#(<= ~counter~0 1)} #94#return; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:03,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {31599#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31599#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:03,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {31599#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:03,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {31624#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:03,464 INFO L272 TraceCheckUtils]: 27: Hoare triple {31624#(<= ~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)); {31624#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:03,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {31624#(<= ~counter~0 2)} ~cond := #in~cond; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:03,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {31624#(<= ~counter~0 2)} assume !(0 == ~cond); {31624#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:03,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {31624#(<= ~counter~0 2)} assume true; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:03,466 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31624#(<= ~counter~0 2)} {31624#(<= ~counter~0 2)} #96#return; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:03,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {31624#(<= ~counter~0 2)} assume !(~r~0 > 0); {31624#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:03,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {31624#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:03,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {31649#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:03,467 INFO L272 TraceCheckUtils]: 35: Hoare triple {31649#(<= ~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)); {31649#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:03,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {31649#(<= ~counter~0 3)} ~cond := #in~cond; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:03,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {31649#(<= ~counter~0 3)} assume !(0 == ~cond); {31649#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:03,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {31649#(<= ~counter~0 3)} assume true; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:03,469 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31649#(<= ~counter~0 3)} {31649#(<= ~counter~0 3)} #98#return; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:03,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {31649#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:03,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {31649#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:03,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {31674#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:03,470 INFO L272 TraceCheckUtils]: 43: Hoare triple {31674#(<= ~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)); {31674#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:03,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {31674#(<= ~counter~0 4)} ~cond := #in~cond; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:03,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {31674#(<= ~counter~0 4)} assume !(0 == ~cond); {31674#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:03,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {31674#(<= ~counter~0 4)} assume true; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:03,472 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31674#(<= ~counter~0 4)} {31674#(<= ~counter~0 4)} #98#return; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:03,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {31674#(<= ~counter~0 4)} assume !(~r~0 < 0); {31674#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:03,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {31674#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:03,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {31699#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:03,473 INFO L272 TraceCheckUtils]: 51: Hoare triple {31699#(<= ~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)); {31699#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:03,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {31699#(<= ~counter~0 5)} ~cond := #in~cond; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:03,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {31699#(<= ~counter~0 5)} assume !(0 == ~cond); {31699#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:03,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {31699#(<= ~counter~0 5)} assume true; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:03,475 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31699#(<= ~counter~0 5)} {31699#(<= ~counter~0 5)} #94#return; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:03,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {31699#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31699#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:03,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {31699#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:03,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {31724#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:03,476 INFO L272 TraceCheckUtils]: 59: Hoare triple {31724#(<= ~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)); {31724#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:03,477 INFO L290 TraceCheckUtils]: 60: Hoare triple {31724#(<= ~counter~0 6)} ~cond := #in~cond; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:03,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {31724#(<= ~counter~0 6)} assume !(0 == ~cond); {31724#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:03,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {31724#(<= ~counter~0 6)} assume true; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:03,478 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31724#(<= ~counter~0 6)} {31724#(<= ~counter~0 6)} #96#return; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:03,478 INFO L290 TraceCheckUtils]: 64: Hoare triple {31724#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:03,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {31724#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:03,479 INFO L290 TraceCheckUtils]: 66: Hoare triple {31749#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:03,479 INFO L272 TraceCheckUtils]: 67: Hoare triple {31749#(<= ~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)); {31749#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:03,480 INFO L290 TraceCheckUtils]: 68: Hoare triple {31749#(<= ~counter~0 7)} ~cond := #in~cond; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:03,480 INFO L290 TraceCheckUtils]: 69: Hoare triple {31749#(<= ~counter~0 7)} assume !(0 == ~cond); {31749#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:03,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {31749#(<= ~counter~0 7)} assume true; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:03,481 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31749#(<= ~counter~0 7)} {31749#(<= ~counter~0 7)} #96#return; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:03,481 INFO L290 TraceCheckUtils]: 72: Hoare triple {31749#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:03,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {31749#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:03,482 INFO L290 TraceCheckUtils]: 74: Hoare triple {31774#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:03,482 INFO L272 TraceCheckUtils]: 75: Hoare triple {31774#(<= ~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)); {31774#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:03,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {31774#(<= ~counter~0 8)} ~cond := #in~cond; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:03,483 INFO L290 TraceCheckUtils]: 77: Hoare triple {31774#(<= ~counter~0 8)} assume !(0 == ~cond); {31774#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:03,483 INFO L290 TraceCheckUtils]: 78: Hoare triple {31774#(<= ~counter~0 8)} assume true; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:03,484 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31774#(<= ~counter~0 8)} {31774#(<= ~counter~0 8)} #96#return; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:03,484 INFO L290 TraceCheckUtils]: 80: Hoare triple {31774#(<= ~counter~0 8)} assume !(~r~0 > 0); {31774#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:03,484 INFO L290 TraceCheckUtils]: 81: Hoare triple {31774#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:03,485 INFO L290 TraceCheckUtils]: 82: Hoare triple {31799#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:03,485 INFO L272 TraceCheckUtils]: 83: Hoare triple {31799#(<= ~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)); {31799#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:03,485 INFO L290 TraceCheckUtils]: 84: Hoare triple {31799#(<= ~counter~0 9)} ~cond := #in~cond; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:03,486 INFO L290 TraceCheckUtils]: 85: Hoare triple {31799#(<= ~counter~0 9)} assume !(0 == ~cond); {31799#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:03,486 INFO L290 TraceCheckUtils]: 86: Hoare triple {31799#(<= ~counter~0 9)} assume true; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:03,487 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31799#(<= ~counter~0 9)} {31799#(<= ~counter~0 9)} #98#return; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:03,487 INFO L290 TraceCheckUtils]: 88: Hoare triple {31799#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:03,487 INFO L290 TraceCheckUtils]: 89: Hoare triple {31799#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31824#(<= |main_#t~post8| 9)} is VALID [2022-04-08 06:04:03,487 INFO L290 TraceCheckUtils]: 90: Hoare triple {31824#(<= |main_#t~post8| 9)} assume !(#t~post8 < 50);havoc #t~post8; {31543#false} is VALID [2022-04-08 06:04:03,488 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-08 06:04:03,488 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 50);havoc #t~post6; {31543#false} is VALID [2022-04-08 06:04:03,488 INFO L272 TraceCheckUtils]: 93: Hoare triple {31543#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)); {31543#false} is VALID [2022-04-08 06:04:03,488 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-08 06:04:03,488 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-08 06:04:03,488 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-08 06:04:03,488 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-08 06:04:03,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:03,997 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-08 06:04:03,997 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-08 06:04:03,997 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-08 06:04:03,998 INFO L272 TraceCheckUtils]: 93: Hoare triple {31543#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)); {31543#false} is VALID [2022-04-08 06:04:03,998 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 50);havoc #t~post6; {31543#false} is VALID [2022-04-08 06:04:03,998 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-08 06:04:03,998 INFO L290 TraceCheckUtils]: 90: Hoare triple {31864#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {31543#false} is VALID [2022-04-08 06:04:03,998 INFO L290 TraceCheckUtils]: 89: Hoare triple {31868#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31864#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:04:03,999 INFO L290 TraceCheckUtils]: 88: Hoare triple {31868#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31868#(< ~counter~0 50)} is VALID [2022-04-08 06:04:03,999 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31542#true} {31868#(< ~counter~0 50)} #98#return; {31868#(< ~counter~0 50)} is VALID [2022-04-08 06:04:03,999 INFO L290 TraceCheckUtils]: 86: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:03,999 INFO L290 TraceCheckUtils]: 85: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:03,999 INFO L290 TraceCheckUtils]: 84: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:03,999 INFO L272 TraceCheckUtils]: 83: Hoare triple {31868#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,000 INFO L290 TraceCheckUtils]: 82: Hoare triple {31868#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {31868#(< ~counter~0 50)} is VALID [2022-04-08 06:04:04,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {31893#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31868#(< ~counter~0 50)} is VALID [2022-04-08 06:04:04,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {31893#(< ~counter~0 49)} assume !(~r~0 > 0); {31893#(< ~counter~0 49)} is VALID [2022-04-08 06:04:04,001 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31542#true} {31893#(< ~counter~0 49)} #96#return; {31893#(< ~counter~0 49)} is VALID [2022-04-08 06:04:04,001 INFO L290 TraceCheckUtils]: 78: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,002 INFO L272 TraceCheckUtils]: 75: Hoare triple {31893#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,002 INFO L290 TraceCheckUtils]: 74: Hoare triple {31893#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {31893#(< ~counter~0 49)} is VALID [2022-04-08 06:04:04,002 INFO L290 TraceCheckUtils]: 73: Hoare triple {31918#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31893#(< ~counter~0 49)} is VALID [2022-04-08 06:04:04,003 INFO L290 TraceCheckUtils]: 72: Hoare triple {31918#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31918#(< ~counter~0 48)} is VALID [2022-04-08 06:04:04,003 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31542#true} {31918#(< ~counter~0 48)} #96#return; {31918#(< ~counter~0 48)} is VALID [2022-04-08 06:04:04,003 INFO L290 TraceCheckUtils]: 70: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,003 INFO L290 TraceCheckUtils]: 69: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,004 INFO L272 TraceCheckUtils]: 67: Hoare triple {31918#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,004 INFO L290 TraceCheckUtils]: 66: Hoare triple {31918#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {31918#(< ~counter~0 48)} is VALID [2022-04-08 06:04:04,004 INFO L290 TraceCheckUtils]: 65: Hoare triple {31943#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31918#(< ~counter~0 48)} is VALID [2022-04-08 06:04:04,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {31943#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31943#(< ~counter~0 47)} is VALID [2022-04-08 06:04:04,005 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31542#true} {31943#(< ~counter~0 47)} #96#return; {31943#(< ~counter~0 47)} is VALID [2022-04-08 06:04:04,005 INFO L290 TraceCheckUtils]: 62: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,005 INFO L290 TraceCheckUtils]: 61: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,005 INFO L272 TraceCheckUtils]: 59: Hoare triple {31943#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {31943#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {31943#(< ~counter~0 47)} is VALID [2022-04-08 06:04:04,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {31968#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31943#(< ~counter~0 47)} is VALID [2022-04-08 06:04:04,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {31968#(< ~counter~0 46)} assume !!(0 != ~r~0); {31968#(< ~counter~0 46)} is VALID [2022-04-08 06:04:04,007 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31542#true} {31968#(< ~counter~0 46)} #94#return; {31968#(< ~counter~0 46)} is VALID [2022-04-08 06:04:04,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,007 INFO L272 TraceCheckUtils]: 51: Hoare triple {31968#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {31968#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {31968#(< ~counter~0 46)} is VALID [2022-04-08 06:04:04,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {31993#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31968#(< ~counter~0 46)} is VALID [2022-04-08 06:04:04,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {31993#(< ~counter~0 45)} assume !(~r~0 < 0); {31993#(< ~counter~0 45)} is VALID [2022-04-08 06:04:04,009 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31542#true} {31993#(< ~counter~0 45)} #98#return; {31993#(< ~counter~0 45)} is VALID [2022-04-08 06:04:04,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,009 INFO L272 TraceCheckUtils]: 43: Hoare triple {31993#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {31993#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {31993#(< ~counter~0 45)} is VALID [2022-04-08 06:04:04,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {32018#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31993#(< ~counter~0 45)} is VALID [2022-04-08 06:04:04,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {32018#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32018#(< ~counter~0 44)} is VALID [2022-04-08 06:04:04,011 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31542#true} {32018#(< ~counter~0 44)} #98#return; {32018#(< ~counter~0 44)} is VALID [2022-04-08 06:04:04,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,011 INFO L272 TraceCheckUtils]: 35: Hoare triple {32018#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {32018#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {32018#(< ~counter~0 44)} is VALID [2022-04-08 06:04:04,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {32043#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32018#(< ~counter~0 44)} is VALID [2022-04-08 06:04:04,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {32043#(< ~counter~0 43)} assume !(~r~0 > 0); {32043#(< ~counter~0 43)} is VALID [2022-04-08 06:04:04,013 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31542#true} {32043#(< ~counter~0 43)} #96#return; {32043#(< ~counter~0 43)} is VALID [2022-04-08 06:04:04,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,013 INFO L272 TraceCheckUtils]: 27: Hoare triple {32043#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {32043#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {32043#(< ~counter~0 43)} is VALID [2022-04-08 06:04:04,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {32068#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32043#(< ~counter~0 43)} is VALID [2022-04-08 06:04:04,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {32068#(< ~counter~0 42)} assume !!(0 != ~r~0); {32068#(< ~counter~0 42)} is VALID [2022-04-08 06:04:04,015 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31542#true} {32068#(< ~counter~0 42)} #94#return; {32068#(< ~counter~0 42)} is VALID [2022-04-08 06:04:04,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,015 INFO L272 TraceCheckUtils]: 19: Hoare triple {32068#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {32068#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {32068#(< ~counter~0 42)} is VALID [2022-04-08 06:04:04,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {32093#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32068#(< ~counter~0 42)} is VALID [2022-04-08 06:04:04,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {32093#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32093#(< ~counter~0 41)} is VALID [2022-04-08 06:04:04,016 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31542#true} {32093#(< ~counter~0 41)} #92#return; {32093#(< ~counter~0 41)} is VALID [2022-04-08 06:04:04,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,017 INFO L272 TraceCheckUtils]: 11: Hoare triple {32093#(< ~counter~0 41)} 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)); {31542#true} is VALID [2022-04-08 06:04:04,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31542#true} {32093#(< ~counter~0 41)} #90#return; {32093#(< ~counter~0 41)} is VALID [2022-04-08 06:04:04,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 06:04:04,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 06:04:04,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 06:04:04,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {32093#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31542#true} is VALID [2022-04-08 06:04:04,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {32093#(< ~counter~0 41)} 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; {32093#(< ~counter~0 41)} is VALID [2022-04-08 06:04:04,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {32093#(< ~counter~0 41)} call #t~ret9 := main(); {32093#(< ~counter~0 41)} is VALID [2022-04-08 06:04:04,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32093#(< ~counter~0 41)} {31542#true} #102#return; {32093#(< ~counter~0 41)} is VALID [2022-04-08 06:04:04,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {32093#(< ~counter~0 41)} assume true; {32093#(< ~counter~0 41)} is VALID [2022-04-08 06:04:04,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {31542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32093#(< ~counter~0 41)} is VALID [2022-04-08 06:04:04,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-08 06:04:04,019 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-08 06:04:04,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:04,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096540158] [2022-04-08 06:04:04,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:04,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239443992] [2022-04-08 06:04:04,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239443992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:04,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 06:04:04,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:04,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848716245] [2022-04-08 06:04:04,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848716245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:04,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:04:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320651239] [2022-04-08 06:04:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:04,021 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-08 06:04:04,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:04,021 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-08 06:04:04,089 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-08 06:04:04,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:04:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:04:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 06:04:04,090 INFO L87 Difference]: Start difference. First operand 342 states and 456 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-08 06:04:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:05,275 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-08 06:04:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 06:04:05,276 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-08 06:04:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:05,276 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-08 06:04:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 06:04:05,278 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-08 06:04:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 06:04:05,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-08 06:04:05,484 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-08 06:04:05,493 INFO L225 Difference]: With dead ends: 467 [2022-04-08 06:04:05,493 INFO L226 Difference]: Without dead ends: 352 [2022-04-08 06:04:05,494 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-08 06:04:05,495 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:05,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 249 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:04:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-08 06:04:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-08 06:04:06,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:06,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:06,063 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:06,064 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:06,074 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 06:04:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 06:04:06,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:06,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:06,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-08 06:04:06,076 INFO L87 Difference]: Start difference. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-08 06:04:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:06,084 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 06:04:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 06:04:06,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:06,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:06,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:06,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-08 06:04:06,096 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-08 06:04:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:06,096 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-08 06:04:06,096 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-08 06:04:06,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-08 06:04:07,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-08 06:04:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 06:04:07,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:07,636 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-08 06:04:07,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-08 06:04:07,836 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-08 06:04:07,836 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-08 06:04:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:07,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1569038079] [2022-04-08 06:04:07,837 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-08 06:04:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:07,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672509072] [2022-04-08 06:04:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:07,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:07,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909174785] [2022-04-08 06:04:07,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:04:07,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:07,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:07,862 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:07,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 06:04:07,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:04:07,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:07,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:04:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:07,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:08,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {34487#true} call ULTIMATE.init(); {34487#true} is VALID [2022-04-08 06:04:08,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {34487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34487#true} {34487#true} #102#return; {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {34487#true} call #t~ret9 := main(); {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {34487#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; {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {34487#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34487#true} {34487#true} #90#return; {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L272 TraceCheckUtils]: 11: Hoare triple {34487#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)); {34487#true} is VALID [2022-04-08 06:04:08,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34487#true} {34487#true} #92#return; {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {34487#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {34487#true} assume !!(#t~post6 < 50);havoc #t~post6; {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L272 TraceCheckUtils]: 19: Hoare triple {34487#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)); {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,208 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {34487#true} assume !!(#t~post7 < 50);havoc #t~post7; {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L272 TraceCheckUtils]: 27: Hoare triple {34487#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)); {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {34487#true} assume !(~r~0 > 0); {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-08 06:04:08,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {34487#true} assume !!(#t~post8 < 50);havoc #t~post8; {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L272 TraceCheckUtils]: 35: Hoare triple {34487#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)); {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {34487#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {34487#true} assume !!(#t~post8 < 50);havoc #t~post8; {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L272 TraceCheckUtils]: 43: Hoare triple {34487#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)); {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {34487#true} assume !(~r~0 < 0); {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {34487#true} assume !!(#t~post6 < 50);havoc #t~post6; {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L272 TraceCheckUtils]: 51: Hoare triple {34487#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)); {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-08 06:04:08,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L290 TraceCheckUtils]: 58: Hoare triple {34487#true} assume !!(#t~post7 < 50);havoc #t~post7; {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L272 TraceCheckUtils]: 59: Hoare triple {34487#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)); {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L290 TraceCheckUtils]: 60: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L290 TraceCheckUtils]: 61: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {34487#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L290 TraceCheckUtils]: 66: Hoare triple {34487#true} assume !!(#t~post7 < 50);havoc #t~post7; {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L272 TraceCheckUtils]: 67: Hoare triple {34487#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)); {34487#true} is VALID [2022-04-08 06:04:08,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,213 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 06:04:08,213 INFO L290 TraceCheckUtils]: 72: Hoare triple {34487#true} assume !(~r~0 > 0); {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:04:08,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {34708#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:04:08,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {34708#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:04:08,214 INFO L272 TraceCheckUtils]: 75: Hoare triple {34708#(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)); {34487#true} is VALID [2022-04-08 06:04:08,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,214 INFO L290 TraceCheckUtils]: 78: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,215 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34487#true} {34708#(not (< 0 main_~r~0))} #98#return; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:04:08,215 INFO L290 TraceCheckUtils]: 80: Hoare triple {34708#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:04:08,216 INFO L290 TraceCheckUtils]: 81: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:04:08,216 INFO L290 TraceCheckUtils]: 82: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:04:08,216 INFO L272 TraceCheckUtils]: 83: Hoare triple {34733#(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)); {34487#true} is VALID [2022-04-08 06:04:08,216 INFO L290 TraceCheckUtils]: 84: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 06:04:08,216 INFO L290 TraceCheckUtils]: 85: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 06:04:08,217 INFO L290 TraceCheckUtils]: 86: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 06:04:08,217 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34487#true} {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 88: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 89: Hoare triple {34488#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 90: Hoare triple {34488#false} assume !(#t~post7 < 50);havoc #t~post7; {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 91: Hoare triple {34488#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 92: Hoare triple {34488#false} assume !(#t~post8 < 50);havoc #t~post8; {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 93: Hoare triple {34488#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 94: Hoare triple {34488#false} assume !(#t~post6 < 50);havoc #t~post6; {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L272 TraceCheckUtils]: 95: Hoare triple {34488#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)); {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 96: Hoare triple {34488#false} ~cond := #in~cond; {34488#false} is VALID [2022-04-08 06:04:08,218 INFO L290 TraceCheckUtils]: 97: Hoare triple {34488#false} assume 0 == ~cond; {34488#false} is VALID [2022-04-08 06:04:08,219 INFO L290 TraceCheckUtils]: 98: Hoare triple {34488#false} assume !false; {34488#false} is VALID [2022-04-08 06:04:08,219 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-08 06:04:08,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:04:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:08,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672509072] [2022-04-08 06:04:08,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:08,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909174785] [2022-04-08 06:04:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909174785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:08,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:04:08,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:08,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1569038079] [2022-04-08 06:04:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1569038079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:08,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:04:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706762629] [2022-04-08 06:04:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:08,221 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-08 06:04:08,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:08,221 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-08 06:04:08,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:08,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:04:08,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:08,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:04:08,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:04:08,271 INFO L87 Difference]: Start difference. First operand 344 states and 457 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-08 06:04:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:09,031 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-08 06:04:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:04:09,031 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-08 06:04:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:09,032 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-08 06:04:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:04:09,032 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-08 06:04:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:04:09,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 06:04:09,097 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-08 06:04:09,103 INFO L225 Difference]: With dead ends: 504 [2022-04-08 06:04:09,104 INFO L226 Difference]: Without dead ends: 362 [2022-04-08 06:04:09,104 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-08 06:04:09,104 INFO L913 BasicCegarLoop]: 53 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, 122 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-08 06:04:09,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:04:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-08 06:04:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-08 06:04:09,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:09,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:09,681 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:09,681 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:09,690 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 06:04:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 06:04:09,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:09,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:09,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-08 06:04:09,692 INFO L87 Difference]: Start difference. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-08 06:04:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:09,701 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 06:04:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 06:04:09,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:09,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:09,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:09,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-08 06:04:09,712 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-08 06:04:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:09,713 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-08 06:04:09,713 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-08 06:04:09,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-08 06:04:12,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 467 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-08 06:04:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 06:04:12,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:12,765 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-08 06:04:12,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 06:04:12,965 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-08 06:04:12,965 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-08 06:04:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:12,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378078135] [2022-04-08 06:04:12,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-08 06:04:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:12,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151349629] [2022-04-08 06:04:12,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:12,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:12,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995575905] [2022-04-08 06:04:12,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:04:12,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:12,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:12,978 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:12,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 06:04:13,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:04:13,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:13,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:04:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:13,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:13,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-08 06:04:13,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {37223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37231#(<= ~counter~0 0)} {37223#true} #102#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {37231#(<= ~counter~0 0)} call #t~ret9 := main(); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {37231#(<= ~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; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,671 INFO L272 TraceCheckUtils]: 6: Hoare triple {37231#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #90#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,673 INFO L272 TraceCheckUtils]: 11: Hoare triple {37231#(<= ~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)); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,674 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #92#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {37231#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:13,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {37231#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:13,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {37280#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:13,676 INFO L272 TraceCheckUtils]: 19: Hoare triple {37280#(<= ~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)); {37280#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:13,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {37280#(<= ~counter~0 1)} ~cond := #in~cond; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:13,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {37280#(<= ~counter~0 1)} assume !(0 == ~cond); {37280#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:13,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {37280#(<= ~counter~0 1)} assume true; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:13,677 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37280#(<= ~counter~0 1)} {37280#(<= ~counter~0 1)} #94#return; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:13,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {37280#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37280#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:13,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {37280#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:13,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {37305#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:13,679 INFO L272 TraceCheckUtils]: 27: Hoare triple {37305#(<= ~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)); {37305#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:13,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {37305#(<= ~counter~0 2)} ~cond := #in~cond; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:13,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {37305#(<= ~counter~0 2)} assume !(0 == ~cond); {37305#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:13,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {37305#(<= ~counter~0 2)} assume true; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:13,680 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37305#(<= ~counter~0 2)} {37305#(<= ~counter~0 2)} #96#return; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:13,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {37305#(<= ~counter~0 2)} assume !(~r~0 > 0); {37305#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:13,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {37305#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:13,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {37330#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:13,682 INFO L272 TraceCheckUtils]: 35: Hoare triple {37330#(<= ~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)); {37330#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:13,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {37330#(<= ~counter~0 3)} ~cond := #in~cond; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:13,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {37330#(<= ~counter~0 3)} assume !(0 == ~cond); {37330#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:13,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {37330#(<= ~counter~0 3)} assume true; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:13,683 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37330#(<= ~counter~0 3)} {37330#(<= ~counter~0 3)} #98#return; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:13,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {37330#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:13,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {37330#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:13,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {37355#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:13,685 INFO L272 TraceCheckUtils]: 43: Hoare triple {37355#(<= ~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)); {37355#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:13,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {37355#(<= ~counter~0 4)} ~cond := #in~cond; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:13,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {37355#(<= ~counter~0 4)} assume !(0 == ~cond); {37355#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:13,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {37355#(<= ~counter~0 4)} assume true; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:13,686 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37355#(<= ~counter~0 4)} {37355#(<= ~counter~0 4)} #98#return; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:13,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {37355#(<= ~counter~0 4)} assume !(~r~0 < 0); {37355#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:13,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {37355#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:13,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {37380#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:13,688 INFO L272 TraceCheckUtils]: 51: Hoare triple {37380#(<= ~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)); {37380#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:13,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {37380#(<= ~counter~0 5)} ~cond := #in~cond; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:13,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {37380#(<= ~counter~0 5)} assume !(0 == ~cond); {37380#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:13,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {37380#(<= ~counter~0 5)} assume true; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:13,689 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37380#(<= ~counter~0 5)} {37380#(<= ~counter~0 5)} #94#return; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:13,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {37380#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37380#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:13,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {37380#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:13,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {37405#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:13,691 INFO L272 TraceCheckUtils]: 59: Hoare triple {37405#(<= ~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)); {37405#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:13,691 INFO L290 TraceCheckUtils]: 60: Hoare triple {37405#(<= ~counter~0 6)} ~cond := #in~cond; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:13,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {37405#(<= ~counter~0 6)} assume !(0 == ~cond); {37405#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:13,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {37405#(<= ~counter~0 6)} assume true; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:13,692 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37405#(<= ~counter~0 6)} {37405#(<= ~counter~0 6)} #96#return; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:13,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {37405#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:13,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {37405#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:13,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {37430#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:13,694 INFO L272 TraceCheckUtils]: 67: Hoare triple {37430#(<= ~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)); {37430#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:13,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {37430#(<= ~counter~0 7)} ~cond := #in~cond; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:13,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {37430#(<= ~counter~0 7)} assume !(0 == ~cond); {37430#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:13,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {37430#(<= ~counter~0 7)} assume true; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:13,695 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37430#(<= ~counter~0 7)} {37430#(<= ~counter~0 7)} #96#return; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:13,696 INFO L290 TraceCheckUtils]: 72: Hoare triple {37430#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:13,696 INFO L290 TraceCheckUtils]: 73: Hoare triple {37430#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:13,696 INFO L290 TraceCheckUtils]: 74: Hoare triple {37455#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:13,697 INFO L272 TraceCheckUtils]: 75: Hoare triple {37455#(<= ~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)); {37455#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:13,697 INFO L290 TraceCheckUtils]: 76: Hoare triple {37455#(<= ~counter~0 8)} ~cond := #in~cond; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:13,697 INFO L290 TraceCheckUtils]: 77: Hoare triple {37455#(<= ~counter~0 8)} assume !(0 == ~cond); {37455#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:13,698 INFO L290 TraceCheckUtils]: 78: Hoare triple {37455#(<= ~counter~0 8)} assume true; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:13,698 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37455#(<= ~counter~0 8)} {37455#(<= ~counter~0 8)} #96#return; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:13,698 INFO L290 TraceCheckUtils]: 80: Hoare triple {37455#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:13,699 INFO L290 TraceCheckUtils]: 81: Hoare triple {37455#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:13,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {37480#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:13,700 INFO L272 TraceCheckUtils]: 83: Hoare triple {37480#(<= ~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)); {37480#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:13,700 INFO L290 TraceCheckUtils]: 84: Hoare triple {37480#(<= ~counter~0 9)} ~cond := #in~cond; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:13,700 INFO L290 TraceCheckUtils]: 85: Hoare triple {37480#(<= ~counter~0 9)} assume !(0 == ~cond); {37480#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:13,701 INFO L290 TraceCheckUtils]: 86: Hoare triple {37480#(<= ~counter~0 9)} assume true; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:13,701 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37480#(<= ~counter~0 9)} {37480#(<= ~counter~0 9)} #96#return; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:13,703 INFO L290 TraceCheckUtils]: 88: Hoare triple {37480#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:13,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {37480#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37505#(<= |main_#t~post7| 9)} is VALID [2022-04-08 06:04:13,704 INFO L290 TraceCheckUtils]: 90: Hoare triple {37505#(<= |main_#t~post7| 9)} assume !(#t~post7 < 50);havoc #t~post7; {37224#false} is VALID [2022-04-08 06:04:13,704 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-08 06:04:13,704 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 50);havoc #t~post8; {37224#false} is VALID [2022-04-08 06:04:13,704 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-08 06:04:13,704 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 50);havoc #t~post6; {37224#false} is VALID [2022-04-08 06:04:13,705 INFO L272 TraceCheckUtils]: 95: Hoare triple {37224#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)); {37224#false} is VALID [2022-04-08 06:04:13,705 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-08 06:04:13,705 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-08 06:04:13,705 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-08 06:04:13,705 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-08 06:04:13,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:14,297 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-08 06:04:14,297 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-08 06:04:14,297 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-08 06:04:14,297 INFO L272 TraceCheckUtils]: 95: Hoare triple {37224#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)); {37224#false} is VALID [2022-04-08 06:04:14,297 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 50);havoc #t~post6; {37224#false} is VALID [2022-04-08 06:04:14,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-08 06:04:14,297 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 50);havoc #t~post8; {37224#false} is VALID [2022-04-08 06:04:14,298 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-08 06:04:14,299 INFO L290 TraceCheckUtils]: 90: Hoare triple {37557#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {37224#false} is VALID [2022-04-08 06:04:14,300 INFO L290 TraceCheckUtils]: 89: Hoare triple {37561#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37557#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:04:14,300 INFO L290 TraceCheckUtils]: 88: Hoare triple {37561#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37561#(< ~counter~0 50)} is VALID [2022-04-08 06:04:14,301 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37223#true} {37561#(< ~counter~0 50)} #96#return; {37561#(< ~counter~0 50)} is VALID [2022-04-08 06:04:14,301 INFO L290 TraceCheckUtils]: 86: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,301 INFO L290 TraceCheckUtils]: 85: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,301 INFO L290 TraceCheckUtils]: 84: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,301 INFO L272 TraceCheckUtils]: 83: Hoare triple {37561#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,301 INFO L290 TraceCheckUtils]: 82: Hoare triple {37561#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {37561#(< ~counter~0 50)} is VALID [2022-04-08 06:04:14,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {37586#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37561#(< ~counter~0 50)} is VALID [2022-04-08 06:04:14,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {37586#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37586#(< ~counter~0 49)} is VALID [2022-04-08 06:04:14,303 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37223#true} {37586#(< ~counter~0 49)} #96#return; {37586#(< ~counter~0 49)} is VALID [2022-04-08 06:04:14,303 INFO L290 TraceCheckUtils]: 78: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,303 INFO L290 TraceCheckUtils]: 77: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,303 INFO L290 TraceCheckUtils]: 76: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,303 INFO L272 TraceCheckUtils]: 75: Hoare triple {37586#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {37586#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {37586#(< ~counter~0 49)} is VALID [2022-04-08 06:04:14,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {37611#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37586#(< ~counter~0 49)} is VALID [2022-04-08 06:04:14,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {37611#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37611#(< ~counter~0 48)} is VALID [2022-04-08 06:04:14,305 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37223#true} {37611#(< ~counter~0 48)} #96#return; {37611#(< ~counter~0 48)} is VALID [2022-04-08 06:04:14,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,305 INFO L290 TraceCheckUtils]: 69: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,305 INFO L290 TraceCheckUtils]: 68: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,305 INFO L272 TraceCheckUtils]: 67: Hoare triple {37611#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {37611#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {37611#(< ~counter~0 48)} is VALID [2022-04-08 06:04:14,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {37636#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37611#(< ~counter~0 48)} is VALID [2022-04-08 06:04:14,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {37636#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37636#(< ~counter~0 47)} is VALID [2022-04-08 06:04:14,307 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37223#true} {37636#(< ~counter~0 47)} #96#return; {37636#(< ~counter~0 47)} is VALID [2022-04-08 06:04:14,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,307 INFO L272 TraceCheckUtils]: 59: Hoare triple {37636#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {37636#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {37636#(< ~counter~0 47)} is VALID [2022-04-08 06:04:14,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {37661#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37636#(< ~counter~0 47)} is VALID [2022-04-08 06:04:14,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {37661#(< ~counter~0 46)} assume !!(0 != ~r~0); {37661#(< ~counter~0 46)} is VALID [2022-04-08 06:04:14,309 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37223#true} {37661#(< ~counter~0 46)} #94#return; {37661#(< ~counter~0 46)} is VALID [2022-04-08 06:04:14,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,309 INFO L272 TraceCheckUtils]: 51: Hoare triple {37661#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {37661#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {37661#(< ~counter~0 46)} is VALID [2022-04-08 06:04:14,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {37686#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37661#(< ~counter~0 46)} is VALID [2022-04-08 06:04:14,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {37686#(< ~counter~0 45)} assume !(~r~0 < 0); {37686#(< ~counter~0 45)} is VALID [2022-04-08 06:04:14,311 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37223#true} {37686#(< ~counter~0 45)} #98#return; {37686#(< ~counter~0 45)} is VALID [2022-04-08 06:04:14,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,311 INFO L272 TraceCheckUtils]: 43: Hoare triple {37686#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {37686#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {37686#(< ~counter~0 45)} is VALID [2022-04-08 06:04:14,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {37711#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37686#(< ~counter~0 45)} is VALID [2022-04-08 06:04:14,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {37711#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37711#(< ~counter~0 44)} is VALID [2022-04-08 06:04:14,313 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37223#true} {37711#(< ~counter~0 44)} #98#return; {37711#(< ~counter~0 44)} is VALID [2022-04-08 06:04:14,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,313 INFO L272 TraceCheckUtils]: 35: Hoare triple {37711#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {37711#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {37711#(< ~counter~0 44)} is VALID [2022-04-08 06:04:14,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {37736#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37711#(< ~counter~0 44)} is VALID [2022-04-08 06:04:14,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {37736#(< ~counter~0 43)} assume !(~r~0 > 0); {37736#(< ~counter~0 43)} is VALID [2022-04-08 06:04:14,315 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37223#true} {37736#(< ~counter~0 43)} #96#return; {37736#(< ~counter~0 43)} is VALID [2022-04-08 06:04:14,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {37736#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {37736#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {37736#(< ~counter~0 43)} is VALID [2022-04-08 06:04:14,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {37761#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37736#(< ~counter~0 43)} is VALID [2022-04-08 06:04:14,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {37761#(< ~counter~0 42)} assume !!(0 != ~r~0); {37761#(< ~counter~0 42)} is VALID [2022-04-08 06:04:14,316 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37223#true} {37761#(< ~counter~0 42)} #94#return; {37761#(< ~counter~0 42)} is VALID [2022-04-08 06:04:14,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,317 INFO L272 TraceCheckUtils]: 19: Hoare triple {37761#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {37761#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {37761#(< ~counter~0 42)} is VALID [2022-04-08 06:04:14,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {37786#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37761#(< ~counter~0 42)} is VALID [2022-04-08 06:04:14,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {37786#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37786#(< ~counter~0 41)} is VALID [2022-04-08 06:04:14,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37223#true} {37786#(< ~counter~0 41)} #92#return; {37786#(< ~counter~0 41)} is VALID [2022-04-08 06:04:14,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,319 INFO L272 TraceCheckUtils]: 11: Hoare triple {37786#(< ~counter~0 41)} 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)); {37223#true} is VALID [2022-04-08 06:04:14,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37223#true} {37786#(< ~counter~0 41)} #90#return; {37786#(< ~counter~0 41)} is VALID [2022-04-08 06:04:14,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 06:04:14,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 06:04:14,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 06:04:14,319 INFO L272 TraceCheckUtils]: 6: Hoare triple {37786#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37223#true} is VALID [2022-04-08 06:04:14,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {37786#(< ~counter~0 41)} 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; {37786#(< ~counter~0 41)} is VALID [2022-04-08 06:04:14,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {37786#(< ~counter~0 41)} call #t~ret9 := main(); {37786#(< ~counter~0 41)} is VALID [2022-04-08 06:04:14,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37786#(< ~counter~0 41)} {37223#true} #102#return; {37786#(< ~counter~0 41)} is VALID [2022-04-08 06:04:14,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {37786#(< ~counter~0 41)} assume true; {37786#(< ~counter~0 41)} is VALID [2022-04-08 06:04:14,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {37223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37786#(< ~counter~0 41)} is VALID [2022-04-08 06:04:14,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-08 06:04:14,321 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-08 06:04:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:14,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151349629] [2022-04-08 06:04:14,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:14,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995575905] [2022-04-08 06:04:14,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995575905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:14,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:14,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 06:04:14,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:14,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378078135] [2022-04-08 06:04:14,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378078135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:14,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:14,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:04:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879313351] [2022-04-08 06:04:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:14,323 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-08 06:04:14,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:14,323 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-08 06:04:14,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:14,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:04:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:14,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:04:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 06:04:14,392 INFO L87 Difference]: Start difference. First operand 352 states and 468 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-08 06:04:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:15,547 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-08 06:04:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 06:04:15,547 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-08 06:04:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:15,547 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-08 06:04:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 06:04:15,550 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-08 06:04:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 06:04:15,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-08 06:04:15,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:15,767 INFO L225 Difference]: With dead ends: 471 [2022-04-08 06:04:15,767 INFO L226 Difference]: Without dead ends: 364 [2022-04-08 06:04:15,768 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-08 06:04:15,768 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:15,769 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 238 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:04:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-08 06:04:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-08 06:04:16,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:16,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:16,335 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:16,335 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:16,341 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 06:04:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:04:16,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:16,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:16,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-08 06:04:16,343 INFO L87 Difference]: Start difference. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-08 06:04:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:16,351 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 06:04:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:04:16,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:16,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:16,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:16,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:04:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-08 06:04:16,363 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-08 06:04:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:16,364 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-08 06:04:16,364 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-08 06:04:16,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-08 06:04:19,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 479 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:04:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 06:04:19,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:19,442 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-08 06:04:19,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 06:04:19,643 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-08 06:04:19,643 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-08 06:04:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:19,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1559986211] [2022-04-08 06:04:19,644 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-08 06:04:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848514249] [2022-04-08 06:04:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:19,662 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:19,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006522744] [2022-04-08 06:04:19,663 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:04:19,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:19,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:19,664 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:19,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 06:04:19,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:04:19,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:19,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 06:04:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:19,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:20,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-08 06:04:20,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {40254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40262#(<= ~counter~0 0)} {40254#true} #102#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {40262#(<= ~counter~0 0)} call #t~ret9 := main(); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {40262#(<= ~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; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,367 INFO L272 TraceCheckUtils]: 6: Hoare triple {40262#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #90#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,369 INFO L272 TraceCheckUtils]: 11: Hoare triple {40262#(<= ~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)); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,370 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #92#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {40262#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:20,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {40262#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:20,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {40311#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:20,373 INFO L272 TraceCheckUtils]: 19: Hoare triple {40311#(<= ~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)); {40311#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:20,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {40311#(<= ~counter~0 1)} ~cond := #in~cond; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:20,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {40311#(<= ~counter~0 1)} assume !(0 == ~cond); {40311#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:20,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {40311#(<= ~counter~0 1)} assume true; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:20,374 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40311#(<= ~counter~0 1)} {40311#(<= ~counter~0 1)} #94#return; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:20,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {40311#(<= ~counter~0 1)} assume !!(0 != ~r~0); {40311#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:20,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {40311#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:20,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {40336#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:20,376 INFO L272 TraceCheckUtils]: 27: Hoare triple {40336#(<= ~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)); {40336#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:20,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {40336#(<= ~counter~0 2)} ~cond := #in~cond; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:20,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {40336#(<= ~counter~0 2)} assume !(0 == ~cond); {40336#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:20,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {40336#(<= ~counter~0 2)} assume true; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:20,377 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40336#(<= ~counter~0 2)} {40336#(<= ~counter~0 2)} #96#return; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:20,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {40336#(<= ~counter~0 2)} assume !(~r~0 > 0); {40336#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:20,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {40336#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:20,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {40361#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:20,379 INFO L272 TraceCheckUtils]: 35: Hoare triple {40361#(<= ~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)); {40361#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:20,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {40361#(<= ~counter~0 3)} ~cond := #in~cond; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:20,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {40361#(<= ~counter~0 3)} assume !(0 == ~cond); {40361#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:20,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {40361#(<= ~counter~0 3)} assume true; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:20,380 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40361#(<= ~counter~0 3)} {40361#(<= ~counter~0 3)} #98#return; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:20,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {40361#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:20,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {40361#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:20,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {40386#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:20,382 INFO L272 TraceCheckUtils]: 43: Hoare triple {40386#(<= ~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)); {40386#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:20,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {40386#(<= ~counter~0 4)} ~cond := #in~cond; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:20,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {40386#(<= ~counter~0 4)} assume !(0 == ~cond); {40386#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:20,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {40386#(<= ~counter~0 4)} assume true; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:20,383 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40386#(<= ~counter~0 4)} {40386#(<= ~counter~0 4)} #98#return; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:20,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {40386#(<= ~counter~0 4)} assume !(~r~0 < 0); {40386#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:20,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {40386#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:20,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {40411#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:20,385 INFO L272 TraceCheckUtils]: 51: Hoare triple {40411#(<= ~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)); {40411#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:20,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {40411#(<= ~counter~0 5)} ~cond := #in~cond; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:20,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {40411#(<= ~counter~0 5)} assume !(0 == ~cond); {40411#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:20,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {40411#(<= ~counter~0 5)} assume true; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:20,386 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40411#(<= ~counter~0 5)} {40411#(<= ~counter~0 5)} #94#return; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:20,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {40411#(<= ~counter~0 5)} assume !!(0 != ~r~0); {40411#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:20,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {40411#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:20,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {40436#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:20,388 INFO L272 TraceCheckUtils]: 59: Hoare triple {40436#(<= ~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)); {40436#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:20,388 INFO L290 TraceCheckUtils]: 60: Hoare triple {40436#(<= ~counter~0 6)} ~cond := #in~cond; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:20,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {40436#(<= ~counter~0 6)} assume !(0 == ~cond); {40436#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:20,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {40436#(<= ~counter~0 6)} assume true; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:20,389 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40436#(<= ~counter~0 6)} {40436#(<= ~counter~0 6)} #96#return; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:20,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {40436#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:20,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {40436#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:20,390 INFO L290 TraceCheckUtils]: 66: Hoare triple {40461#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:20,390 INFO L272 TraceCheckUtils]: 67: Hoare triple {40461#(<= ~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)); {40461#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:20,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {40461#(<= ~counter~0 7)} ~cond := #in~cond; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:20,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {40461#(<= ~counter~0 7)} assume !(0 == ~cond); {40461#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:20,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {40461#(<= ~counter~0 7)} assume true; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:20,392 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40461#(<= ~counter~0 7)} {40461#(<= ~counter~0 7)} #96#return; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:20,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {40461#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:20,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {40461#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:20,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {40486#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:20,393 INFO L272 TraceCheckUtils]: 75: Hoare triple {40486#(<= ~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)); {40486#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:20,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {40486#(<= ~counter~0 8)} ~cond := #in~cond; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:20,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {40486#(<= ~counter~0 8)} assume !(0 == ~cond); {40486#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:20,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {40486#(<= ~counter~0 8)} assume true; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:20,395 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40486#(<= ~counter~0 8)} {40486#(<= ~counter~0 8)} #96#return; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:20,395 INFO L290 TraceCheckUtils]: 80: Hoare triple {40486#(<= ~counter~0 8)} assume !(~r~0 > 0); {40486#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:20,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {40486#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:20,396 INFO L290 TraceCheckUtils]: 82: Hoare triple {40511#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:20,396 INFO L272 TraceCheckUtils]: 83: Hoare triple {40511#(<= ~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)); {40511#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:20,396 INFO L290 TraceCheckUtils]: 84: Hoare triple {40511#(<= ~counter~0 9)} ~cond := #in~cond; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:20,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {40511#(<= ~counter~0 9)} assume !(0 == ~cond); {40511#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:20,397 INFO L290 TraceCheckUtils]: 86: Hoare triple {40511#(<= ~counter~0 9)} assume true; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:20,397 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40511#(<= ~counter~0 9)} {40511#(<= ~counter~0 9)} #98#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:20,398 INFO L290 TraceCheckUtils]: 88: Hoare triple {40511#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:20,398 INFO L290 TraceCheckUtils]: 89: Hoare triple {40511#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:20,399 INFO L290 TraceCheckUtils]: 90: Hoare triple {40536#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:20,399 INFO L272 TraceCheckUtils]: 91: Hoare triple {40536#(<= ~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)); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:20,399 INFO L290 TraceCheckUtils]: 92: Hoare triple {40536#(<= ~counter~0 10)} ~cond := #in~cond; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:20,400 INFO L290 TraceCheckUtils]: 93: Hoare triple {40536#(<= ~counter~0 10)} assume !(0 == ~cond); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:20,400 INFO L290 TraceCheckUtils]: 94: Hoare triple {40536#(<= ~counter~0 10)} assume true; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:20,400 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40536#(<= ~counter~0 10)} {40536#(<= ~counter~0 10)} #98#return; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:20,401 INFO L290 TraceCheckUtils]: 96: Hoare triple {40536#(<= ~counter~0 10)} assume !(~r~0 < 0); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:20,401 INFO L290 TraceCheckUtils]: 97: Hoare triple {40536#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40561#(<= |main_#t~post6| 10)} is VALID [2022-04-08 06:04:20,401 INFO L290 TraceCheckUtils]: 98: Hoare triple {40561#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {40255#false} is VALID [2022-04-08 06:04:20,401 INFO L272 TraceCheckUtils]: 99: Hoare triple {40255#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)); {40255#false} is VALID [2022-04-08 06:04:20,401 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-08 06:04:20,402 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-08 06:04:20,402 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-08 06:04:20,402 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-08 06:04:20,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:20,995 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-08 06:04:20,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-08 06:04:20,996 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-08 06:04:20,996 INFO L272 TraceCheckUtils]: 99: Hoare triple {40255#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)); {40255#false} is VALID [2022-04-08 06:04:20,996 INFO L290 TraceCheckUtils]: 98: Hoare triple {40589#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {40255#false} is VALID [2022-04-08 06:04:20,996 INFO L290 TraceCheckUtils]: 97: Hoare triple {40593#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40589#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:04:20,997 INFO L290 TraceCheckUtils]: 96: Hoare triple {40593#(< ~counter~0 50)} assume !(~r~0 < 0); {40593#(< ~counter~0 50)} is VALID [2022-04-08 06:04:20,997 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40254#true} {40593#(< ~counter~0 50)} #98#return; {40593#(< ~counter~0 50)} is VALID [2022-04-08 06:04:20,997 INFO L290 TraceCheckUtils]: 94: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:20,997 INFO L290 TraceCheckUtils]: 93: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:20,997 INFO L290 TraceCheckUtils]: 92: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:20,997 INFO L272 TraceCheckUtils]: 91: Hoare triple {40593#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:20,998 INFO L290 TraceCheckUtils]: 90: Hoare triple {40593#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {40593#(< ~counter~0 50)} is VALID [2022-04-08 06:04:20,999 INFO L290 TraceCheckUtils]: 89: Hoare triple {40618#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40593#(< ~counter~0 50)} is VALID [2022-04-08 06:04:20,999 INFO L290 TraceCheckUtils]: 88: Hoare triple {40618#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40618#(< ~counter~0 49)} is VALID [2022-04-08 06:04:21,000 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40254#true} {40618#(< ~counter~0 49)} #98#return; {40618#(< ~counter~0 49)} is VALID [2022-04-08 06:04:21,000 INFO L290 TraceCheckUtils]: 86: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,000 INFO L290 TraceCheckUtils]: 85: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,000 INFO L290 TraceCheckUtils]: 84: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,000 INFO L272 TraceCheckUtils]: 83: Hoare triple {40618#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,000 INFO L290 TraceCheckUtils]: 82: Hoare triple {40618#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {40618#(< ~counter~0 49)} is VALID [2022-04-08 06:04:21,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {40643#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40618#(< ~counter~0 49)} is VALID [2022-04-08 06:04:21,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {40643#(< ~counter~0 48)} assume !(~r~0 > 0); {40643#(< ~counter~0 48)} is VALID [2022-04-08 06:04:21,002 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40254#true} {40643#(< ~counter~0 48)} #96#return; {40643#(< ~counter~0 48)} is VALID [2022-04-08 06:04:21,002 INFO L290 TraceCheckUtils]: 78: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,002 INFO L272 TraceCheckUtils]: 75: Hoare triple {40643#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,002 INFO L290 TraceCheckUtils]: 74: Hoare triple {40643#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {40643#(< ~counter~0 48)} is VALID [2022-04-08 06:04:21,003 INFO L290 TraceCheckUtils]: 73: Hoare triple {40668#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40643#(< ~counter~0 48)} is VALID [2022-04-08 06:04:21,003 INFO L290 TraceCheckUtils]: 72: Hoare triple {40668#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40668#(< ~counter~0 47)} is VALID [2022-04-08 06:04:21,004 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40254#true} {40668#(< ~counter~0 47)} #96#return; {40668#(< ~counter~0 47)} is VALID [2022-04-08 06:04:21,004 INFO L290 TraceCheckUtils]: 70: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,004 INFO L272 TraceCheckUtils]: 67: Hoare triple {40668#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,004 INFO L290 TraceCheckUtils]: 66: Hoare triple {40668#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {40668#(< ~counter~0 47)} is VALID [2022-04-08 06:04:21,005 INFO L290 TraceCheckUtils]: 65: Hoare triple {40693#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40668#(< ~counter~0 47)} is VALID [2022-04-08 06:04:21,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {40693#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40693#(< ~counter~0 46)} is VALID [2022-04-08 06:04:21,006 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40254#true} {40693#(< ~counter~0 46)} #96#return; {40693#(< ~counter~0 46)} is VALID [2022-04-08 06:04:21,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,006 INFO L272 TraceCheckUtils]: 59: Hoare triple {40693#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {40693#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {40693#(< ~counter~0 46)} is VALID [2022-04-08 06:04:21,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {40718#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40693#(< ~counter~0 46)} is VALID [2022-04-08 06:04:21,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {40718#(< ~counter~0 45)} assume !!(0 != ~r~0); {40718#(< ~counter~0 45)} is VALID [2022-04-08 06:04:21,008 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40254#true} {40718#(< ~counter~0 45)} #94#return; {40718#(< ~counter~0 45)} is VALID [2022-04-08 06:04:21,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,008 INFO L272 TraceCheckUtils]: 51: Hoare triple {40718#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {40718#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {40718#(< ~counter~0 45)} is VALID [2022-04-08 06:04:21,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {40743#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40718#(< ~counter~0 45)} is VALID [2022-04-08 06:04:21,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {40743#(< ~counter~0 44)} assume !(~r~0 < 0); {40743#(< ~counter~0 44)} is VALID [2022-04-08 06:04:21,010 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40254#true} {40743#(< ~counter~0 44)} #98#return; {40743#(< ~counter~0 44)} is VALID [2022-04-08 06:04:21,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,010 INFO L272 TraceCheckUtils]: 43: Hoare triple {40743#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {40743#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {40743#(< ~counter~0 44)} is VALID [2022-04-08 06:04:21,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {40768#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40743#(< ~counter~0 44)} is VALID [2022-04-08 06:04:21,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {40768#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40768#(< ~counter~0 43)} is VALID [2022-04-08 06:04:21,012 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40254#true} {40768#(< ~counter~0 43)} #98#return; {40768#(< ~counter~0 43)} is VALID [2022-04-08 06:04:21,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,012 INFO L272 TraceCheckUtils]: 35: Hoare triple {40768#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {40768#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {40768#(< ~counter~0 43)} is VALID [2022-04-08 06:04:21,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {40793#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40768#(< ~counter~0 43)} is VALID [2022-04-08 06:04:21,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {40793#(< ~counter~0 42)} assume !(~r~0 > 0); {40793#(< ~counter~0 42)} is VALID [2022-04-08 06:04:21,014 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40254#true} {40793#(< ~counter~0 42)} #96#return; {40793#(< ~counter~0 42)} is VALID [2022-04-08 06:04:21,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,014 INFO L272 TraceCheckUtils]: 27: Hoare triple {40793#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {40793#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {40793#(< ~counter~0 42)} is VALID [2022-04-08 06:04:21,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {40818#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40793#(< ~counter~0 42)} is VALID [2022-04-08 06:04:21,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {40818#(< ~counter~0 41)} assume !!(0 != ~r~0); {40818#(< ~counter~0 41)} is VALID [2022-04-08 06:04:21,016 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40254#true} {40818#(< ~counter~0 41)} #94#return; {40818#(< ~counter~0 41)} is VALID [2022-04-08 06:04:21,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,016 INFO L272 TraceCheckUtils]: 19: Hoare triple {40818#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {40818#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {40818#(< ~counter~0 41)} is VALID [2022-04-08 06:04:21,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {40843#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40818#(< ~counter~0 41)} is VALID [2022-04-08 06:04:21,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {40843#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40843#(< ~counter~0 40)} is VALID [2022-04-08 06:04:21,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40254#true} {40843#(< ~counter~0 40)} #92#return; {40843#(< ~counter~0 40)} is VALID [2022-04-08 06:04:21,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,018 INFO L272 TraceCheckUtils]: 11: Hoare triple {40843#(< ~counter~0 40)} 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)); {40254#true} is VALID [2022-04-08 06:04:21,019 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40254#true} {40843#(< ~counter~0 40)} #90#return; {40843#(< ~counter~0 40)} is VALID [2022-04-08 06:04:21,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 06:04:21,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 06:04:21,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 06:04:21,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {40843#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40254#true} is VALID [2022-04-08 06:04:21,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {40843#(< ~counter~0 40)} 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; {40843#(< ~counter~0 40)} is VALID [2022-04-08 06:04:21,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {40843#(< ~counter~0 40)} call #t~ret9 := main(); {40843#(< ~counter~0 40)} is VALID [2022-04-08 06:04:21,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40843#(< ~counter~0 40)} {40254#true} #102#return; {40843#(< ~counter~0 40)} is VALID [2022-04-08 06:04:21,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {40843#(< ~counter~0 40)} assume true; {40843#(< ~counter~0 40)} is VALID [2022-04-08 06:04:21,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {40254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40843#(< ~counter~0 40)} is VALID [2022-04-08 06:04:21,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-08 06:04:21,021 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-08 06:04:21,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848514249] [2022-04-08 06:04:21,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006522744] [2022-04-08 06:04:21,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006522744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:21,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:21,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 06:04:21,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:21,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1559986211] [2022-04-08 06:04:21,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1559986211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:21,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:21,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 06:04:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127416144] [2022-04-08 06:04:21,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:21,022 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-08 06:04:21,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:21,023 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-08 06:04:21,105 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-08 06:04:21,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 06:04:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:21,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 06:04:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:04:21,106 INFO L87 Difference]: Start difference. First operand 364 states and 480 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-08 06:04:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:22,507 INFO L93 Difference]: Finished difference Result 407 states and 538 transitions. [2022-04-08 06:04:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 06:04:22,507 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-08 06:04:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:22,508 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-08 06:04:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-08 06:04:22,509 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-08 06:04:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-08 06:04:22,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-08 06:04:22,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:22,699 INFO L225 Difference]: With dead ends: 407 [2022-04-08 06:04:22,699 INFO L226 Difference]: Without dead ends: 396 [2022-04-08 06:04:22,700 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-08 06:04:22,700 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 146 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:22,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 250 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:04:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-08 06:04:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2022-04-08 06:04:23,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:23,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 06:04:23,306 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 06:04:23,307 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 06:04:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:23,317 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-08 06:04:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-08 06:04:23,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:23,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:23,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-08 06:04:23,319 INFO L87 Difference]: Start difference. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-08 06:04:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:23,329 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-08 06:04:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-08 06:04:23,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:23,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:23,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:23,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 06:04:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2022-04-08 06:04:23,342 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 103 [2022-04-08 06:04:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:23,343 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2022-04-08 06:04:23,343 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-08 06:04:23,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 501 transitions. [2022-04-08 06:04:25,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2022-04-08 06:04:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 06:04:25,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:25,784 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-08 06:04:25,800 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-08 06:04:25,987 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-08 06:04:25,987 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:25,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-08 06:04:25,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:25,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315494734] [2022-04-08 06:04:25,988 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-08 06:04:25,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:25,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913386671] [2022-04-08 06:04:25,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:25,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:26,000 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:26,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783597912] [2022-04-08 06:04:26,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:04:26,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:26,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:26,001 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:26,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 06:04:26,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:04:26,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:26,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:04:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:26,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:26,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {43271#true} call ULTIMATE.init(); {43271#true} is VALID [2022-04-08 06:04:26,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {43271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43271#true} is VALID [2022-04-08 06:04:26,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43271#true} {43271#true} #102#return; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {43271#true} call #t~ret9 := main(); {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {43271#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; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {43271#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43271#true} {43271#true} #90#return; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L272 TraceCheckUtils]: 11: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43271#true} {43271#true} #92#return; {43271#true} is VALID [2022-04-08 06:04:26,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {43271#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {43271#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {43271#true} assume !!(#t~post6 < 50);havoc #t~post6; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L272 TraceCheckUtils]: 19: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43271#true} {43271#true} #94#return; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {43271#true} assume !!(0 != ~r~0); {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {43271#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {43271#true} assume !!(#t~post7 < 50);havoc #t~post7; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L272 TraceCheckUtils]: 27: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,867 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43271#true} {43271#true} #96#return; {43271#true} is VALID [2022-04-08 06:04:26,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {43271#true} assume !(~r~0 > 0); {43271#true} is VALID [2022-04-08 06:04:26,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {43271#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43271#true} is VALID [2022-04-08 06:04:26,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {43271#true} assume !!(#t~post8 < 50);havoc #t~post8; {43271#true} is VALID [2022-04-08 06:04:26,868 INFO L272 TraceCheckUtils]: 35: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-08 06:04:26,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,868 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43271#true} {43271#true} #98#return; {43271#true} is VALID [2022-04-08 06:04:26,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {43271#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,870 INFO L272 TraceCheckUtils]: 43: Hoare triple {43396#(< (+ 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)); {43271#true} is VALID [2022-04-08 06:04:26,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,871 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #98#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,872 INFO L272 TraceCheckUtils]: 51: Hoare triple {43396#(< (+ 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)); {43271#true} is VALID [2022-04-08 06:04:26,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,872 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #94#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,873 INFO L272 TraceCheckUtils]: 59: Hoare triple {43396#(< (+ 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)); {43271#true} is VALID [2022-04-08 06:04:26,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,874 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #96#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:04:26,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 06:04:26,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 06:04:26,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 06:04:26,875 INFO L272 TraceCheckUtils]: 67: Hoare triple {43469#(< (+ 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)); {43271#true} is VALID [2022-04-08 06:04:26,875 INFO L290 TraceCheckUtils]: 68: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,875 INFO L290 TraceCheckUtils]: 69: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,876 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43271#true} {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 06:04:26,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:26,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:26,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:26,877 INFO L272 TraceCheckUtils]: 75: Hoare triple {43494#(< 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)); {43271#true} is VALID [2022-04-08 06:04:26,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,878 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43271#true} {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:26,878 INFO L290 TraceCheckUtils]: 80: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:26,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:26,879 INFO L290 TraceCheckUtils]: 82: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:26,879 INFO L272 TraceCheckUtils]: 83: Hoare triple {43494#(< 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)); {43271#true} is VALID [2022-04-08 06:04:26,879 INFO L290 TraceCheckUtils]: 84: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,879 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43271#true} {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:26,880 INFO L290 TraceCheckUtils]: 88: Hoare triple {43494#(< 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; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 06:04:26,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 06:04:26,881 INFO L290 TraceCheckUtils]: 90: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 06:04:26,881 INFO L272 TraceCheckUtils]: 91: Hoare triple {43543#(< 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)); {43271#true} is VALID [2022-04-08 06:04:26,881 INFO L290 TraceCheckUtils]: 92: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:26,881 INFO L290 TraceCheckUtils]: 93: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:26,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:26,881 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43271#true} {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 06:04:26,882 INFO L290 TraceCheckUtils]: 96: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43272#false} is VALID [2022-04-08 06:04:26,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {43272#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43272#false} is VALID [2022-04-08 06:04:26,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {43272#false} assume !(#t~post8 < 50);havoc #t~post8; {43272#false} is VALID [2022-04-08 06:04:26,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {43272#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43272#false} is VALID [2022-04-08 06:04:26,883 INFO L290 TraceCheckUtils]: 100: Hoare triple {43272#false} assume !(#t~post6 < 50);havoc #t~post6; {43272#false} is VALID [2022-04-08 06:04:26,883 INFO L272 TraceCheckUtils]: 101: Hoare triple {43272#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)); {43272#false} is VALID [2022-04-08 06:04:26,883 INFO L290 TraceCheckUtils]: 102: Hoare triple {43272#false} ~cond := #in~cond; {43272#false} is VALID [2022-04-08 06:04:26,883 INFO L290 TraceCheckUtils]: 103: Hoare triple {43272#false} assume 0 == ~cond; {43272#false} is VALID [2022-04-08 06:04:26,883 INFO L290 TraceCheckUtils]: 104: Hoare triple {43272#false} assume !false; {43272#false} is VALID [2022-04-08 06:04:26,883 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-08 06:04:26,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:27,328 INFO L290 TraceCheckUtils]: 104: Hoare triple {43272#false} assume !false; {43272#false} is VALID [2022-04-08 06:04:27,328 INFO L290 TraceCheckUtils]: 103: Hoare triple {43272#false} assume 0 == ~cond; {43272#false} is VALID [2022-04-08 06:04:27,328 INFO L290 TraceCheckUtils]: 102: Hoare triple {43272#false} ~cond := #in~cond; {43272#false} is VALID [2022-04-08 06:04:27,328 INFO L272 TraceCheckUtils]: 101: Hoare triple {43272#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)); {43272#false} is VALID [2022-04-08 06:04:27,328 INFO L290 TraceCheckUtils]: 100: Hoare triple {43272#false} assume !(#t~post6 < 50);havoc #t~post6; {43272#false} is VALID [2022-04-08 06:04:27,328 INFO L290 TraceCheckUtils]: 99: Hoare triple {43272#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43272#false} is VALID [2022-04-08 06:04:27,328 INFO L290 TraceCheckUtils]: 98: Hoare triple {43272#false} assume !(#t~post8 < 50);havoc #t~post8; {43272#false} is VALID [2022-04-08 06:04:27,328 INFO L290 TraceCheckUtils]: 97: Hoare triple {43272#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43272#false} is VALID [2022-04-08 06:04:27,329 INFO L290 TraceCheckUtils]: 96: Hoare triple {43616#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43272#false} is VALID [2022-04-08 06:04:27,329 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43271#true} {43616#(not (< main_~r~0 0))} #98#return; {43616#(not (< main_~r~0 0))} is VALID [2022-04-08 06:04:27,329 INFO L290 TraceCheckUtils]: 94: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,330 INFO L290 TraceCheckUtils]: 93: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,330 INFO L290 TraceCheckUtils]: 92: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,330 INFO L272 TraceCheckUtils]: 91: Hoare triple {43616#(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)); {43271#true} is VALID [2022-04-08 06:04:27,330 INFO L290 TraceCheckUtils]: 90: Hoare triple {43616#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {43616#(not (< main_~r~0 0))} is VALID [2022-04-08 06:04:27,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {43616#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43616#(not (< main_~r~0 0))} is VALID [2022-04-08 06:04:27,331 INFO L290 TraceCheckUtils]: 88: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43616#(not (< main_~r~0 0))} is VALID [2022-04-08 06:04:27,332 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43271#true} {43641#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:27,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,332 INFO L272 TraceCheckUtils]: 83: Hoare triple {43641#(<= 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)); {43271#true} is VALID [2022-04-08 06:04:27,333 INFO L290 TraceCheckUtils]: 82: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:27,333 INFO L290 TraceCheckUtils]: 81: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:27,333 INFO L290 TraceCheckUtils]: 80: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:27,334 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43271#true} {43641#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:27,351 INFO L290 TraceCheckUtils]: 78: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,351 INFO L290 TraceCheckUtils]: 77: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,351 INFO L290 TraceCheckUtils]: 76: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,351 INFO L272 TraceCheckUtils]: 75: Hoare triple {43641#(<= 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)); {43271#true} is VALID [2022-04-08 06:04:27,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:27,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:27,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {43690#(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; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:27,355 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43271#true} {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:04:27,355 INFO L290 TraceCheckUtils]: 70: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,355 INFO L290 TraceCheckUtils]: 69: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,355 INFO L272 TraceCheckUtils]: 67: Hoare triple {43690#(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)); {43271#true} is VALID [2022-04-08 06:04:27,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:04:27,356 INFO L290 TraceCheckUtils]: 65: Hoare triple {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:04:27,357 INFO L290 TraceCheckUtils]: 64: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:04:27,358 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #96#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,358 INFO L272 TraceCheckUtils]: 59: Hoare triple {43715#(<= 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)); {43271#true} is VALID [2022-04-08 06:04:27,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,360 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #94#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,360 INFO L272 TraceCheckUtils]: 51: Hoare triple {43715#(<= 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)); {43271#true} is VALID [2022-04-08 06:04:27,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,361 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #98#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,362 INFO L272 TraceCheckUtils]: 43: Hoare triple {43715#(<= 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)); {43271#true} is VALID [2022-04-08 06:04:27,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {43271#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:27,363 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43271#true} {43271#true} #98#return; {43271#true} is VALID [2022-04-08 06:04:27,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L272 TraceCheckUtils]: 35: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {43271#true} assume !!(#t~post8 < 50);havoc #t~post8; {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {43271#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {43271#true} assume !(~r~0 > 0); {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43271#true} {43271#true} #96#return; {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,364 INFO L272 TraceCheckUtils]: 27: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {43271#true} assume !!(#t~post7 < 50);havoc #t~post7; {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {43271#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {43271#true} assume !!(0 != ~r~0); {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43271#true} {43271#true} #94#return; {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L272 TraceCheckUtils]: 19: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {43271#true} assume !!(#t~post6 < 50);havoc #t~post6; {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {43271#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43271#true} is VALID [2022-04-08 06:04:27,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {43271#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43271#true} {43271#true} #92#return; {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L272 TraceCheckUtils]: 11: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43271#true} {43271#true} #90#return; {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {43271#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43271#true} is VALID [2022-04-08 06:04:27,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {43271#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; {43271#true} is VALID [2022-04-08 06:04:27,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {43271#true} call #t~ret9 := main(); {43271#true} is VALID [2022-04-08 06:04:27,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43271#true} {43271#true} #102#return; {43271#true} is VALID [2022-04-08 06:04:27,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-08 06:04:27,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {43271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43271#true} is VALID [2022-04-08 06:04:27,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {43271#true} call ULTIMATE.init(); {43271#true} is VALID [2022-04-08 06:04:27,367 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-08 06:04:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:27,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913386671] [2022-04-08 06:04:27,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:27,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783597912] [2022-04-08 06:04:27,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783597912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:27,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:27,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 06:04:27,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:27,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315494734] [2022-04-08 06:04:27,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315494734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:27,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:27,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:04:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607763281] [2022-04-08 06:04:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:27,370 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-08 06:04:27,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:27,371 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-08 06:04:27,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:27,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:04:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:27,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:04:27,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:04:27,440 INFO L87 Difference]: Start difference. First operand 377 states and 501 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-08 06:04:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:29,272 INFO L93 Difference]: Finished difference Result 649 states and 907 transitions. [2022-04-08 06:04:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:04:29,272 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-08 06:04:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:29,273 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-08 06:04:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-08 06:04:29,274 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-08 06:04:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-08 06:04:29,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-08 06:04:29,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:29,452 INFO L225 Difference]: With dead ends: 649 [2022-04-08 06:04:29,453 INFO L226 Difference]: Without dead ends: 588 [2022-04-08 06:04:29,453 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-08 06:04:29,454 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 38 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:29,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 280 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:04:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-08 06:04:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 504. [2022-04-08 06:04:30,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:30,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:30,500 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:30,500 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:30,521 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-08 06:04:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-08 06:04:30,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:30,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:30,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-08 06:04:30,524 INFO L87 Difference]: Start difference. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-08 06:04:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:30,546 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-08 06:04:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-08 06:04:30,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:30,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:30,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:30,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 695 transitions. [2022-04-08 06:04:30,568 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 695 transitions. Word has length 105 [2022-04-08 06:04:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:30,569 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 695 transitions. [2022-04-08 06:04:30,569 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-08 06:04:30,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 695 transitions. [2022-04-08 06:04:33,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 694 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 695 transitions. [2022-04-08 06:04:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 06:04:33,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:33,935 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-08 06:04:33,951 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-08 06:04:34,135 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-08 06:04:34,136 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:34,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-08 06:04:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:34,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184744679] [2022-04-08 06:04:34,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-08 06:04:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:34,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849568174] [2022-04-08 06:04:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:34,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:34,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019723899] [2022-04-08 06:04:34,148 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:04:34,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:34,149 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-08 06:04:34,162 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-08 06:04:34,273 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:04:34,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:34,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 06:04:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:34,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:34,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {47398#true} call ULTIMATE.init(); {47398#true} is VALID [2022-04-08 06:04:34,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {47398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47406#(<= ~counter~0 0)} {47398#true} #102#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {47406#(<= ~counter~0 0)} call #t~ret9 := main(); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {47406#(<= ~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; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {47406#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {47406#(<= ~counter~0 0)} ~cond := #in~cond; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {47406#(<= ~counter~0 0)} assume !(0 == ~cond); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47406#(<= ~counter~0 0)} {47406#(<= ~counter~0 0)} #90#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,837 INFO L272 TraceCheckUtils]: 11: Hoare triple {47406#(<= ~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)); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {47406#(<= ~counter~0 0)} ~cond := #in~cond; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {47406#(<= ~counter~0 0)} assume !(0 == ~cond); {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,839 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47406#(<= ~counter~0 0)} {47406#(<= ~counter~0 0)} #92#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {47406#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47406#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:34,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {47406#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:34,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {47455#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:34,841 INFO L272 TraceCheckUtils]: 19: Hoare triple {47455#(<= ~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)); {47455#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:34,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {47455#(<= ~counter~0 1)} ~cond := #in~cond; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:34,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {47455#(<= ~counter~0 1)} assume !(0 == ~cond); {47455#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:34,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {47455#(<= ~counter~0 1)} assume true; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:34,843 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47455#(<= ~counter~0 1)} {47455#(<= ~counter~0 1)} #94#return; {47455#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:34,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {47455#(<= ~counter~0 1)} assume !!(0 != ~r~0); {47455#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:34,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {47455#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:34,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {47480#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:34,846 INFO L272 TraceCheckUtils]: 27: Hoare triple {47480#(<= ~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)); {47480#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:34,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {47480#(<= ~counter~0 2)} ~cond := #in~cond; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:34,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {47480#(<= ~counter~0 2)} assume !(0 == ~cond); {47480#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:34,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {47480#(<= ~counter~0 2)} assume true; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:34,848 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47480#(<= ~counter~0 2)} {47480#(<= ~counter~0 2)} #96#return; {47480#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:34,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {47480#(<= ~counter~0 2)} assume !(~r~0 > 0); {47480#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:34,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {47480#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:34,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {47505#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:34,850 INFO L272 TraceCheckUtils]: 35: Hoare triple {47505#(<= ~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)); {47505#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:34,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {47505#(<= ~counter~0 3)} ~cond := #in~cond; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:34,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {47505#(<= ~counter~0 3)} assume !(0 == ~cond); {47505#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:34,851 INFO L290 TraceCheckUtils]: 38: Hoare triple {47505#(<= ~counter~0 3)} assume true; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:34,852 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47505#(<= ~counter~0 3)} {47505#(<= ~counter~0 3)} #98#return; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:34,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {47505#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47505#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:34,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {47505#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:34,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {47530#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:34,855 INFO L272 TraceCheckUtils]: 43: Hoare triple {47530#(<= ~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)); {47530#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:34,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {47530#(<= ~counter~0 4)} ~cond := #in~cond; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:34,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {47530#(<= ~counter~0 4)} assume !(0 == ~cond); {47530#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:34,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {47530#(<= ~counter~0 4)} assume true; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:34,856 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47530#(<= ~counter~0 4)} {47530#(<= ~counter~0 4)} #98#return; {47530#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:34,857 INFO L290 TraceCheckUtils]: 48: Hoare triple {47530#(<= ~counter~0 4)} assume !(~r~0 < 0); {47530#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:34,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {47530#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:34,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {47555#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:34,859 INFO L272 TraceCheckUtils]: 51: Hoare triple {47555#(<= ~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)); {47555#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:34,859 INFO L290 TraceCheckUtils]: 52: Hoare triple {47555#(<= ~counter~0 5)} ~cond := #in~cond; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:34,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {47555#(<= ~counter~0 5)} assume !(0 == ~cond); {47555#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:34,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {47555#(<= ~counter~0 5)} assume true; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:34,861 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47555#(<= ~counter~0 5)} {47555#(<= ~counter~0 5)} #94#return; {47555#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:34,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {47555#(<= ~counter~0 5)} assume !!(0 != ~r~0); {47555#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:34,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {47555#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:34,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {47580#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:34,864 INFO L272 TraceCheckUtils]: 59: Hoare triple {47580#(<= ~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)); {47580#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:34,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {47580#(<= ~counter~0 6)} ~cond := #in~cond; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:34,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {47580#(<= ~counter~0 6)} assume !(0 == ~cond); {47580#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:34,865 INFO L290 TraceCheckUtils]: 62: Hoare triple {47580#(<= ~counter~0 6)} assume true; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:34,865 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47580#(<= ~counter~0 6)} {47580#(<= ~counter~0 6)} #96#return; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:34,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {47580#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47580#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:34,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {47580#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:34,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {47605#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:34,868 INFO L272 TraceCheckUtils]: 67: Hoare triple {47605#(<= ~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)); {47605#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:34,868 INFO L290 TraceCheckUtils]: 68: Hoare triple {47605#(<= ~counter~0 7)} ~cond := #in~cond; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:34,869 INFO L290 TraceCheckUtils]: 69: Hoare triple {47605#(<= ~counter~0 7)} assume !(0 == ~cond); {47605#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:34,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {47605#(<= ~counter~0 7)} assume true; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:34,870 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47605#(<= ~counter~0 7)} {47605#(<= ~counter~0 7)} #96#return; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:34,870 INFO L290 TraceCheckUtils]: 72: Hoare triple {47605#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47605#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:34,871 INFO L290 TraceCheckUtils]: 73: Hoare triple {47605#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:34,872 INFO L290 TraceCheckUtils]: 74: Hoare triple {47630#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:34,872 INFO L272 TraceCheckUtils]: 75: Hoare triple {47630#(<= ~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)); {47630#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:34,873 INFO L290 TraceCheckUtils]: 76: Hoare triple {47630#(<= ~counter~0 8)} ~cond := #in~cond; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:34,873 INFO L290 TraceCheckUtils]: 77: Hoare triple {47630#(<= ~counter~0 8)} assume !(0 == ~cond); {47630#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:34,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {47630#(<= ~counter~0 8)} assume true; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:34,874 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47630#(<= ~counter~0 8)} {47630#(<= ~counter~0 8)} #96#return; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:34,875 INFO L290 TraceCheckUtils]: 80: Hoare triple {47630#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47630#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:34,876 INFO L290 TraceCheckUtils]: 81: Hoare triple {47630#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:34,876 INFO L290 TraceCheckUtils]: 82: Hoare triple {47655#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:34,877 INFO L272 TraceCheckUtils]: 83: Hoare triple {47655#(<= ~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)); {47655#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:34,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {47655#(<= ~counter~0 9)} ~cond := #in~cond; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:34,878 INFO L290 TraceCheckUtils]: 85: Hoare triple {47655#(<= ~counter~0 9)} assume !(0 == ~cond); {47655#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:34,878 INFO L290 TraceCheckUtils]: 86: Hoare triple {47655#(<= ~counter~0 9)} assume true; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:34,879 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47655#(<= ~counter~0 9)} {47655#(<= ~counter~0 9)} #96#return; {47655#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:34,880 INFO L290 TraceCheckUtils]: 88: Hoare triple {47655#(<= ~counter~0 9)} assume !(~r~0 > 0); {47655#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:34,881 INFO L290 TraceCheckUtils]: 89: Hoare triple {47655#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:34,881 INFO L290 TraceCheckUtils]: 90: Hoare triple {47680#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:34,882 INFO L272 TraceCheckUtils]: 91: Hoare triple {47680#(<= ~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)); {47680#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:34,882 INFO L290 TraceCheckUtils]: 92: Hoare triple {47680#(<= ~counter~0 10)} ~cond := #in~cond; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:34,882 INFO L290 TraceCheckUtils]: 93: Hoare triple {47680#(<= ~counter~0 10)} assume !(0 == ~cond); {47680#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:34,882 INFO L290 TraceCheckUtils]: 94: Hoare triple {47680#(<= ~counter~0 10)} assume true; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:34,883 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47680#(<= ~counter~0 10)} {47680#(<= ~counter~0 10)} #98#return; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:34,883 INFO L290 TraceCheckUtils]: 96: Hoare triple {47680#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47680#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:34,884 INFO L290 TraceCheckUtils]: 97: Hoare triple {47680#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47705#(<= |main_#t~post8| 10)} is VALID [2022-04-08 06:04:34,884 INFO L290 TraceCheckUtils]: 98: Hoare triple {47705#(<= |main_#t~post8| 10)} assume !(#t~post8 < 50);havoc #t~post8; {47399#false} is VALID [2022-04-08 06:04:34,884 INFO L290 TraceCheckUtils]: 99: Hoare triple {47399#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47399#false} is VALID [2022-04-08 06:04:34,884 INFO L290 TraceCheckUtils]: 100: Hoare triple {47399#false} assume !(#t~post6 < 50);havoc #t~post6; {47399#false} is VALID [2022-04-08 06:04:34,884 INFO L272 TraceCheckUtils]: 101: Hoare triple {47399#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)); {47399#false} is VALID [2022-04-08 06:04:34,884 INFO L290 TraceCheckUtils]: 102: Hoare triple {47399#false} ~cond := #in~cond; {47399#false} is VALID [2022-04-08 06:04:34,884 INFO L290 TraceCheckUtils]: 103: Hoare triple {47399#false} assume 0 == ~cond; {47399#false} is VALID [2022-04-08 06:04:34,884 INFO L290 TraceCheckUtils]: 104: Hoare triple {47399#false} assume !false; {47399#false} is VALID [2022-04-08 06:04:34,885 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-08 06:04:34,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:35,488 INFO L290 TraceCheckUtils]: 104: Hoare triple {47399#false} assume !false; {47399#false} is VALID [2022-04-08 06:04:35,488 INFO L290 TraceCheckUtils]: 103: Hoare triple {47399#false} assume 0 == ~cond; {47399#false} is VALID [2022-04-08 06:04:35,488 INFO L290 TraceCheckUtils]: 102: Hoare triple {47399#false} ~cond := #in~cond; {47399#false} is VALID [2022-04-08 06:04:35,488 INFO L272 TraceCheckUtils]: 101: Hoare triple {47399#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)); {47399#false} is VALID [2022-04-08 06:04:35,488 INFO L290 TraceCheckUtils]: 100: Hoare triple {47399#false} assume !(#t~post6 < 50);havoc #t~post6; {47399#false} is VALID [2022-04-08 06:04:35,489 INFO L290 TraceCheckUtils]: 99: Hoare triple {47399#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47399#false} is VALID [2022-04-08 06:04:35,489 INFO L290 TraceCheckUtils]: 98: Hoare triple {47745#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {47399#false} is VALID [2022-04-08 06:04:35,489 INFO L290 TraceCheckUtils]: 97: Hoare triple {47749#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47745#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:04:35,489 INFO L290 TraceCheckUtils]: 96: Hoare triple {47749#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47749#(< ~counter~0 50)} is VALID [2022-04-08 06:04:35,490 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47398#true} {47749#(< ~counter~0 50)} #98#return; {47749#(< ~counter~0 50)} is VALID [2022-04-08 06:04:35,490 INFO L290 TraceCheckUtils]: 94: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,490 INFO L290 TraceCheckUtils]: 93: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,490 INFO L290 TraceCheckUtils]: 92: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,490 INFO L272 TraceCheckUtils]: 91: Hoare triple {47749#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,491 INFO L290 TraceCheckUtils]: 90: Hoare triple {47749#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {47749#(< ~counter~0 50)} is VALID [2022-04-08 06:04:35,492 INFO L290 TraceCheckUtils]: 89: Hoare triple {47774#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47749#(< ~counter~0 50)} is VALID [2022-04-08 06:04:35,492 INFO L290 TraceCheckUtils]: 88: Hoare triple {47774#(< ~counter~0 49)} assume !(~r~0 > 0); {47774#(< ~counter~0 49)} is VALID [2022-04-08 06:04:35,493 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47398#true} {47774#(< ~counter~0 49)} #96#return; {47774#(< ~counter~0 49)} is VALID [2022-04-08 06:04:35,493 INFO L290 TraceCheckUtils]: 86: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,493 INFO L290 TraceCheckUtils]: 85: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,493 INFO L290 TraceCheckUtils]: 84: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,493 INFO L272 TraceCheckUtils]: 83: Hoare triple {47774#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,493 INFO L290 TraceCheckUtils]: 82: Hoare triple {47774#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {47774#(< ~counter~0 49)} is VALID [2022-04-08 06:04:35,494 INFO L290 TraceCheckUtils]: 81: Hoare triple {47799#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47774#(< ~counter~0 49)} is VALID [2022-04-08 06:04:35,494 INFO L290 TraceCheckUtils]: 80: Hoare triple {47799#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47799#(< ~counter~0 48)} is VALID [2022-04-08 06:04:35,495 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47398#true} {47799#(< ~counter~0 48)} #96#return; {47799#(< ~counter~0 48)} is VALID [2022-04-08 06:04:35,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,495 INFO L290 TraceCheckUtils]: 77: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,495 INFO L290 TraceCheckUtils]: 76: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,495 INFO L272 TraceCheckUtils]: 75: Hoare triple {47799#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,495 INFO L290 TraceCheckUtils]: 74: Hoare triple {47799#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {47799#(< ~counter~0 48)} is VALID [2022-04-08 06:04:35,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {47824#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47799#(< ~counter~0 48)} is VALID [2022-04-08 06:04:35,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {47824#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47824#(< ~counter~0 47)} is VALID [2022-04-08 06:04:35,497 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47398#true} {47824#(< ~counter~0 47)} #96#return; {47824#(< ~counter~0 47)} is VALID [2022-04-08 06:04:35,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,497 INFO L272 TraceCheckUtils]: 67: Hoare triple {47824#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,497 INFO L290 TraceCheckUtils]: 66: Hoare triple {47824#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {47824#(< ~counter~0 47)} is VALID [2022-04-08 06:04:35,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {47849#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47824#(< ~counter~0 47)} is VALID [2022-04-08 06:04:35,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {47849#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47849#(< ~counter~0 46)} is VALID [2022-04-08 06:04:35,499 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47398#true} {47849#(< ~counter~0 46)} #96#return; {47849#(< ~counter~0 46)} is VALID [2022-04-08 06:04:35,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,499 INFO L272 TraceCheckUtils]: 59: Hoare triple {47849#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {47849#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {47849#(< ~counter~0 46)} is VALID [2022-04-08 06:04:35,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {47874#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47849#(< ~counter~0 46)} is VALID [2022-04-08 06:04:35,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {47874#(< ~counter~0 45)} assume !!(0 != ~r~0); {47874#(< ~counter~0 45)} is VALID [2022-04-08 06:04:35,501 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47398#true} {47874#(< ~counter~0 45)} #94#return; {47874#(< ~counter~0 45)} is VALID [2022-04-08 06:04:35,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,501 INFO L272 TraceCheckUtils]: 51: Hoare triple {47874#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {47874#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {47874#(< ~counter~0 45)} is VALID [2022-04-08 06:04:35,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {47899#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47874#(< ~counter~0 45)} is VALID [2022-04-08 06:04:35,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {47899#(< ~counter~0 44)} assume !(~r~0 < 0); {47899#(< ~counter~0 44)} is VALID [2022-04-08 06:04:35,503 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47398#true} {47899#(< ~counter~0 44)} #98#return; {47899#(< ~counter~0 44)} is VALID [2022-04-08 06:04:35,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,503 INFO L272 TraceCheckUtils]: 43: Hoare triple {47899#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {47899#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {47899#(< ~counter~0 44)} is VALID [2022-04-08 06:04:35,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {47924#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47899#(< ~counter~0 44)} is VALID [2022-04-08 06:04:35,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {47924#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47924#(< ~counter~0 43)} is VALID [2022-04-08 06:04:35,505 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47398#true} {47924#(< ~counter~0 43)} #98#return; {47924#(< ~counter~0 43)} is VALID [2022-04-08 06:04:35,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,505 INFO L272 TraceCheckUtils]: 35: Hoare triple {47924#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {47924#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {47924#(< ~counter~0 43)} is VALID [2022-04-08 06:04:35,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {47949#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47924#(< ~counter~0 43)} is VALID [2022-04-08 06:04:35,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {47949#(< ~counter~0 42)} assume !(~r~0 > 0); {47949#(< ~counter~0 42)} is VALID [2022-04-08 06:04:35,507 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47398#true} {47949#(< ~counter~0 42)} #96#return; {47949#(< ~counter~0 42)} is VALID [2022-04-08 06:04:35,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,507 INFO L272 TraceCheckUtils]: 27: Hoare triple {47949#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {47949#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {47949#(< ~counter~0 42)} is VALID [2022-04-08 06:04:35,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {47974#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47949#(< ~counter~0 42)} is VALID [2022-04-08 06:04:35,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {47974#(< ~counter~0 41)} assume !!(0 != ~r~0); {47974#(< ~counter~0 41)} is VALID [2022-04-08 06:04:35,518 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47398#true} {47974#(< ~counter~0 41)} #94#return; {47974#(< ~counter~0 41)} is VALID [2022-04-08 06:04:35,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,518 INFO L272 TraceCheckUtils]: 19: Hoare triple {47974#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {47974#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {47974#(< ~counter~0 41)} is VALID [2022-04-08 06:04:35,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {47999#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47974#(< ~counter~0 41)} is VALID [2022-04-08 06:04:35,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {47999#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47999#(< ~counter~0 40)} is VALID [2022-04-08 06:04:35,520 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47398#true} {47999#(< ~counter~0 40)} #92#return; {47999#(< ~counter~0 40)} is VALID [2022-04-08 06:04:35,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,521 INFO L272 TraceCheckUtils]: 11: Hoare triple {47999#(< ~counter~0 40)} 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)); {47398#true} is VALID [2022-04-08 06:04:35,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47398#true} {47999#(< ~counter~0 40)} #90#return; {47999#(< ~counter~0 40)} is VALID [2022-04-08 06:04:35,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-08 06:04:35,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-08 06:04:35,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-08 06:04:35,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {47999#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47398#true} is VALID [2022-04-08 06:04:35,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {47999#(< ~counter~0 40)} 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; {47999#(< ~counter~0 40)} is VALID [2022-04-08 06:04:35,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {47999#(< ~counter~0 40)} call #t~ret9 := main(); {47999#(< ~counter~0 40)} is VALID [2022-04-08 06:04:35,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47999#(< ~counter~0 40)} {47398#true} #102#return; {47999#(< ~counter~0 40)} is VALID [2022-04-08 06:04:35,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {47999#(< ~counter~0 40)} assume true; {47999#(< ~counter~0 40)} is VALID [2022-04-08 06:04:35,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {47398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47999#(< ~counter~0 40)} is VALID [2022-04-08 06:04:35,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {47398#true} call ULTIMATE.init(); {47398#true} is VALID [2022-04-08 06:04:35,524 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-08 06:04:35,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:35,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849568174] [2022-04-08 06:04:35,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:35,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019723899] [2022-04-08 06:04:35,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019723899] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:35,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:35,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 06:04:35,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:35,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184744679] [2022-04-08 06:04:35,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184744679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:35,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:35,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 06:04:35,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25638462] [2022-04-08 06:04:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:35,525 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-08 06:04:35,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:35,526 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-08 06:04:35,614 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-08 06:04:35,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 06:04:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 06:04:35,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:04:35,615 INFO L87 Difference]: Start difference. First operand 504 states and 695 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-08 06:04:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:37,498 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2022-04-08 06:04:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 06:04:37,498 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-08 06:04:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:37,499 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-08 06:04:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-08 06:04:37,501 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-08 06:04:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-08 06:04:37,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-08 06:04:37,700 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-08 06:04:37,713 INFO L225 Difference]: With dead ends: 753 [2022-04-08 06:04:37,713 INFO L226 Difference]: Without dead ends: 532 [2022-04-08 06:04:37,714 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-08 06:04:37,714 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:37,714 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 249 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:04:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-08 06:04:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 522. [2022-04-08 06:04:38,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:38,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:38,802 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:38,802 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:38,814 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-08 06:04:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-08 06:04:38,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:38,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:38,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-08 06:04:38,816 INFO L87 Difference]: Start difference. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-08 06:04:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:38,833 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-08 06:04:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-08 06:04:38,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:38,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:38,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:38,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2022-04-08 06:04:38,850 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 105 [2022-04-08 06:04:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:38,851 INFO L478 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2022-04-08 06:04:38,851 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-08 06:04:38,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 522 states and 717 transitions. [2022-04-08 06:04:41,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2022-04-08 06:04:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 06:04:41,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:41,030 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-08 06:04:41,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-08 06:04:41,243 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-08 06:04:41,243 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-08 06:04:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:41,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2139105888] [2022-04-08 06:04:41,244 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-08 06:04:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:41,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194287475] [2022-04-08 06:04:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:41,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:41,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671827328] [2022-04-08 06:04:41,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:04:41,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:41,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:41,256 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-08 06:04:41,257 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-08 06:04:41,379 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:04:41,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:41,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 06:04:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:41,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:41,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {51683#true} call ULTIMATE.init(); {51683#true} is VALID [2022-04-08 06:04:41,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {51683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51691#(<= ~counter~0 0)} {51683#true} #102#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {51691#(<= ~counter~0 0)} call #t~ret9 := main(); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {51691#(<= ~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; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {51691#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {51691#(<= ~counter~0 0)} ~cond := #in~cond; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {51691#(<= ~counter~0 0)} assume !(0 == ~cond); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51691#(<= ~counter~0 0)} {51691#(<= ~counter~0 0)} #90#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,898 INFO L272 TraceCheckUtils]: 11: Hoare triple {51691#(<= ~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)); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {51691#(<= ~counter~0 0)} ~cond := #in~cond; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {51691#(<= ~counter~0 0)} assume !(0 == ~cond); {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,899 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51691#(<= ~counter~0 0)} {51691#(<= ~counter~0 0)} #92#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {51691#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51691#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {51691#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {51740#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,901 INFO L272 TraceCheckUtils]: 19: Hoare triple {51740#(<= ~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)); {51740#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {51740#(<= ~counter~0 1)} ~cond := #in~cond; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {51740#(<= ~counter~0 1)} assume !(0 == ~cond); {51740#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {51740#(<= ~counter~0 1)} assume true; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,903 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51740#(<= ~counter~0 1)} {51740#(<= ~counter~0 1)} #94#return; {51740#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {51740#(<= ~counter~0 1)} assume !!(0 != ~r~0); {51740#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {51740#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {51765#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,904 INFO L272 TraceCheckUtils]: 27: Hoare triple {51765#(<= ~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)); {51765#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {51765#(<= ~counter~0 2)} ~cond := #in~cond; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {51765#(<= ~counter~0 2)} assume !(0 == ~cond); {51765#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {51765#(<= ~counter~0 2)} assume true; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,906 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51765#(<= ~counter~0 2)} {51765#(<= ~counter~0 2)} #96#return; {51765#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {51765#(<= ~counter~0 2)} assume !(~r~0 > 0); {51765#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {51765#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {51790#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,907 INFO L272 TraceCheckUtils]: 35: Hoare triple {51790#(<= ~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)); {51790#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {51790#(<= ~counter~0 3)} ~cond := #in~cond; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {51790#(<= ~counter~0 3)} assume !(0 == ~cond); {51790#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {51790#(<= ~counter~0 3)} assume true; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,909 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51790#(<= ~counter~0 3)} {51790#(<= ~counter~0 3)} #98#return; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {51790#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51790#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {51790#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {51815#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,910 INFO L272 TraceCheckUtils]: 43: Hoare triple {51815#(<= ~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)); {51815#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {51815#(<= ~counter~0 4)} ~cond := #in~cond; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {51815#(<= ~counter~0 4)} assume !(0 == ~cond); {51815#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,911 INFO L290 TraceCheckUtils]: 46: Hoare triple {51815#(<= ~counter~0 4)} assume true; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,912 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51815#(<= ~counter~0 4)} {51815#(<= ~counter~0 4)} #98#return; {51815#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {51815#(<= ~counter~0 4)} assume !(~r~0 < 0); {51815#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {51815#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {51840#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,913 INFO L272 TraceCheckUtils]: 51: Hoare triple {51840#(<= ~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)); {51840#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {51840#(<= ~counter~0 5)} ~cond := #in~cond; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {51840#(<= ~counter~0 5)} assume !(0 == ~cond); {51840#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {51840#(<= ~counter~0 5)} assume true; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,915 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51840#(<= ~counter~0 5)} {51840#(<= ~counter~0 5)} #94#return; {51840#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {51840#(<= ~counter~0 5)} assume !!(0 != ~r~0); {51840#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {51840#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {51865#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,916 INFO L272 TraceCheckUtils]: 59: Hoare triple {51865#(<= ~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)); {51865#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {51865#(<= ~counter~0 6)} ~cond := #in~cond; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {51865#(<= ~counter~0 6)} assume !(0 == ~cond); {51865#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {51865#(<= ~counter~0 6)} assume true; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,918 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51865#(<= ~counter~0 6)} {51865#(<= ~counter~0 6)} #96#return; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {51865#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51865#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {51865#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {51890#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,919 INFO L272 TraceCheckUtils]: 67: Hoare triple {51890#(<= ~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)); {51890#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {51890#(<= ~counter~0 7)} ~cond := #in~cond; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {51890#(<= ~counter~0 7)} assume !(0 == ~cond); {51890#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {51890#(<= ~counter~0 7)} assume true; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,921 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51890#(<= ~counter~0 7)} {51890#(<= ~counter~0 7)} #96#return; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,921 INFO L290 TraceCheckUtils]: 72: Hoare triple {51890#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51890#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,922 INFO L290 TraceCheckUtils]: 73: Hoare triple {51890#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,922 INFO L290 TraceCheckUtils]: 74: Hoare triple {51915#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,922 INFO L272 TraceCheckUtils]: 75: Hoare triple {51915#(<= ~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)); {51915#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,923 INFO L290 TraceCheckUtils]: 76: Hoare triple {51915#(<= ~counter~0 8)} ~cond := #in~cond; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,923 INFO L290 TraceCheckUtils]: 77: Hoare triple {51915#(<= ~counter~0 8)} assume !(0 == ~cond); {51915#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,923 INFO L290 TraceCheckUtils]: 78: Hoare triple {51915#(<= ~counter~0 8)} assume true; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,924 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51915#(<= ~counter~0 8)} {51915#(<= ~counter~0 8)} #96#return; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,924 INFO L290 TraceCheckUtils]: 80: Hoare triple {51915#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51915#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,925 INFO L290 TraceCheckUtils]: 81: Hoare triple {51915#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,925 INFO L290 TraceCheckUtils]: 82: Hoare triple {51940#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,926 INFO L272 TraceCheckUtils]: 83: Hoare triple {51940#(<= ~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)); {51940#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {51940#(<= ~counter~0 9)} ~cond := #in~cond; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,926 INFO L290 TraceCheckUtils]: 85: Hoare triple {51940#(<= ~counter~0 9)} assume !(0 == ~cond); {51940#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,926 INFO L290 TraceCheckUtils]: 86: Hoare triple {51940#(<= ~counter~0 9)} assume true; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,927 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51940#(<= ~counter~0 9)} {51940#(<= ~counter~0 9)} #96#return; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,927 INFO L290 TraceCheckUtils]: 88: Hoare triple {51940#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51940#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {51940#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,928 INFO L290 TraceCheckUtils]: 90: Hoare triple {51965#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,929 INFO L272 TraceCheckUtils]: 91: Hoare triple {51965#(<= ~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)); {51965#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {51965#(<= ~counter~0 10)} ~cond := #in~cond; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {51965#(<= ~counter~0 10)} assume !(0 == ~cond); {51965#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,930 INFO L290 TraceCheckUtils]: 94: Hoare triple {51965#(<= ~counter~0 10)} assume true; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,930 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51965#(<= ~counter~0 10)} {51965#(<= ~counter~0 10)} #96#return; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,930 INFO L290 TraceCheckUtils]: 96: Hoare triple {51965#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51965#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,931 INFO L290 TraceCheckUtils]: 97: Hoare triple {51965#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51990#(<= |main_#t~post7| 10)} is VALID [2022-04-08 06:04:41,931 INFO L290 TraceCheckUtils]: 98: Hoare triple {51990#(<= |main_#t~post7| 10)} assume !(#t~post7 < 50);havoc #t~post7; {51684#false} is VALID [2022-04-08 06:04:41,931 INFO L290 TraceCheckUtils]: 99: Hoare triple {51684#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51684#false} is VALID [2022-04-08 06:04:41,931 INFO L290 TraceCheckUtils]: 100: Hoare triple {51684#false} assume !(#t~post8 < 50);havoc #t~post8; {51684#false} is VALID [2022-04-08 06:04:41,932 INFO L290 TraceCheckUtils]: 101: Hoare triple {51684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51684#false} is VALID [2022-04-08 06:04:41,932 INFO L290 TraceCheckUtils]: 102: Hoare triple {51684#false} assume !(#t~post6 < 50);havoc #t~post6; {51684#false} is VALID [2022-04-08 06:04:41,932 INFO L272 TraceCheckUtils]: 103: Hoare triple {51684#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)); {51684#false} is VALID [2022-04-08 06:04:41,932 INFO L290 TraceCheckUtils]: 104: Hoare triple {51684#false} ~cond := #in~cond; {51684#false} is VALID [2022-04-08 06:04:41,932 INFO L290 TraceCheckUtils]: 105: Hoare triple {51684#false} assume 0 == ~cond; {51684#false} is VALID [2022-04-08 06:04:41,932 INFO L290 TraceCheckUtils]: 106: Hoare triple {51684#false} assume !false; {51684#false} is VALID [2022-04-08 06:04:41,932 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-08 06:04:41,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:42,522 INFO L290 TraceCheckUtils]: 106: Hoare triple {51684#false} assume !false; {51684#false} is VALID [2022-04-08 06:04:42,522 INFO L290 TraceCheckUtils]: 105: Hoare triple {51684#false} assume 0 == ~cond; {51684#false} is VALID [2022-04-08 06:04:42,522 INFO L290 TraceCheckUtils]: 104: Hoare triple {51684#false} ~cond := #in~cond; {51684#false} is VALID [2022-04-08 06:04:42,522 INFO L272 TraceCheckUtils]: 103: Hoare triple {51684#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)); {51684#false} is VALID [2022-04-08 06:04:42,522 INFO L290 TraceCheckUtils]: 102: Hoare triple {51684#false} assume !(#t~post6 < 50);havoc #t~post6; {51684#false} is VALID [2022-04-08 06:04:42,522 INFO L290 TraceCheckUtils]: 101: Hoare triple {51684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51684#false} is VALID [2022-04-08 06:04:42,523 INFO L290 TraceCheckUtils]: 100: Hoare triple {51684#false} assume !(#t~post8 < 50);havoc #t~post8; {51684#false} is VALID [2022-04-08 06:04:42,523 INFO L290 TraceCheckUtils]: 99: Hoare triple {51684#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51684#false} is VALID [2022-04-08 06:04:42,523 INFO L290 TraceCheckUtils]: 98: Hoare triple {52042#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {51684#false} is VALID [2022-04-08 06:04:42,524 INFO L290 TraceCheckUtils]: 97: Hoare triple {52046#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52042#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:04:42,524 INFO L290 TraceCheckUtils]: 96: Hoare triple {52046#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52046#(< ~counter~0 50)} is VALID [2022-04-08 06:04:42,525 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51683#true} {52046#(< ~counter~0 50)} #96#return; {52046#(< ~counter~0 50)} is VALID [2022-04-08 06:04:42,525 INFO L290 TraceCheckUtils]: 94: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,525 INFO L290 TraceCheckUtils]: 93: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,525 INFO L290 TraceCheckUtils]: 92: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,525 INFO L272 TraceCheckUtils]: 91: Hoare triple {52046#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,525 INFO L290 TraceCheckUtils]: 90: Hoare triple {52046#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {52046#(< ~counter~0 50)} is VALID [2022-04-08 06:04:42,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {52071#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52046#(< ~counter~0 50)} is VALID [2022-04-08 06:04:42,527 INFO L290 TraceCheckUtils]: 88: Hoare triple {52071#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52071#(< ~counter~0 49)} is VALID [2022-04-08 06:04:42,528 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51683#true} {52071#(< ~counter~0 49)} #96#return; {52071#(< ~counter~0 49)} is VALID [2022-04-08 06:04:42,528 INFO L290 TraceCheckUtils]: 86: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,528 INFO L272 TraceCheckUtils]: 83: Hoare triple {52071#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,529 INFO L290 TraceCheckUtils]: 82: Hoare triple {52071#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {52071#(< ~counter~0 49)} is VALID [2022-04-08 06:04:42,530 INFO L290 TraceCheckUtils]: 81: Hoare triple {52096#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52071#(< ~counter~0 49)} is VALID [2022-04-08 06:04:42,530 INFO L290 TraceCheckUtils]: 80: Hoare triple {52096#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52096#(< ~counter~0 48)} is VALID [2022-04-08 06:04:42,531 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51683#true} {52096#(< ~counter~0 48)} #96#return; {52096#(< ~counter~0 48)} is VALID [2022-04-08 06:04:42,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,531 INFO L272 TraceCheckUtils]: 75: Hoare triple {52096#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {52096#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {52096#(< ~counter~0 48)} is VALID [2022-04-08 06:04:42,532 INFO L290 TraceCheckUtils]: 73: Hoare triple {52121#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52096#(< ~counter~0 48)} is VALID [2022-04-08 06:04:42,532 INFO L290 TraceCheckUtils]: 72: Hoare triple {52121#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52121#(< ~counter~0 47)} is VALID [2022-04-08 06:04:42,533 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51683#true} {52121#(< ~counter~0 47)} #96#return; {52121#(< ~counter~0 47)} is VALID [2022-04-08 06:04:42,533 INFO L290 TraceCheckUtils]: 70: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,533 INFO L290 TraceCheckUtils]: 69: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,533 INFO L272 TraceCheckUtils]: 67: Hoare triple {52121#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {52121#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {52121#(< ~counter~0 47)} is VALID [2022-04-08 06:04:42,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {52146#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52121#(< ~counter~0 47)} is VALID [2022-04-08 06:04:42,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {52146#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52146#(< ~counter~0 46)} is VALID [2022-04-08 06:04:42,535 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51683#true} {52146#(< ~counter~0 46)} #96#return; {52146#(< ~counter~0 46)} is VALID [2022-04-08 06:04:42,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,535 INFO L272 TraceCheckUtils]: 59: Hoare triple {52146#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {52146#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {52146#(< ~counter~0 46)} is VALID [2022-04-08 06:04:42,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {52171#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52146#(< ~counter~0 46)} is VALID [2022-04-08 06:04:42,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {52171#(< ~counter~0 45)} assume !!(0 != ~r~0); {52171#(< ~counter~0 45)} is VALID [2022-04-08 06:04:42,537 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51683#true} {52171#(< ~counter~0 45)} #94#return; {52171#(< ~counter~0 45)} is VALID [2022-04-08 06:04:42,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,537 INFO L272 TraceCheckUtils]: 51: Hoare triple {52171#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {52171#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {52171#(< ~counter~0 45)} is VALID [2022-04-08 06:04:42,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {52196#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52171#(< ~counter~0 45)} is VALID [2022-04-08 06:04:42,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {52196#(< ~counter~0 44)} assume !(~r~0 < 0); {52196#(< ~counter~0 44)} is VALID [2022-04-08 06:04:42,539 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51683#true} {52196#(< ~counter~0 44)} #98#return; {52196#(< ~counter~0 44)} is VALID [2022-04-08 06:04:42,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {52196#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {52196#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {52196#(< ~counter~0 44)} is VALID [2022-04-08 06:04:42,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {52221#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52196#(< ~counter~0 44)} is VALID [2022-04-08 06:04:42,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {52221#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52221#(< ~counter~0 43)} is VALID [2022-04-08 06:04:42,541 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51683#true} {52221#(< ~counter~0 43)} #98#return; {52221#(< ~counter~0 43)} is VALID [2022-04-08 06:04:42,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,541 INFO L272 TraceCheckUtils]: 35: Hoare triple {52221#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {52221#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {52221#(< ~counter~0 43)} is VALID [2022-04-08 06:04:42,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {52246#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52221#(< ~counter~0 43)} is VALID [2022-04-08 06:04:42,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {52246#(< ~counter~0 42)} assume !(~r~0 > 0); {52246#(< ~counter~0 42)} is VALID [2022-04-08 06:04:42,543 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51683#true} {52246#(< ~counter~0 42)} #96#return; {52246#(< ~counter~0 42)} is VALID [2022-04-08 06:04:42,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,543 INFO L272 TraceCheckUtils]: 27: Hoare triple {52246#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {52246#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {52246#(< ~counter~0 42)} is VALID [2022-04-08 06:04:42,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {52271#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52246#(< ~counter~0 42)} is VALID [2022-04-08 06:04:42,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {52271#(< ~counter~0 41)} assume !!(0 != ~r~0); {52271#(< ~counter~0 41)} is VALID [2022-04-08 06:04:42,545 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51683#true} {52271#(< ~counter~0 41)} #94#return; {52271#(< ~counter~0 41)} is VALID [2022-04-08 06:04:42,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {52271#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {52271#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {52271#(< ~counter~0 41)} is VALID [2022-04-08 06:04:42,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {52296#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52271#(< ~counter~0 41)} is VALID [2022-04-08 06:04:42,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {52296#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {52296#(< ~counter~0 40)} is VALID [2022-04-08 06:04:42,547 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51683#true} {52296#(< ~counter~0 40)} #92#return; {52296#(< ~counter~0 40)} is VALID [2022-04-08 06:04:42,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,547 INFO L272 TraceCheckUtils]: 11: Hoare triple {52296#(< ~counter~0 40)} 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)); {51683#true} is VALID [2022-04-08 06:04:42,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51683#true} {52296#(< ~counter~0 40)} #90#return; {52296#(< ~counter~0 40)} is VALID [2022-04-08 06:04:42,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-08 06:04:42,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-08 06:04:42,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-08 06:04:42,548 INFO L272 TraceCheckUtils]: 6: Hoare triple {52296#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51683#true} is VALID [2022-04-08 06:04:42,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {52296#(< ~counter~0 40)} 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; {52296#(< ~counter~0 40)} is VALID [2022-04-08 06:04:42,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {52296#(< ~counter~0 40)} call #t~ret9 := main(); {52296#(< ~counter~0 40)} is VALID [2022-04-08 06:04:42,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52296#(< ~counter~0 40)} {51683#true} #102#return; {52296#(< ~counter~0 40)} is VALID [2022-04-08 06:04:42,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {52296#(< ~counter~0 40)} assume true; {52296#(< ~counter~0 40)} is VALID [2022-04-08 06:04:42,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {51683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {52296#(< ~counter~0 40)} is VALID [2022-04-08 06:04:42,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {51683#true} call ULTIMATE.init(); {51683#true} is VALID [2022-04-08 06:04:42,550 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-08 06:04:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194287475] [2022-04-08 06:04:42,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671827328] [2022-04-08 06:04:42,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671827328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:42,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:42,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 06:04:42,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:42,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2139105888] [2022-04-08 06:04:42,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2139105888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:42,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:42,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 06:04:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289178364] [2022-04-08 06:04:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:42,552 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-08 06:04:42,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:42,552 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-08 06:04:42,639 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-08 06:04:42,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 06:04:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 06:04:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:04:42,640 INFO L87 Difference]: Start difference. First operand 522 states and 717 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-08 06:04:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:44,524 INFO L93 Difference]: Finished difference Result 735 states and 1041 transitions. [2022-04-08 06:04:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 06:04:44,524 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-08 06:04:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:44,525 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-08 06:04:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-08 06:04:44,527 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-08 06:04:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-08 06:04:44,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-08 06:04:44,743 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-08 06:04:44,758 INFO L225 Difference]: With dead ends: 735 [2022-04-08 06:04:44,758 INFO L226 Difference]: Without dead ends: 538 [2022-04-08 06:04:44,759 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-08 06:04:44,759 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:44,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 255 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:04:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-08 06:04:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-04-08 06:04:45,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:45,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:45,907 INFO L74 IsIncluded]: Start isIncluded. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:45,908 INFO L87 Difference]: Start difference. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:45,924 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-08 06:04:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 06:04:45,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:45,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:45,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-08 06:04:45,926 INFO L87 Difference]: Start difference. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-08 06:04:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:45,941 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-08 06:04:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 06:04:45,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:45,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:45,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:45,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:04:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 733 transitions. [2022-04-08 06:04:45,957 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 733 transitions. Word has length 107 [2022-04-08 06:04:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:45,957 INFO L478 AbstractCegarLoop]: Abstraction has 538 states and 733 transitions. [2022-04-08 06:04:45,957 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-08 06:04:45,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 538 states and 733 transitions. [2022-04-08 06:04:47,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 06:04:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 06:04:47,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:47,903 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-08 06:04:47,907 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-08 06:04:48,104 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-08 06:04:48,104 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-08 06:04:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:48,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [676145479] [2022-04-08 06:04:48,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-08 06:04:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:48,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738901214] [2022-04-08 06:04:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:48,116 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:48,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506757292] [2022-04-08 06:04:48,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:04:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:48,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:48,117 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-08 06:04:48,121 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-08 06:04:48,263 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:04:48,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:48,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 06:04:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:48,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:48,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {55990#true} call ULTIMATE.init(); {55990#true} is VALID [2022-04-08 06:04:48,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {55990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55998#(<= ~counter~0 0)} {55990#true} #102#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {55998#(<= ~counter~0 0)} call #t~ret9 := main(); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {55998#(<= ~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; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {55998#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {55998#(<= ~counter~0 0)} ~cond := #in~cond; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {55998#(<= ~counter~0 0)} assume !(0 == ~cond); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55998#(<= ~counter~0 0)} {55998#(<= ~counter~0 0)} #90#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {55998#(<= ~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)); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {55998#(<= ~counter~0 0)} ~cond := #in~cond; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {55998#(<= ~counter~0 0)} assume !(0 == ~cond); {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55998#(<= ~counter~0 0)} {55998#(<= ~counter~0 0)} #92#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {55998#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {55998#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:48,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {55998#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:48,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {56047#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:48,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {56047#(<= ~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)); {56047#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:48,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {56047#(<= ~counter~0 1)} ~cond := #in~cond; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:48,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {56047#(<= ~counter~0 1)} assume !(0 == ~cond); {56047#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:48,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {56047#(<= ~counter~0 1)} assume true; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:48,856 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56047#(<= ~counter~0 1)} {56047#(<= ~counter~0 1)} #94#return; {56047#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:48,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {56047#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56047#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:48,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {56047#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:48,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {56072#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:48,858 INFO L272 TraceCheckUtils]: 27: Hoare triple {56072#(<= ~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)); {56072#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:48,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {56072#(<= ~counter~0 2)} ~cond := #in~cond; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:48,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {56072#(<= ~counter~0 2)} assume !(0 == ~cond); {56072#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:48,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {56072#(<= ~counter~0 2)} assume true; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:48,859 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56072#(<= ~counter~0 2)} {56072#(<= ~counter~0 2)} #96#return; {56072#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:48,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {56072#(<= ~counter~0 2)} assume !(~r~0 > 0); {56072#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:48,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {56072#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:48,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {56097#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:48,861 INFO L272 TraceCheckUtils]: 35: Hoare triple {56097#(<= ~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)); {56097#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:48,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {56097#(<= ~counter~0 3)} ~cond := #in~cond; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:48,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {56097#(<= ~counter~0 3)} assume !(0 == ~cond); {56097#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:48,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {56097#(<= ~counter~0 3)} assume true; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:48,862 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56097#(<= ~counter~0 3)} {56097#(<= ~counter~0 3)} #98#return; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:48,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {56097#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56097#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:48,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {56097#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:48,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {56122#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:48,864 INFO L272 TraceCheckUtils]: 43: Hoare triple {56122#(<= ~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)); {56122#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:48,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {56122#(<= ~counter~0 4)} ~cond := #in~cond; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:48,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {56122#(<= ~counter~0 4)} assume !(0 == ~cond); {56122#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:48,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {56122#(<= ~counter~0 4)} assume true; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:48,865 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56122#(<= ~counter~0 4)} {56122#(<= ~counter~0 4)} #98#return; {56122#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:48,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {56122#(<= ~counter~0 4)} assume !(~r~0 < 0); {56122#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:48,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {56122#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:48,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {56147#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:48,867 INFO L272 TraceCheckUtils]: 51: Hoare triple {56147#(<= ~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)); {56147#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:48,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {56147#(<= ~counter~0 5)} ~cond := #in~cond; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:48,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {56147#(<= ~counter~0 5)} assume !(0 == ~cond); {56147#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:48,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {56147#(<= ~counter~0 5)} assume true; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:48,868 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56147#(<= ~counter~0 5)} {56147#(<= ~counter~0 5)} #94#return; {56147#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:48,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {56147#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56147#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:48,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {56147#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:48,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {56172#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:48,870 INFO L272 TraceCheckUtils]: 59: Hoare triple {56172#(<= ~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)); {56172#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:48,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {56172#(<= ~counter~0 6)} ~cond := #in~cond; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:48,871 INFO L290 TraceCheckUtils]: 61: Hoare triple {56172#(<= ~counter~0 6)} assume !(0 == ~cond); {56172#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:48,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {56172#(<= ~counter~0 6)} assume true; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:48,871 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56172#(<= ~counter~0 6)} {56172#(<= ~counter~0 6)} #96#return; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:48,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {56172#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56172#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:48,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {56172#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:48,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {56197#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:48,873 INFO L272 TraceCheckUtils]: 67: Hoare triple {56197#(<= ~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)); {56197#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:48,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {56197#(<= ~counter~0 7)} ~cond := #in~cond; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:48,874 INFO L290 TraceCheckUtils]: 69: Hoare triple {56197#(<= ~counter~0 7)} assume !(0 == ~cond); {56197#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:48,874 INFO L290 TraceCheckUtils]: 70: Hoare triple {56197#(<= ~counter~0 7)} assume true; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:48,874 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56197#(<= ~counter~0 7)} {56197#(<= ~counter~0 7)} #96#return; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:48,875 INFO L290 TraceCheckUtils]: 72: Hoare triple {56197#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56197#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:48,875 INFO L290 TraceCheckUtils]: 73: Hoare triple {56197#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:48,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {56222#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:48,876 INFO L272 TraceCheckUtils]: 75: Hoare triple {56222#(<= ~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)); {56222#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:48,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {56222#(<= ~counter~0 8)} ~cond := #in~cond; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:48,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {56222#(<= ~counter~0 8)} assume !(0 == ~cond); {56222#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:48,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {56222#(<= ~counter~0 8)} assume true; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:48,877 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56222#(<= ~counter~0 8)} {56222#(<= ~counter~0 8)} #96#return; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:48,878 INFO L290 TraceCheckUtils]: 80: Hoare triple {56222#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56222#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:48,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {56222#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:48,879 INFO L290 TraceCheckUtils]: 82: Hoare triple {56247#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:48,879 INFO L272 TraceCheckUtils]: 83: Hoare triple {56247#(<= ~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)); {56247#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:48,879 INFO L290 TraceCheckUtils]: 84: Hoare triple {56247#(<= ~counter~0 9)} ~cond := #in~cond; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:48,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {56247#(<= ~counter~0 9)} assume !(0 == ~cond); {56247#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:48,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {56247#(<= ~counter~0 9)} assume true; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:48,880 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56247#(<= ~counter~0 9)} {56247#(<= ~counter~0 9)} #96#return; {56247#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:48,881 INFO L290 TraceCheckUtils]: 88: Hoare triple {56247#(<= ~counter~0 9)} assume !(~r~0 > 0); {56247#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:48,881 INFO L290 TraceCheckUtils]: 89: Hoare triple {56247#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:48,882 INFO L290 TraceCheckUtils]: 90: Hoare triple {56272#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:48,882 INFO L272 TraceCheckUtils]: 91: Hoare triple {56272#(<= ~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)); {56272#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:48,882 INFO L290 TraceCheckUtils]: 92: Hoare triple {56272#(<= ~counter~0 10)} ~cond := #in~cond; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:48,883 INFO L290 TraceCheckUtils]: 93: Hoare triple {56272#(<= ~counter~0 10)} assume !(0 == ~cond); {56272#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:48,883 INFO L290 TraceCheckUtils]: 94: Hoare triple {56272#(<= ~counter~0 10)} assume true; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:48,884 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56272#(<= ~counter~0 10)} {56272#(<= ~counter~0 10)} #98#return; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:48,884 INFO L290 TraceCheckUtils]: 96: Hoare triple {56272#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56272#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:48,884 INFO L290 TraceCheckUtils]: 97: Hoare triple {56272#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:48,885 INFO L290 TraceCheckUtils]: 98: Hoare triple {56297#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:48,885 INFO L272 TraceCheckUtils]: 99: Hoare triple {56297#(<= ~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)); {56297#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:48,885 INFO L290 TraceCheckUtils]: 100: Hoare triple {56297#(<= ~counter~0 11)} ~cond := #in~cond; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:48,886 INFO L290 TraceCheckUtils]: 101: Hoare triple {56297#(<= ~counter~0 11)} assume !(0 == ~cond); {56297#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:48,886 INFO L290 TraceCheckUtils]: 102: Hoare triple {56297#(<= ~counter~0 11)} assume true; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:48,887 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56297#(<= ~counter~0 11)} {56297#(<= ~counter~0 11)} #98#return; {56297#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:48,887 INFO L290 TraceCheckUtils]: 104: Hoare triple {56297#(<= ~counter~0 11)} assume !(~r~0 < 0); {56297#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:48,887 INFO L290 TraceCheckUtils]: 105: Hoare triple {56297#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56322#(<= |main_#t~post6| 11)} is VALID [2022-04-08 06:04:48,887 INFO L290 TraceCheckUtils]: 106: Hoare triple {56322#(<= |main_#t~post6| 11)} assume !(#t~post6 < 50);havoc #t~post6; {55991#false} is VALID [2022-04-08 06:04:48,888 INFO L272 TraceCheckUtils]: 107: Hoare triple {55991#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)); {55991#false} is VALID [2022-04-08 06:04:48,888 INFO L290 TraceCheckUtils]: 108: Hoare triple {55991#false} ~cond := #in~cond; {55991#false} is VALID [2022-04-08 06:04:48,888 INFO L290 TraceCheckUtils]: 109: Hoare triple {55991#false} assume 0 == ~cond; {55991#false} is VALID [2022-04-08 06:04:48,888 INFO L290 TraceCheckUtils]: 110: Hoare triple {55991#false} assume !false; {55991#false} is VALID [2022-04-08 06:04:48,888 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-08 06:04:48,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:49,577 INFO L290 TraceCheckUtils]: 110: Hoare triple {55991#false} assume !false; {55991#false} is VALID [2022-04-08 06:04:49,577 INFO L290 TraceCheckUtils]: 109: Hoare triple {55991#false} assume 0 == ~cond; {55991#false} is VALID [2022-04-08 06:04:49,577 INFO L290 TraceCheckUtils]: 108: Hoare triple {55991#false} ~cond := #in~cond; {55991#false} is VALID [2022-04-08 06:04:49,577 INFO L272 TraceCheckUtils]: 107: Hoare triple {55991#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)); {55991#false} is VALID [2022-04-08 06:04:49,577 INFO L290 TraceCheckUtils]: 106: Hoare triple {56350#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {55991#false} is VALID [2022-04-08 06:04:49,578 INFO L290 TraceCheckUtils]: 105: Hoare triple {56354#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56350#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:04:49,578 INFO L290 TraceCheckUtils]: 104: Hoare triple {56354#(< ~counter~0 50)} assume !(~r~0 < 0); {56354#(< ~counter~0 50)} is VALID [2022-04-08 06:04:49,579 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {55990#true} {56354#(< ~counter~0 50)} #98#return; {56354#(< ~counter~0 50)} is VALID [2022-04-08 06:04:49,579 INFO L290 TraceCheckUtils]: 102: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,579 INFO L290 TraceCheckUtils]: 101: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,579 INFO L290 TraceCheckUtils]: 100: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,579 INFO L272 TraceCheckUtils]: 99: Hoare triple {56354#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,579 INFO L290 TraceCheckUtils]: 98: Hoare triple {56354#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {56354#(< ~counter~0 50)} is VALID [2022-04-08 06:04:49,581 INFO L290 TraceCheckUtils]: 97: Hoare triple {56379#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56354#(< ~counter~0 50)} is VALID [2022-04-08 06:04:49,581 INFO L290 TraceCheckUtils]: 96: Hoare triple {56379#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56379#(< ~counter~0 49)} is VALID [2022-04-08 06:04:49,581 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {55990#true} {56379#(< ~counter~0 49)} #98#return; {56379#(< ~counter~0 49)} is VALID [2022-04-08 06:04:49,581 INFO L290 TraceCheckUtils]: 94: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,582 INFO L290 TraceCheckUtils]: 93: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,582 INFO L290 TraceCheckUtils]: 92: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,582 INFO L272 TraceCheckUtils]: 91: Hoare triple {56379#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,582 INFO L290 TraceCheckUtils]: 90: Hoare triple {56379#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {56379#(< ~counter~0 49)} is VALID [2022-04-08 06:04:49,583 INFO L290 TraceCheckUtils]: 89: Hoare triple {56404#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56379#(< ~counter~0 49)} is VALID [2022-04-08 06:04:49,583 INFO L290 TraceCheckUtils]: 88: Hoare triple {56404#(< ~counter~0 48)} assume !(~r~0 > 0); {56404#(< ~counter~0 48)} is VALID [2022-04-08 06:04:49,583 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {55990#true} {56404#(< ~counter~0 48)} #96#return; {56404#(< ~counter~0 48)} is VALID [2022-04-08 06:04:49,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,584 INFO L290 TraceCheckUtils]: 85: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,584 INFO L272 TraceCheckUtils]: 83: Hoare triple {56404#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {56404#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {56404#(< ~counter~0 48)} is VALID [2022-04-08 06:04:49,585 INFO L290 TraceCheckUtils]: 81: Hoare triple {56429#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56404#(< ~counter~0 48)} is VALID [2022-04-08 06:04:49,585 INFO L290 TraceCheckUtils]: 80: Hoare triple {56429#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56429#(< ~counter~0 47)} is VALID [2022-04-08 06:04:49,586 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {55990#true} {56429#(< ~counter~0 47)} #96#return; {56429#(< ~counter~0 47)} is VALID [2022-04-08 06:04:49,586 INFO L290 TraceCheckUtils]: 78: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,586 INFO L290 TraceCheckUtils]: 77: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,586 INFO L290 TraceCheckUtils]: 76: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,586 INFO L272 TraceCheckUtils]: 75: Hoare triple {56429#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,586 INFO L290 TraceCheckUtils]: 74: Hoare triple {56429#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {56429#(< ~counter~0 47)} is VALID [2022-04-08 06:04:49,587 INFO L290 TraceCheckUtils]: 73: Hoare triple {56454#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56429#(< ~counter~0 47)} is VALID [2022-04-08 06:04:49,587 INFO L290 TraceCheckUtils]: 72: Hoare triple {56454#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56454#(< ~counter~0 46)} is VALID [2022-04-08 06:04:49,588 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {55990#true} {56454#(< ~counter~0 46)} #96#return; {56454#(< ~counter~0 46)} is VALID [2022-04-08 06:04:49,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,588 INFO L272 TraceCheckUtils]: 67: Hoare triple {56454#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {56454#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {56454#(< ~counter~0 46)} is VALID [2022-04-08 06:04:49,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {56479#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56454#(< ~counter~0 46)} is VALID [2022-04-08 06:04:49,589 INFO L290 TraceCheckUtils]: 64: Hoare triple {56479#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56479#(< ~counter~0 45)} is VALID [2022-04-08 06:04:49,590 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {55990#true} {56479#(< ~counter~0 45)} #96#return; {56479#(< ~counter~0 45)} is VALID [2022-04-08 06:04:49,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,590 INFO L290 TraceCheckUtils]: 60: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,590 INFO L272 TraceCheckUtils]: 59: Hoare triple {56479#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,590 INFO L290 TraceCheckUtils]: 58: Hoare triple {56479#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {56479#(< ~counter~0 45)} is VALID [2022-04-08 06:04:49,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {56504#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56479#(< ~counter~0 45)} is VALID [2022-04-08 06:04:49,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {56504#(< ~counter~0 44)} assume !!(0 != ~r~0); {56504#(< ~counter~0 44)} is VALID [2022-04-08 06:04:49,592 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {55990#true} {56504#(< ~counter~0 44)} #94#return; {56504#(< ~counter~0 44)} is VALID [2022-04-08 06:04:49,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,592 INFO L272 TraceCheckUtils]: 51: Hoare triple {56504#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {56504#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {56504#(< ~counter~0 44)} is VALID [2022-04-08 06:04:49,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {56529#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56504#(< ~counter~0 44)} is VALID [2022-04-08 06:04:49,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {56529#(< ~counter~0 43)} assume !(~r~0 < 0); {56529#(< ~counter~0 43)} is VALID [2022-04-08 06:04:49,594 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55990#true} {56529#(< ~counter~0 43)} #98#return; {56529#(< ~counter~0 43)} is VALID [2022-04-08 06:04:49,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,594 INFO L272 TraceCheckUtils]: 43: Hoare triple {56529#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {56529#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {56529#(< ~counter~0 43)} is VALID [2022-04-08 06:04:49,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {56554#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56529#(< ~counter~0 43)} is VALID [2022-04-08 06:04:49,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {56554#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56554#(< ~counter~0 42)} is VALID [2022-04-08 06:04:49,596 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55990#true} {56554#(< ~counter~0 42)} #98#return; {56554#(< ~counter~0 42)} is VALID [2022-04-08 06:04:49,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,596 INFO L272 TraceCheckUtils]: 35: Hoare triple {56554#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {56554#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {56554#(< ~counter~0 42)} is VALID [2022-04-08 06:04:49,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {56579#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56554#(< ~counter~0 42)} is VALID [2022-04-08 06:04:49,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {56579#(< ~counter~0 41)} assume !(~r~0 > 0); {56579#(< ~counter~0 41)} is VALID [2022-04-08 06:04:49,598 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {55990#true} {56579#(< ~counter~0 41)} #96#return; {56579#(< ~counter~0 41)} is VALID [2022-04-08 06:04:49,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,598 INFO L272 TraceCheckUtils]: 27: Hoare triple {56579#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {56579#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {56579#(< ~counter~0 41)} is VALID [2022-04-08 06:04:49,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {56604#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56579#(< ~counter~0 41)} is VALID [2022-04-08 06:04:49,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {56604#(< ~counter~0 40)} assume !!(0 != ~r~0); {56604#(< ~counter~0 40)} is VALID [2022-04-08 06:04:49,600 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55990#true} {56604#(< ~counter~0 40)} #94#return; {56604#(< ~counter~0 40)} is VALID [2022-04-08 06:04:49,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,600 INFO L272 TraceCheckUtils]: 19: Hoare triple {56604#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {56604#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {56604#(< ~counter~0 40)} is VALID [2022-04-08 06:04:49,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {56629#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56604#(< ~counter~0 40)} is VALID [2022-04-08 06:04:49,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {56629#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56629#(< ~counter~0 39)} is VALID [2022-04-08 06:04:49,602 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55990#true} {56629#(< ~counter~0 39)} #92#return; {56629#(< ~counter~0 39)} is VALID [2022-04-08 06:04:49,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,602 INFO L272 TraceCheckUtils]: 11: Hoare triple {56629#(< ~counter~0 39)} 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)); {55990#true} is VALID [2022-04-08 06:04:49,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55990#true} {56629#(< ~counter~0 39)} #90#return; {56629#(< ~counter~0 39)} is VALID [2022-04-08 06:04:49,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-08 06:04:49,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-08 06:04:49,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-08 06:04:49,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {56629#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55990#true} is VALID [2022-04-08 06:04:49,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {56629#(< ~counter~0 39)} 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; {56629#(< ~counter~0 39)} is VALID [2022-04-08 06:04:49,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {56629#(< ~counter~0 39)} call #t~ret9 := main(); {56629#(< ~counter~0 39)} is VALID [2022-04-08 06:04:49,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56629#(< ~counter~0 39)} {55990#true} #102#return; {56629#(< ~counter~0 39)} is VALID [2022-04-08 06:04:49,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {56629#(< ~counter~0 39)} assume true; {56629#(< ~counter~0 39)} is VALID [2022-04-08 06:04:49,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {55990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56629#(< ~counter~0 39)} is VALID [2022-04-08 06:04:49,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {55990#true} call ULTIMATE.init(); {55990#true} is VALID [2022-04-08 06:04:49,605 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-08 06:04:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738901214] [2022-04-08 06:04:49,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506757292] [2022-04-08 06:04:49,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506757292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:49,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:49,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 06:04:49,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:49,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [676145479] [2022-04-08 06:04:49,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [676145479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:49,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:49,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:04:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335936047] [2022-04-08 06:04:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:49,606 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-08 06:04:49,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:49,606 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-08 06:04:49,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:49,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:04:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:04:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 06:04:49,690 INFO L87 Difference]: Start difference. First operand 538 states and 733 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-08 06:04:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:51,837 INFO L93 Difference]: Finished difference Result 593 states and 810 transitions. [2022-04-08 06:04:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 06:04:51,837 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-08 06:04:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:51,838 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-08 06:04:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-08 06:04:51,839 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-08 06:04:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-08 06:04:51,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-08 06:04:52,034 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-08 06:04:52,053 INFO L225 Difference]: With dead ends: 593 [2022-04-08 06:04:52,053 INFO L226 Difference]: Without dead ends: 582 [2022-04-08 06:04:52,053 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-08 06:04:52,054 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 173 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:52,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 262 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:04:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-04-08 06:04:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 560. [2022-04-08 06:04:53,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:53,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:53,243 INFO L74 IsIncluded]: Start isIncluded. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:53,243 INFO L87 Difference]: Start difference. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:53,262 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-08 06:04:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-08 06:04:53,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:53,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:53,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-08 06:04:53,264 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-08 06:04:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:53,283 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-08 06:04:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-08 06:04:53,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:53,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:53,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:53,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-08 06:04:53,308 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 111 [2022-04-08 06:04:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:53,308 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-08 06:04:53,309 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-08 06:04:53,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-08 06:04:56,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 768 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-08 06:04:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 06:04:56,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:56,048 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-08 06:04:56,053 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-08 06:04:56,249 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-08 06:04:56,249 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:56,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-08 06:04:56,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:56,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406851867] [2022-04-08 06:04:56,250 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-08 06:04:56,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:56,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005273987] [2022-04-08 06:04:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:56,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:56,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660804559] [2022-04-08 06:04:56,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:04:56,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:56,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:56,263 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-08 06:04:56,264 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-08 06:04:56,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:04:56,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:56,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:04:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:56,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:57,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {60169#true} call ULTIMATE.init(); {60169#true} is VALID [2022-04-08 06:04:57,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {60169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60169#true} is VALID [2022-04-08 06:04:57,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60169#true} {60169#true} #102#return; {60169#true} is VALID [2022-04-08 06:04:57,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {60169#true} call #t~ret9 := main(); {60169#true} is VALID [2022-04-08 06:04:57,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {60169#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; {60169#true} is VALID [2022-04-08 06:04:57,295 INFO L272 TraceCheckUtils]: 6: Hoare triple {60169#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60169#true} {60169#true} #90#return; {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L272 TraceCheckUtils]: 11: Hoare triple {60169#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)); {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60169#true} {60169#true} #92#return; {60169#true} is VALID [2022-04-08 06:04:57,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {60169#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {60222#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post6 < 50);havoc #t~post6; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,297 INFO L272 TraceCheckUtils]: 19: Hoare triple {60222#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,298 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #94#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {60222#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,299 INFO L272 TraceCheckUtils]: 27: Hoare triple {60222#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,299 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #96#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {60222#(<= 1 main_~v~0)} assume !(~r~0 > 0); {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {60222#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,300 INFO L272 TraceCheckUtils]: 35: Hoare triple {60222#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,301 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #98#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-08 06:04:57,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 50);havoc #t~post8; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,304 INFO L272 TraceCheckUtils]: 43: Hoare triple {60295#(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)); {60169#true} is VALID [2022-04-08 06:04:57,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,304 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 50);havoc #t~post6; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,305 INFO L272 TraceCheckUtils]: 51: Hoare triple {60295#(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)); {60169#true} is VALID [2022-04-08 06:04:57,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,306 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 50);havoc #t~post7; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,307 INFO L272 TraceCheckUtils]: 59: Hoare triple {60295#(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)); {60169#true} is VALID [2022-04-08 06:04:57,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,308 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:04:57,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {60295#(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; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 06:04:57,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 06:04:57,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 06:04:57,310 INFO L272 TraceCheckUtils]: 67: Hoare triple {60368#(< (+ 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)); {60169#true} is VALID [2022-04-08 06:04:57,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,310 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60169#true} {60368#(< (+ main_~r~0 3) main_~u~0)} #96#return; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 06:04:57,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 06:04:57,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 06:04:57,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 06:04:57,312 INFO L272 TraceCheckUtils]: 75: Hoare triple {60393#(< (+ 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)); {60169#true} is VALID [2022-04-08 06:04:57,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,312 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60169#true} {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 06:04:57,313 INFO L290 TraceCheckUtils]: 80: Hoare triple {60393#(< (+ 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; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:57,313 INFO L290 TraceCheckUtils]: 81: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:57,313 INFO L290 TraceCheckUtils]: 82: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:57,314 INFO L272 TraceCheckUtils]: 83: Hoare triple {60418#(< 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)); {60169#true} is VALID [2022-04-08 06:04:57,314 INFO L290 TraceCheckUtils]: 84: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,314 INFO L290 TraceCheckUtils]: 85: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,314 INFO L290 TraceCheckUtils]: 86: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,314 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60169#true} {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:57,314 INFO L290 TraceCheckUtils]: 88: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:57,315 INFO L290 TraceCheckUtils]: 89: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:57,315 INFO L290 TraceCheckUtils]: 90: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:57,315 INFO L272 TraceCheckUtils]: 91: Hoare triple {60418#(< 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)); {60169#true} is VALID [2022-04-08 06:04:57,315 INFO L290 TraceCheckUtils]: 92: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,315 INFO L290 TraceCheckUtils]: 93: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,315 INFO L290 TraceCheckUtils]: 94: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,316 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60169#true} {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:04:57,317 INFO L290 TraceCheckUtils]: 96: Hoare triple {60418#(< 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; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 06:04:57,318 INFO L290 TraceCheckUtils]: 97: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 06:04:57,318 INFO L290 TraceCheckUtils]: 98: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 06:04:57,318 INFO L272 TraceCheckUtils]: 99: Hoare triple {60467#(< 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)); {60169#true} is VALID [2022-04-08 06:04:57,318 INFO L290 TraceCheckUtils]: 100: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,318 INFO L290 TraceCheckUtils]: 101: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,318 INFO L290 TraceCheckUtils]: 102: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,319 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60169#true} {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 06:04:57,319 INFO L290 TraceCheckUtils]: 104: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60170#false} is VALID [2022-04-08 06:04:57,320 INFO L290 TraceCheckUtils]: 105: Hoare triple {60170#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60170#false} is VALID [2022-04-08 06:04:57,320 INFO L290 TraceCheckUtils]: 106: Hoare triple {60170#false} assume !(#t~post8 < 50);havoc #t~post8; {60170#false} is VALID [2022-04-08 06:04:57,320 INFO L290 TraceCheckUtils]: 107: Hoare triple {60170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60170#false} is VALID [2022-04-08 06:04:57,320 INFO L290 TraceCheckUtils]: 108: Hoare triple {60170#false} assume !(#t~post6 < 50);havoc #t~post6; {60170#false} is VALID [2022-04-08 06:04:57,320 INFO L272 TraceCheckUtils]: 109: Hoare triple {60170#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)); {60170#false} is VALID [2022-04-08 06:04:57,320 INFO L290 TraceCheckUtils]: 110: Hoare triple {60170#false} ~cond := #in~cond; {60170#false} is VALID [2022-04-08 06:04:57,320 INFO L290 TraceCheckUtils]: 111: Hoare triple {60170#false} assume 0 == ~cond; {60170#false} is VALID [2022-04-08 06:04:57,320 INFO L290 TraceCheckUtils]: 112: Hoare triple {60170#false} assume !false; {60170#false} is VALID [2022-04-08 06:04:57,320 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-08 06:04:57,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:57,790 INFO L290 TraceCheckUtils]: 112: Hoare triple {60170#false} assume !false; {60170#false} is VALID [2022-04-08 06:04:57,790 INFO L290 TraceCheckUtils]: 111: Hoare triple {60170#false} assume 0 == ~cond; {60170#false} is VALID [2022-04-08 06:04:57,790 INFO L290 TraceCheckUtils]: 110: Hoare triple {60170#false} ~cond := #in~cond; {60170#false} is VALID [2022-04-08 06:04:57,790 INFO L272 TraceCheckUtils]: 109: Hoare triple {60170#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)); {60170#false} is VALID [2022-04-08 06:04:57,790 INFO L290 TraceCheckUtils]: 108: Hoare triple {60170#false} assume !(#t~post6 < 50);havoc #t~post6; {60170#false} is VALID [2022-04-08 06:04:57,790 INFO L290 TraceCheckUtils]: 107: Hoare triple {60170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60170#false} is VALID [2022-04-08 06:04:57,790 INFO L290 TraceCheckUtils]: 106: Hoare triple {60170#false} assume !(#t~post8 < 50);havoc #t~post8; {60170#false} is VALID [2022-04-08 06:04:57,790 INFO L290 TraceCheckUtils]: 105: Hoare triple {60170#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60170#false} is VALID [2022-04-08 06:04:57,791 INFO L290 TraceCheckUtils]: 104: Hoare triple {60540#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60170#false} is VALID [2022-04-08 06:04:57,791 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60169#true} {60540#(not (< main_~r~0 0))} #98#return; {60540#(not (< main_~r~0 0))} is VALID [2022-04-08 06:04:57,791 INFO L290 TraceCheckUtils]: 102: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,791 INFO L290 TraceCheckUtils]: 101: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,791 INFO L290 TraceCheckUtils]: 100: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,791 INFO L272 TraceCheckUtils]: 99: Hoare triple {60540#(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)); {60169#true} is VALID [2022-04-08 06:04:57,792 INFO L290 TraceCheckUtils]: 98: Hoare triple {60540#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {60540#(not (< main_~r~0 0))} is VALID [2022-04-08 06:04:57,792 INFO L290 TraceCheckUtils]: 97: Hoare triple {60540#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60540#(not (< main_~r~0 0))} is VALID [2022-04-08 06:04:57,793 INFO L290 TraceCheckUtils]: 96: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60540#(not (< main_~r~0 0))} is VALID [2022-04-08 06:04:57,793 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60169#true} {60565#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:57,793 INFO L290 TraceCheckUtils]: 94: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,793 INFO L290 TraceCheckUtils]: 93: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,793 INFO L290 TraceCheckUtils]: 92: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,793 INFO L272 TraceCheckUtils]: 91: Hoare triple {60565#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,794 INFO L290 TraceCheckUtils]: 90: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:57,794 INFO L290 TraceCheckUtils]: 89: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:57,794 INFO L290 TraceCheckUtils]: 88: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:57,795 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60169#true} {60565#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:57,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,795 INFO L272 TraceCheckUtils]: 83: Hoare triple {60565#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,795 INFO L290 TraceCheckUtils]: 82: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:57,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:57,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {60614#(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; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:04:57,797 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60169#true} {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:04:57,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,797 INFO L272 TraceCheckUtils]: 75: Hoare triple {60614#(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)); {60169#true} is VALID [2022-04-08 06:04:57,797 INFO L290 TraceCheckUtils]: 74: Hoare triple {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:04:57,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:04:57,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {60639#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:04:57,800 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60169#true} {60639#(<= main_~r~0 main_~u~0)} #96#return; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:57,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,800 INFO L272 TraceCheckUtils]: 67: Hoare triple {60639#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {60639#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:57,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {60639#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:57,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:04:57,802 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,802 INFO L272 TraceCheckUtils]: 59: Hoare triple {60664#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 50);havoc #t~post7; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,803 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,804 INFO L272 TraceCheckUtils]: 51: Hoare triple {60664#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 50);havoc #t~post6; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,805 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,805 INFO L272 TraceCheckUtils]: 43: Hoare triple {60664#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 50);havoc #t~post8; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:04:57,807 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #98#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,807 INFO L272 TraceCheckUtils]: 35: Hoare triple {60737#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,809 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #96#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,809 INFO L272 TraceCheckUtils]: 27: Hoare triple {60737#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,810 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #94#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,811 INFO L272 TraceCheckUtils]: 19: Hoare triple {60737#(<= 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)); {60169#true} is VALID [2022-04-08 06:04:57,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 50);havoc #t~post6; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {60169#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:04:57,812 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60169#true} {60169#true} #92#return; {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L272 TraceCheckUtils]: 11: Hoare triple {60169#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)); {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60169#true} {60169#true} #90#return; {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-08 06:04:57,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {60169#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60169#true} is VALID [2022-04-08 06:04:57,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {60169#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; {60169#true} is VALID [2022-04-08 06:04:57,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {60169#true} call #t~ret9 := main(); {60169#true} is VALID [2022-04-08 06:04:57,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60169#true} {60169#true} #102#return; {60169#true} is VALID [2022-04-08 06:04:57,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-08 06:04:57,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {60169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60169#true} is VALID [2022-04-08 06:04:57,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {60169#true} call ULTIMATE.init(); {60169#true} is VALID [2022-04-08 06:04:57,813 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-08 06:04:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:57,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005273987] [2022-04-08 06:04:57,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:57,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660804559] [2022-04-08 06:04:57,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660804559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:57,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:57,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:04:57,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:57,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406851867] [2022-04-08 06:04:57,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406851867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:57,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:57,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:04:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583391570] [2022-04-08 06:04:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:57,815 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-08 06:04:57,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:57,815 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-08 06:04:57,889 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-08 06:04:57,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:04:57,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:04:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:04:57,890 INFO L87 Difference]: Start difference. First operand 560 states and 768 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-08 06:05:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:01,284 INFO L93 Difference]: Finished difference Result 862 states and 1224 transitions. [2022-04-08 06:05:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:05:01,284 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-08 06:05:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:01,284 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-08 06:05:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-08 06:05:01,286 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-08 06:05:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-08 06:05:01,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-08 06:05:01,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:01,498 INFO L225 Difference]: With dead ends: 862 [2022-04-08 06:05:01,498 INFO L226 Difference]: Without dead ends: 711 [2022-04-08 06:05:01,499 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-08 06:05:01,500 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 83 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:01,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 328 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:05:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-04-08 06:05:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 560. [2022-04-08 06:05:03,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:03,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:03,119 INFO L74 IsIncluded]: Start isIncluded. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:03,119 INFO L87 Difference]: Start difference. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:03,149 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-08 06:05:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-08 06:05:03,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:03,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:03,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-08 06:05:03,152 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-08 06:05:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:03,181 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-08 06:05:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-08 06:05:03,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:03,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:03,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:03,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-08 06:05:03,208 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 113 [2022-04-08 06:05:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:03,208 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-08 06:05:03,209 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-08 06:05:03,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-08 06:05:06,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 768 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-08 06:05:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 06:05:06,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:06,939 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-08 06:05:06,956 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-08 06:05:07,139 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-08 06:05:07,140 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-08 06:05:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:07,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [834321892] [2022-04-08 06:05:07,140 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-08 06:05:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:07,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020218115] [2022-04-08 06:05:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:07,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:07,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1776411755] [2022-04-08 06:05:07,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:05:07,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:07,154 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-08 06:05:07,156 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-08 06:05:07,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:05:07,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:07,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 06:05:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:07,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:08,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {65136#true} call ULTIMATE.init(); {65136#true} is VALID [2022-04-08 06:05:08,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {65136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65144#(<= ~counter~0 0)} {65136#true} #102#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {65144#(<= ~counter~0 0)} call #t~ret9 := main(); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {65144#(<= ~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; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,150 INFO L272 TraceCheckUtils]: 6: Hoare triple {65144#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {65144#(<= ~counter~0 0)} ~cond := #in~cond; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {65144#(<= ~counter~0 0)} assume !(0 == ~cond); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,151 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65144#(<= ~counter~0 0)} {65144#(<= ~counter~0 0)} #90#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,152 INFO L272 TraceCheckUtils]: 11: Hoare triple {65144#(<= ~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)); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {65144#(<= ~counter~0 0)} ~cond := #in~cond; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {65144#(<= ~counter~0 0)} assume !(0 == ~cond); {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,153 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65144#(<= ~counter~0 0)} {65144#(<= ~counter~0 0)} #92#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {65144#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65144#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:08,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {65144#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:08,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {65193#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:08,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {65193#(<= ~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)); {65193#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:08,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {65193#(<= ~counter~0 1)} ~cond := #in~cond; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:08,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {65193#(<= ~counter~0 1)} assume !(0 == ~cond); {65193#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:08,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {65193#(<= ~counter~0 1)} assume true; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:08,157 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65193#(<= ~counter~0 1)} {65193#(<= ~counter~0 1)} #94#return; {65193#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:08,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {65193#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65193#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:08,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {65193#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:08,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {65218#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:08,159 INFO L272 TraceCheckUtils]: 27: Hoare triple {65218#(<= ~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)); {65218#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:08,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {65218#(<= ~counter~0 2)} ~cond := #in~cond; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:08,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {65218#(<= ~counter~0 2)} assume !(0 == ~cond); {65218#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:08,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {65218#(<= ~counter~0 2)} assume true; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:08,160 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65218#(<= ~counter~0 2)} {65218#(<= ~counter~0 2)} #96#return; {65218#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:08,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {65218#(<= ~counter~0 2)} assume !(~r~0 > 0); {65218#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:08,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {65218#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:08,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {65243#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:08,162 INFO L272 TraceCheckUtils]: 35: Hoare triple {65243#(<= ~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)); {65243#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:08,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {65243#(<= ~counter~0 3)} ~cond := #in~cond; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:08,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {65243#(<= ~counter~0 3)} assume !(0 == ~cond); {65243#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:08,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {65243#(<= ~counter~0 3)} assume true; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:08,164 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65243#(<= ~counter~0 3)} {65243#(<= ~counter~0 3)} #98#return; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:08,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {65243#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65243#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:08,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {65243#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:08,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {65268#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:08,166 INFO L272 TraceCheckUtils]: 43: Hoare triple {65268#(<= ~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)); {65268#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:08,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {65268#(<= ~counter~0 4)} ~cond := #in~cond; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:08,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {65268#(<= ~counter~0 4)} assume !(0 == ~cond); {65268#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:08,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {65268#(<= ~counter~0 4)} assume true; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:08,167 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65268#(<= ~counter~0 4)} {65268#(<= ~counter~0 4)} #98#return; {65268#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:08,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {65268#(<= ~counter~0 4)} assume !(~r~0 < 0); {65268#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:08,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {65268#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:08,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {65293#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:08,169 INFO L272 TraceCheckUtils]: 51: Hoare triple {65293#(<= ~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)); {65293#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:08,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {65293#(<= ~counter~0 5)} ~cond := #in~cond; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:08,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {65293#(<= ~counter~0 5)} assume !(0 == ~cond); {65293#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:08,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {65293#(<= ~counter~0 5)} assume true; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:08,171 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65293#(<= ~counter~0 5)} {65293#(<= ~counter~0 5)} #94#return; {65293#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:08,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {65293#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65293#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:08,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {65293#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:08,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {65318#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:08,172 INFO L272 TraceCheckUtils]: 59: Hoare triple {65318#(<= ~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)); {65318#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:08,173 INFO L290 TraceCheckUtils]: 60: Hoare triple {65318#(<= ~counter~0 6)} ~cond := #in~cond; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:08,173 INFO L290 TraceCheckUtils]: 61: Hoare triple {65318#(<= ~counter~0 6)} assume !(0 == ~cond); {65318#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:08,173 INFO L290 TraceCheckUtils]: 62: Hoare triple {65318#(<= ~counter~0 6)} assume true; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:08,174 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65318#(<= ~counter~0 6)} {65318#(<= ~counter~0 6)} #96#return; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:08,174 INFO L290 TraceCheckUtils]: 64: Hoare triple {65318#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65318#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:08,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {65318#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:08,175 INFO L290 TraceCheckUtils]: 66: Hoare triple {65343#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:08,176 INFO L272 TraceCheckUtils]: 67: Hoare triple {65343#(<= ~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)); {65343#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:08,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {65343#(<= ~counter~0 7)} ~cond := #in~cond; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:08,176 INFO L290 TraceCheckUtils]: 69: Hoare triple {65343#(<= ~counter~0 7)} assume !(0 == ~cond); {65343#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:08,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {65343#(<= ~counter~0 7)} assume true; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:08,177 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65343#(<= ~counter~0 7)} {65343#(<= ~counter~0 7)} #96#return; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:08,177 INFO L290 TraceCheckUtils]: 72: Hoare triple {65343#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65343#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:08,178 INFO L290 TraceCheckUtils]: 73: Hoare triple {65343#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:08,178 INFO L290 TraceCheckUtils]: 74: Hoare triple {65368#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:08,179 INFO L272 TraceCheckUtils]: 75: Hoare triple {65368#(<= ~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)); {65368#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:08,179 INFO L290 TraceCheckUtils]: 76: Hoare triple {65368#(<= ~counter~0 8)} ~cond := #in~cond; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:08,179 INFO L290 TraceCheckUtils]: 77: Hoare triple {65368#(<= ~counter~0 8)} assume !(0 == ~cond); {65368#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:08,180 INFO L290 TraceCheckUtils]: 78: Hoare triple {65368#(<= ~counter~0 8)} assume true; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:08,180 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65368#(<= ~counter~0 8)} {65368#(<= ~counter~0 8)} #96#return; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:08,181 INFO L290 TraceCheckUtils]: 80: Hoare triple {65368#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65368#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:08,182 INFO L290 TraceCheckUtils]: 81: Hoare triple {65368#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:08,182 INFO L290 TraceCheckUtils]: 82: Hoare triple {65393#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:08,182 INFO L272 TraceCheckUtils]: 83: Hoare triple {65393#(<= ~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)); {65393#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:08,183 INFO L290 TraceCheckUtils]: 84: Hoare triple {65393#(<= ~counter~0 9)} ~cond := #in~cond; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:08,183 INFO L290 TraceCheckUtils]: 85: Hoare triple {65393#(<= ~counter~0 9)} assume !(0 == ~cond); {65393#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:08,183 INFO L290 TraceCheckUtils]: 86: Hoare triple {65393#(<= ~counter~0 9)} assume true; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:08,184 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65393#(<= ~counter~0 9)} {65393#(<= ~counter~0 9)} #96#return; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:08,184 INFO L290 TraceCheckUtils]: 88: Hoare triple {65393#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65393#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:08,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {65393#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:08,185 INFO L290 TraceCheckUtils]: 90: Hoare triple {65418#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:08,186 INFO L272 TraceCheckUtils]: 91: Hoare triple {65418#(<= ~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)); {65418#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:08,186 INFO L290 TraceCheckUtils]: 92: Hoare triple {65418#(<= ~counter~0 10)} ~cond := #in~cond; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:08,186 INFO L290 TraceCheckUtils]: 93: Hoare triple {65418#(<= ~counter~0 10)} assume !(0 == ~cond); {65418#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:08,187 INFO L290 TraceCheckUtils]: 94: Hoare triple {65418#(<= ~counter~0 10)} assume true; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:08,187 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65418#(<= ~counter~0 10)} {65418#(<= ~counter~0 10)} #96#return; {65418#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:08,187 INFO L290 TraceCheckUtils]: 96: Hoare triple {65418#(<= ~counter~0 10)} assume !(~r~0 > 0); {65418#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:08,188 INFO L290 TraceCheckUtils]: 97: Hoare triple {65418#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:08,189 INFO L290 TraceCheckUtils]: 98: Hoare triple {65443#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:08,189 INFO L272 TraceCheckUtils]: 99: Hoare triple {65443#(<= ~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)); {65443#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:08,189 INFO L290 TraceCheckUtils]: 100: Hoare triple {65443#(<= ~counter~0 11)} ~cond := #in~cond; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:08,190 INFO L290 TraceCheckUtils]: 101: Hoare triple {65443#(<= ~counter~0 11)} assume !(0 == ~cond); {65443#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:08,190 INFO L290 TraceCheckUtils]: 102: Hoare triple {65443#(<= ~counter~0 11)} assume true; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:08,190 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65443#(<= ~counter~0 11)} {65443#(<= ~counter~0 11)} #98#return; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:08,191 INFO L290 TraceCheckUtils]: 104: Hoare triple {65443#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65443#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:08,191 INFO L290 TraceCheckUtils]: 105: Hoare triple {65443#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65468#(<= |main_#t~post8| 11)} is VALID [2022-04-08 06:05:08,191 INFO L290 TraceCheckUtils]: 106: Hoare triple {65468#(<= |main_#t~post8| 11)} assume !(#t~post8 < 50);havoc #t~post8; {65137#false} is VALID [2022-04-08 06:05:08,191 INFO L290 TraceCheckUtils]: 107: Hoare triple {65137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65137#false} is VALID [2022-04-08 06:05:08,192 INFO L290 TraceCheckUtils]: 108: Hoare triple {65137#false} assume !(#t~post6 < 50);havoc #t~post6; {65137#false} is VALID [2022-04-08 06:05:08,192 INFO L272 TraceCheckUtils]: 109: Hoare triple {65137#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)); {65137#false} is VALID [2022-04-08 06:05:08,192 INFO L290 TraceCheckUtils]: 110: Hoare triple {65137#false} ~cond := #in~cond; {65137#false} is VALID [2022-04-08 06:05:08,192 INFO L290 TraceCheckUtils]: 111: Hoare triple {65137#false} assume 0 == ~cond; {65137#false} is VALID [2022-04-08 06:05:08,192 INFO L290 TraceCheckUtils]: 112: Hoare triple {65137#false} assume !false; {65137#false} is VALID [2022-04-08 06:05:08,192 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-08 06:05:08,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:05:08,849 INFO L290 TraceCheckUtils]: 112: Hoare triple {65137#false} assume !false; {65137#false} is VALID [2022-04-08 06:05:08,849 INFO L290 TraceCheckUtils]: 111: Hoare triple {65137#false} assume 0 == ~cond; {65137#false} is VALID [2022-04-08 06:05:08,849 INFO L290 TraceCheckUtils]: 110: Hoare triple {65137#false} ~cond := #in~cond; {65137#false} is VALID [2022-04-08 06:05:08,849 INFO L272 TraceCheckUtils]: 109: Hoare triple {65137#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)); {65137#false} is VALID [2022-04-08 06:05:08,850 INFO L290 TraceCheckUtils]: 108: Hoare triple {65137#false} assume !(#t~post6 < 50);havoc #t~post6; {65137#false} is VALID [2022-04-08 06:05:08,850 INFO L290 TraceCheckUtils]: 107: Hoare triple {65137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65137#false} is VALID [2022-04-08 06:05:08,850 INFO L290 TraceCheckUtils]: 106: Hoare triple {65508#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {65137#false} is VALID [2022-04-08 06:05:08,850 INFO L290 TraceCheckUtils]: 105: Hoare triple {65512#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65508#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:05:08,851 INFO L290 TraceCheckUtils]: 104: Hoare triple {65512#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65512#(< ~counter~0 50)} is VALID [2022-04-08 06:05:08,851 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65136#true} {65512#(< ~counter~0 50)} #98#return; {65512#(< ~counter~0 50)} is VALID [2022-04-08 06:05:08,851 INFO L290 TraceCheckUtils]: 102: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,851 INFO L290 TraceCheckUtils]: 101: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,851 INFO L272 TraceCheckUtils]: 99: Hoare triple {65512#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,852 INFO L290 TraceCheckUtils]: 98: Hoare triple {65512#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {65512#(< ~counter~0 50)} is VALID [2022-04-08 06:05:08,853 INFO L290 TraceCheckUtils]: 97: Hoare triple {65537#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65512#(< ~counter~0 50)} is VALID [2022-04-08 06:05:08,854 INFO L290 TraceCheckUtils]: 96: Hoare triple {65537#(< ~counter~0 49)} assume !(~r~0 > 0); {65537#(< ~counter~0 49)} is VALID [2022-04-08 06:05:08,854 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65136#true} {65537#(< ~counter~0 49)} #96#return; {65537#(< ~counter~0 49)} is VALID [2022-04-08 06:05:08,854 INFO L290 TraceCheckUtils]: 94: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,854 INFO L290 TraceCheckUtils]: 93: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,854 INFO L290 TraceCheckUtils]: 92: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,854 INFO L272 TraceCheckUtils]: 91: Hoare triple {65537#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,855 INFO L290 TraceCheckUtils]: 90: Hoare triple {65537#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {65537#(< ~counter~0 49)} is VALID [2022-04-08 06:05:08,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {65562#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65537#(< ~counter~0 49)} is VALID [2022-04-08 06:05:08,856 INFO L290 TraceCheckUtils]: 88: Hoare triple {65562#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65562#(< ~counter~0 48)} is VALID [2022-04-08 06:05:08,856 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65136#true} {65562#(< ~counter~0 48)} #96#return; {65562#(< ~counter~0 48)} is VALID [2022-04-08 06:05:08,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,857 INFO L272 TraceCheckUtils]: 83: Hoare triple {65562#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,857 INFO L290 TraceCheckUtils]: 82: Hoare triple {65562#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {65562#(< ~counter~0 48)} is VALID [2022-04-08 06:05:08,858 INFO L290 TraceCheckUtils]: 81: Hoare triple {65587#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65562#(< ~counter~0 48)} is VALID [2022-04-08 06:05:08,858 INFO L290 TraceCheckUtils]: 80: Hoare triple {65587#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65587#(< ~counter~0 47)} is VALID [2022-04-08 06:05:08,859 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65136#true} {65587#(< ~counter~0 47)} #96#return; {65587#(< ~counter~0 47)} is VALID [2022-04-08 06:05:08,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,859 INFO L272 TraceCheckUtils]: 75: Hoare triple {65587#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {65587#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {65587#(< ~counter~0 47)} is VALID [2022-04-08 06:05:08,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {65612#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65587#(< ~counter~0 47)} is VALID [2022-04-08 06:05:08,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {65612#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65612#(< ~counter~0 46)} is VALID [2022-04-08 06:05:08,861 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65136#true} {65612#(< ~counter~0 46)} #96#return; {65612#(< ~counter~0 46)} is VALID [2022-04-08 06:05:08,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,861 INFO L272 TraceCheckUtils]: 67: Hoare triple {65612#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {65612#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {65612#(< ~counter~0 46)} is VALID [2022-04-08 06:05:08,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {65637#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65612#(< ~counter~0 46)} is VALID [2022-04-08 06:05:08,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {65637#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65637#(< ~counter~0 45)} is VALID [2022-04-08 06:05:08,863 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65136#true} {65637#(< ~counter~0 45)} #96#return; {65637#(< ~counter~0 45)} is VALID [2022-04-08 06:05:08,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,863 INFO L272 TraceCheckUtils]: 59: Hoare triple {65637#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {65637#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {65637#(< ~counter~0 45)} is VALID [2022-04-08 06:05:08,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {65662#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65637#(< ~counter~0 45)} is VALID [2022-04-08 06:05:08,864 INFO L290 TraceCheckUtils]: 56: Hoare triple {65662#(< ~counter~0 44)} assume !!(0 != ~r~0); {65662#(< ~counter~0 44)} is VALID [2022-04-08 06:05:08,865 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65136#true} {65662#(< ~counter~0 44)} #94#return; {65662#(< ~counter~0 44)} is VALID [2022-04-08 06:05:08,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,865 INFO L272 TraceCheckUtils]: 51: Hoare triple {65662#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {65662#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {65662#(< ~counter~0 44)} is VALID [2022-04-08 06:05:08,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {65687#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65662#(< ~counter~0 44)} is VALID [2022-04-08 06:05:08,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {65687#(< ~counter~0 43)} assume !(~r~0 < 0); {65687#(< ~counter~0 43)} is VALID [2022-04-08 06:05:08,867 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65136#true} {65687#(< ~counter~0 43)} #98#return; {65687#(< ~counter~0 43)} is VALID [2022-04-08 06:05:08,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,867 INFO L272 TraceCheckUtils]: 43: Hoare triple {65687#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {65687#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {65687#(< ~counter~0 43)} is VALID [2022-04-08 06:05:08,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {65712#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65687#(< ~counter~0 43)} is VALID [2022-04-08 06:05:08,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {65712#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65712#(< ~counter~0 42)} is VALID [2022-04-08 06:05:08,869 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65136#true} {65712#(< ~counter~0 42)} #98#return; {65712#(< ~counter~0 42)} is VALID [2022-04-08 06:05:08,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,870 INFO L272 TraceCheckUtils]: 35: Hoare triple {65712#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {65712#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {65712#(< ~counter~0 42)} is VALID [2022-04-08 06:05:08,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {65737#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65712#(< ~counter~0 42)} is VALID [2022-04-08 06:05:08,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {65737#(< ~counter~0 41)} assume !(~r~0 > 0); {65737#(< ~counter~0 41)} is VALID [2022-04-08 06:05:08,871 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65136#true} {65737#(< ~counter~0 41)} #96#return; {65737#(< ~counter~0 41)} is VALID [2022-04-08 06:05:08,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,872 INFO L272 TraceCheckUtils]: 27: Hoare triple {65737#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {65737#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {65737#(< ~counter~0 41)} is VALID [2022-04-08 06:05:08,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {65762#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65737#(< ~counter~0 41)} is VALID [2022-04-08 06:05:08,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {65762#(< ~counter~0 40)} assume !!(0 != ~r~0); {65762#(< ~counter~0 40)} is VALID [2022-04-08 06:05:08,873 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65136#true} {65762#(< ~counter~0 40)} #94#return; {65762#(< ~counter~0 40)} is VALID [2022-04-08 06:05:08,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {65762#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {65762#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {65762#(< ~counter~0 40)} is VALID [2022-04-08 06:05:08,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {65787#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65762#(< ~counter~0 40)} is VALID [2022-04-08 06:05:08,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {65787#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65787#(< ~counter~0 39)} is VALID [2022-04-08 06:05:08,875 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65136#true} {65787#(< ~counter~0 39)} #92#return; {65787#(< ~counter~0 39)} is VALID [2022-04-08 06:05:08,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {65787#(< ~counter~0 39)} 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)); {65136#true} is VALID [2022-04-08 06:05:08,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65136#true} {65787#(< ~counter~0 39)} #90#return; {65787#(< ~counter~0 39)} is VALID [2022-04-08 06:05:08,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-08 06:05:08,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-08 06:05:08,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-08 06:05:08,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {65787#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65136#true} is VALID [2022-04-08 06:05:08,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {65787#(< ~counter~0 39)} 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; {65787#(< ~counter~0 39)} is VALID [2022-04-08 06:05:08,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {65787#(< ~counter~0 39)} call #t~ret9 := main(); {65787#(< ~counter~0 39)} is VALID [2022-04-08 06:05:08,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65787#(< ~counter~0 39)} {65136#true} #102#return; {65787#(< ~counter~0 39)} is VALID [2022-04-08 06:05:08,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {65787#(< ~counter~0 39)} assume true; {65787#(< ~counter~0 39)} is VALID [2022-04-08 06:05:08,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {65136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65787#(< ~counter~0 39)} is VALID [2022-04-08 06:05:08,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {65136#true} call ULTIMATE.init(); {65136#true} is VALID [2022-04-08 06:05:08,879 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-08 06:05:08,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:05:08,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020218115] [2022-04-08 06:05:08,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:05:08,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776411755] [2022-04-08 06:05:08,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776411755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:05:08,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:05:08,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 06:05:08,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:05:08,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [834321892] [2022-04-08 06:05:08,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [834321892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:05:08,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:05:08,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:05:08,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130238374] [2022-04-08 06:05:08,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:05:08,880 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-08 06:05:08,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:05:08,880 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-08 06:05:08,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:08,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:05:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:08,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:05:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 06:05:08,981 INFO L87 Difference]: Start difference. First operand 560 states and 768 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-08 06:05:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:11,774 INFO L93 Difference]: Finished difference Result 781 states and 1101 transitions. [2022-04-08 06:05:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 06:05:11,774 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-08 06:05:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:11,774 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-08 06:05:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-08 06:05:11,776 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-08 06:05:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-08 06:05:11,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-08 06:05:12,002 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-08 06:05:12,017 INFO L225 Difference]: With dead ends: 781 [2022-04-08 06:05:12,017 INFO L226 Difference]: Without dead ends: 588 [2022-04-08 06:05:12,018 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-08 06:05:12,019 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 163 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:12,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 262 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:05:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-08 06:05:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 578. [2022-04-08 06:05:13,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:13,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:13,674 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:13,675 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:13,688 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-08 06:05:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-08 06:05:13,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:13,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:13,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-08 06:05:13,690 INFO L87 Difference]: Start difference. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-08 06:05:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:13,710 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-08 06:05:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-08 06:05:13,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:13,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:13,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:13,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 790 transitions. [2022-04-08 06:05:13,737 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 790 transitions. Word has length 113 [2022-04-08 06:05:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:13,737 INFO L478 AbstractCegarLoop]: Abstraction has 578 states and 790 transitions. [2022-04-08 06:05:13,737 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-08 06:05:13,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 790 transitions. [2022-04-08 06:05:17,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 790 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 790 transitions. [2022-04-08 06:05:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 06:05:17,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:17,017 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-08 06:05:17,024 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-08 06:05:17,217 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-08 06:05:17,218 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:17,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-08 06:05:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:17,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638086221] [2022-04-08 06:05:17,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-08 06:05:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:17,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602351761] [2022-04-08 06:05:17,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:17,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:17,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395156344] [2022-04-08 06:05:17,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:05:17,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:17,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:17,235 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-08 06:05:17,259 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-08 06:05:17,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:05:17,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:17,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 06:05:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:17,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:17,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {69753#true} call ULTIMATE.init(); {69753#true} is VALID [2022-04-08 06:05:17,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {69753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69761#(<= ~counter~0 0)} {69753#true} #102#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {69761#(<= ~counter~0 0)} call #t~ret9 := main(); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {69761#(<= ~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; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {69761#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {69761#(<= ~counter~0 0)} ~cond := #in~cond; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {69761#(<= ~counter~0 0)} assume !(0 == ~cond); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69761#(<= ~counter~0 0)} {69761#(<= ~counter~0 0)} #90#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,895 INFO L272 TraceCheckUtils]: 11: Hoare triple {69761#(<= ~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)); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {69761#(<= ~counter~0 0)} ~cond := #in~cond; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {69761#(<= ~counter~0 0)} assume !(0 == ~cond); {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69761#(<= ~counter~0 0)} {69761#(<= ~counter~0 0)} #92#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {69761#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69761#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:17,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {69761#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:17,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {69810#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:17,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {69810#(<= ~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)); {69810#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:17,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {69810#(<= ~counter~0 1)} ~cond := #in~cond; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:17,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {69810#(<= ~counter~0 1)} assume !(0 == ~cond); {69810#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:17,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {69810#(<= ~counter~0 1)} assume true; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:17,900 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69810#(<= ~counter~0 1)} {69810#(<= ~counter~0 1)} #94#return; {69810#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:17,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {69810#(<= ~counter~0 1)} assume !!(0 != ~r~0); {69810#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:17,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {69810#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:17,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {69835#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:17,902 INFO L272 TraceCheckUtils]: 27: Hoare triple {69835#(<= ~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)); {69835#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:17,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {69835#(<= ~counter~0 2)} ~cond := #in~cond; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:17,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {69835#(<= ~counter~0 2)} assume !(0 == ~cond); {69835#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:17,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {69835#(<= ~counter~0 2)} assume true; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:17,903 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69835#(<= ~counter~0 2)} {69835#(<= ~counter~0 2)} #96#return; {69835#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:17,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {69835#(<= ~counter~0 2)} assume !(~r~0 > 0); {69835#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:17,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {69835#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:17,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {69860#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:17,905 INFO L272 TraceCheckUtils]: 35: Hoare triple {69860#(<= ~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)); {69860#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:17,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {69860#(<= ~counter~0 3)} ~cond := #in~cond; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:17,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {69860#(<= ~counter~0 3)} assume !(0 == ~cond); {69860#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:17,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {69860#(<= ~counter~0 3)} assume true; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:17,906 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69860#(<= ~counter~0 3)} {69860#(<= ~counter~0 3)} #98#return; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:17,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {69860#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69860#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:17,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {69860#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:17,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {69885#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:17,908 INFO L272 TraceCheckUtils]: 43: Hoare triple {69885#(<= ~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)); {69885#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:17,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {69885#(<= ~counter~0 4)} ~cond := #in~cond; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:17,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {69885#(<= ~counter~0 4)} assume !(0 == ~cond); {69885#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:17,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {69885#(<= ~counter~0 4)} assume true; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:17,910 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69885#(<= ~counter~0 4)} {69885#(<= ~counter~0 4)} #98#return; {69885#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:17,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {69885#(<= ~counter~0 4)} assume !(~r~0 < 0); {69885#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:17,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {69885#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:17,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {69910#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:17,911 INFO L272 TraceCheckUtils]: 51: Hoare triple {69910#(<= ~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)); {69910#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:17,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {69910#(<= ~counter~0 5)} ~cond := #in~cond; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:17,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {69910#(<= ~counter~0 5)} assume !(0 == ~cond); {69910#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:17,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {69910#(<= ~counter~0 5)} assume true; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:17,913 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69910#(<= ~counter~0 5)} {69910#(<= ~counter~0 5)} #94#return; {69910#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:17,913 INFO L290 TraceCheckUtils]: 56: Hoare triple {69910#(<= ~counter~0 5)} assume !!(0 != ~r~0); {69910#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:17,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {69910#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:17,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {69935#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:17,914 INFO L272 TraceCheckUtils]: 59: Hoare triple {69935#(<= ~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)); {69935#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:17,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {69935#(<= ~counter~0 6)} ~cond := #in~cond; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:17,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {69935#(<= ~counter~0 6)} assume !(0 == ~cond); {69935#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:17,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {69935#(<= ~counter~0 6)} assume true; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:17,916 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69935#(<= ~counter~0 6)} {69935#(<= ~counter~0 6)} #96#return; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:17,916 INFO L290 TraceCheckUtils]: 64: Hoare triple {69935#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69935#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:17,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {69935#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:17,917 INFO L290 TraceCheckUtils]: 66: Hoare triple {69960#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:17,917 INFO L272 TraceCheckUtils]: 67: Hoare triple {69960#(<= ~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)); {69960#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:17,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {69960#(<= ~counter~0 7)} ~cond := #in~cond; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:17,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {69960#(<= ~counter~0 7)} assume !(0 == ~cond); {69960#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:17,918 INFO L290 TraceCheckUtils]: 70: Hoare triple {69960#(<= ~counter~0 7)} assume true; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:17,919 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69960#(<= ~counter~0 7)} {69960#(<= ~counter~0 7)} #96#return; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:17,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {69960#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69960#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:17,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {69960#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:17,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {69985#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:17,921 INFO L272 TraceCheckUtils]: 75: Hoare triple {69985#(<= ~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)); {69985#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:17,921 INFO L290 TraceCheckUtils]: 76: Hoare triple {69985#(<= ~counter~0 8)} ~cond := #in~cond; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:17,921 INFO L290 TraceCheckUtils]: 77: Hoare triple {69985#(<= ~counter~0 8)} assume !(0 == ~cond); {69985#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:17,921 INFO L290 TraceCheckUtils]: 78: Hoare triple {69985#(<= ~counter~0 8)} assume true; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:17,922 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69985#(<= ~counter~0 8)} {69985#(<= ~counter~0 8)} #96#return; {69985#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:17,922 INFO L290 TraceCheckUtils]: 80: Hoare triple {69985#(<= ~counter~0 8)} assume !(~r~0 > 0); {69985#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:17,923 INFO L290 TraceCheckUtils]: 81: Hoare triple {69985#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:17,923 INFO L290 TraceCheckUtils]: 82: Hoare triple {70010#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:17,924 INFO L272 TraceCheckUtils]: 83: Hoare triple {70010#(<= ~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)); {70010#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:17,924 INFO L290 TraceCheckUtils]: 84: Hoare triple {70010#(<= ~counter~0 9)} ~cond := #in~cond; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:17,924 INFO L290 TraceCheckUtils]: 85: Hoare triple {70010#(<= ~counter~0 9)} assume !(0 == ~cond); {70010#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:17,924 INFO L290 TraceCheckUtils]: 86: Hoare triple {70010#(<= ~counter~0 9)} assume true; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:17,925 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70010#(<= ~counter~0 9)} {70010#(<= ~counter~0 9)} #98#return; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:17,925 INFO L290 TraceCheckUtils]: 88: Hoare triple {70010#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70010#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:17,926 INFO L290 TraceCheckUtils]: 89: Hoare triple {70010#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:17,926 INFO L290 TraceCheckUtils]: 90: Hoare triple {70035#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:17,927 INFO L272 TraceCheckUtils]: 91: Hoare triple {70035#(<= ~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)); {70035#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:17,927 INFO L290 TraceCheckUtils]: 92: Hoare triple {70035#(<= ~counter~0 10)} ~cond := #in~cond; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:17,927 INFO L290 TraceCheckUtils]: 93: Hoare triple {70035#(<= ~counter~0 10)} assume !(0 == ~cond); {70035#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:17,928 INFO L290 TraceCheckUtils]: 94: Hoare triple {70035#(<= ~counter~0 10)} assume true; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:17,928 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70035#(<= ~counter~0 10)} {70035#(<= ~counter~0 10)} #98#return; {70035#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:17,928 INFO L290 TraceCheckUtils]: 96: Hoare triple {70035#(<= ~counter~0 10)} assume !(~r~0 < 0); {70035#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:17,929 INFO L290 TraceCheckUtils]: 97: Hoare triple {70035#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:17,929 INFO L290 TraceCheckUtils]: 98: Hoare triple {70060#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:17,930 INFO L272 TraceCheckUtils]: 99: Hoare triple {70060#(<= ~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)); {70060#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:17,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {70060#(<= ~counter~0 11)} ~cond := #in~cond; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:17,930 INFO L290 TraceCheckUtils]: 101: Hoare triple {70060#(<= ~counter~0 11)} assume !(0 == ~cond); {70060#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:17,931 INFO L290 TraceCheckUtils]: 102: Hoare triple {70060#(<= ~counter~0 11)} assume true; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:17,931 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70060#(<= ~counter~0 11)} {70060#(<= ~counter~0 11)} #94#return; {70060#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:17,931 INFO L290 TraceCheckUtils]: 104: Hoare triple {70060#(<= ~counter~0 11)} assume !!(0 != ~r~0); {70060#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:17,932 INFO L290 TraceCheckUtils]: 105: Hoare triple {70060#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70085#(<= |main_#t~post7| 11)} is VALID [2022-04-08 06:05:17,932 INFO L290 TraceCheckUtils]: 106: Hoare triple {70085#(<= |main_#t~post7| 11)} assume !(#t~post7 < 50);havoc #t~post7; {69754#false} is VALID [2022-04-08 06:05:17,932 INFO L290 TraceCheckUtils]: 107: Hoare triple {69754#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69754#false} is VALID [2022-04-08 06:05:17,932 INFO L290 TraceCheckUtils]: 108: Hoare triple {69754#false} assume !(#t~post8 < 50);havoc #t~post8; {69754#false} is VALID [2022-04-08 06:05:17,932 INFO L290 TraceCheckUtils]: 109: Hoare triple {69754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69754#false} is VALID [2022-04-08 06:05:17,932 INFO L290 TraceCheckUtils]: 110: Hoare triple {69754#false} assume !(#t~post6 < 50);havoc #t~post6; {69754#false} is VALID [2022-04-08 06:05:17,932 INFO L272 TraceCheckUtils]: 111: Hoare triple {69754#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)); {69754#false} is VALID [2022-04-08 06:05:17,932 INFO L290 TraceCheckUtils]: 112: Hoare triple {69754#false} ~cond := #in~cond; {69754#false} is VALID [2022-04-08 06:05:17,933 INFO L290 TraceCheckUtils]: 113: Hoare triple {69754#false} assume 0 == ~cond; {69754#false} is VALID [2022-04-08 06:05:17,933 INFO L290 TraceCheckUtils]: 114: Hoare triple {69754#false} assume !false; {69754#false} is VALID [2022-04-08 06:05:17,933 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-08 06:05:17,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:05:18,575 INFO L290 TraceCheckUtils]: 114: Hoare triple {69754#false} assume !false; {69754#false} is VALID [2022-04-08 06:05:18,575 INFO L290 TraceCheckUtils]: 113: Hoare triple {69754#false} assume 0 == ~cond; {69754#false} is VALID [2022-04-08 06:05:18,575 INFO L290 TraceCheckUtils]: 112: Hoare triple {69754#false} ~cond := #in~cond; {69754#false} is VALID [2022-04-08 06:05:18,575 INFO L272 TraceCheckUtils]: 111: Hoare triple {69754#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)); {69754#false} is VALID [2022-04-08 06:05:18,575 INFO L290 TraceCheckUtils]: 110: Hoare triple {69754#false} assume !(#t~post6 < 50);havoc #t~post6; {69754#false} is VALID [2022-04-08 06:05:18,575 INFO L290 TraceCheckUtils]: 109: Hoare triple {69754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69754#false} is VALID [2022-04-08 06:05:18,576 INFO L290 TraceCheckUtils]: 108: Hoare triple {69754#false} assume !(#t~post8 < 50);havoc #t~post8; {69754#false} is VALID [2022-04-08 06:05:18,576 INFO L290 TraceCheckUtils]: 107: Hoare triple {69754#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69754#false} is VALID [2022-04-08 06:05:18,579 INFO L290 TraceCheckUtils]: 106: Hoare triple {70137#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {69754#false} is VALID [2022-04-08 06:05:18,580 INFO L290 TraceCheckUtils]: 105: Hoare triple {70141#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70137#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:05:18,580 INFO L290 TraceCheckUtils]: 104: Hoare triple {70141#(< ~counter~0 50)} assume !!(0 != ~r~0); {70141#(< ~counter~0 50)} is VALID [2022-04-08 06:05:18,581 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69753#true} {70141#(< ~counter~0 50)} #94#return; {70141#(< ~counter~0 50)} is VALID [2022-04-08 06:05:18,581 INFO L290 TraceCheckUtils]: 102: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,581 INFO L290 TraceCheckUtils]: 101: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,581 INFO L290 TraceCheckUtils]: 100: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,581 INFO L272 TraceCheckUtils]: 99: Hoare triple {70141#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,581 INFO L290 TraceCheckUtils]: 98: Hoare triple {70141#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {70141#(< ~counter~0 50)} is VALID [2022-04-08 06:05:18,583 INFO L290 TraceCheckUtils]: 97: Hoare triple {70166#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70141#(< ~counter~0 50)} is VALID [2022-04-08 06:05:18,584 INFO L290 TraceCheckUtils]: 96: Hoare triple {70166#(< ~counter~0 49)} assume !(~r~0 < 0); {70166#(< ~counter~0 49)} is VALID [2022-04-08 06:05:18,584 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69753#true} {70166#(< ~counter~0 49)} #98#return; {70166#(< ~counter~0 49)} is VALID [2022-04-08 06:05:18,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,584 INFO L290 TraceCheckUtils]: 93: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,584 INFO L290 TraceCheckUtils]: 92: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,584 INFO L272 TraceCheckUtils]: 91: Hoare triple {70166#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {70166#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {70166#(< ~counter~0 49)} is VALID [2022-04-08 06:05:18,585 INFO L290 TraceCheckUtils]: 89: Hoare triple {70191#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70166#(< ~counter~0 49)} is VALID [2022-04-08 06:05:18,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {70191#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70191#(< ~counter~0 48)} is VALID [2022-04-08 06:05:18,586 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69753#true} {70191#(< ~counter~0 48)} #98#return; {70191#(< ~counter~0 48)} is VALID [2022-04-08 06:05:18,586 INFO L290 TraceCheckUtils]: 86: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,586 INFO L290 TraceCheckUtils]: 85: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,586 INFO L290 TraceCheckUtils]: 84: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,586 INFO L272 TraceCheckUtils]: 83: Hoare triple {70191#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {70191#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {70191#(< ~counter~0 48)} is VALID [2022-04-08 06:05:18,588 INFO L290 TraceCheckUtils]: 81: Hoare triple {70216#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70191#(< ~counter~0 48)} is VALID [2022-04-08 06:05:18,588 INFO L290 TraceCheckUtils]: 80: Hoare triple {70216#(< ~counter~0 47)} assume !(~r~0 > 0); {70216#(< ~counter~0 47)} is VALID [2022-04-08 06:05:18,588 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69753#true} {70216#(< ~counter~0 47)} #96#return; {70216#(< ~counter~0 47)} is VALID [2022-04-08 06:05:18,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,589 INFO L290 TraceCheckUtils]: 76: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,589 INFO L272 TraceCheckUtils]: 75: Hoare triple {70216#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,589 INFO L290 TraceCheckUtils]: 74: Hoare triple {70216#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {70216#(< ~counter~0 47)} is VALID [2022-04-08 06:05:18,590 INFO L290 TraceCheckUtils]: 73: Hoare triple {70241#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70216#(< ~counter~0 47)} is VALID [2022-04-08 06:05:18,590 INFO L290 TraceCheckUtils]: 72: Hoare triple {70241#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70241#(< ~counter~0 46)} is VALID [2022-04-08 06:05:18,590 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69753#true} {70241#(< ~counter~0 46)} #96#return; {70241#(< ~counter~0 46)} is VALID [2022-04-08 06:05:18,590 INFO L290 TraceCheckUtils]: 70: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,591 INFO L290 TraceCheckUtils]: 69: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,591 INFO L290 TraceCheckUtils]: 68: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,591 INFO L272 TraceCheckUtils]: 67: Hoare triple {70241#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {70241#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {70241#(< ~counter~0 46)} is VALID [2022-04-08 06:05:18,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {70266#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70241#(< ~counter~0 46)} is VALID [2022-04-08 06:05:18,592 INFO L290 TraceCheckUtils]: 64: Hoare triple {70266#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70266#(< ~counter~0 45)} is VALID [2022-04-08 06:05:18,592 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69753#true} {70266#(< ~counter~0 45)} #96#return; {70266#(< ~counter~0 45)} is VALID [2022-04-08 06:05:18,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,593 INFO L272 TraceCheckUtils]: 59: Hoare triple {70266#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {70266#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {70266#(< ~counter~0 45)} is VALID [2022-04-08 06:05:18,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {70291#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70266#(< ~counter~0 45)} is VALID [2022-04-08 06:05:18,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {70291#(< ~counter~0 44)} assume !!(0 != ~r~0); {70291#(< ~counter~0 44)} is VALID [2022-04-08 06:05:18,595 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69753#true} {70291#(< ~counter~0 44)} #94#return; {70291#(< ~counter~0 44)} is VALID [2022-04-08 06:05:18,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,595 INFO L272 TraceCheckUtils]: 51: Hoare triple {70291#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {70291#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {70291#(< ~counter~0 44)} is VALID [2022-04-08 06:05:18,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {70316#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70291#(< ~counter~0 44)} is VALID [2022-04-08 06:05:18,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {70316#(< ~counter~0 43)} assume !(~r~0 < 0); {70316#(< ~counter~0 43)} is VALID [2022-04-08 06:05:18,597 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69753#true} {70316#(< ~counter~0 43)} #98#return; {70316#(< ~counter~0 43)} is VALID [2022-04-08 06:05:18,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,597 INFO L272 TraceCheckUtils]: 43: Hoare triple {70316#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {70316#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {70316#(< ~counter~0 43)} is VALID [2022-04-08 06:05:18,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {70341#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70316#(< ~counter~0 43)} is VALID [2022-04-08 06:05:18,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {70341#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70341#(< ~counter~0 42)} is VALID [2022-04-08 06:05:18,599 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69753#true} {70341#(< ~counter~0 42)} #98#return; {70341#(< ~counter~0 42)} is VALID [2022-04-08 06:05:18,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,599 INFO L272 TraceCheckUtils]: 35: Hoare triple {70341#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {70341#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {70341#(< ~counter~0 42)} is VALID [2022-04-08 06:05:18,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {70366#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70341#(< ~counter~0 42)} is VALID [2022-04-08 06:05:18,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {70366#(< ~counter~0 41)} assume !(~r~0 > 0); {70366#(< ~counter~0 41)} is VALID [2022-04-08 06:05:18,601 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69753#true} {70366#(< ~counter~0 41)} #96#return; {70366#(< ~counter~0 41)} is VALID [2022-04-08 06:05:18,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,601 INFO L272 TraceCheckUtils]: 27: Hoare triple {70366#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {70366#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {70366#(< ~counter~0 41)} is VALID [2022-04-08 06:05:18,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {70391#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70366#(< ~counter~0 41)} is VALID [2022-04-08 06:05:18,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {70391#(< ~counter~0 40)} assume !!(0 != ~r~0); {70391#(< ~counter~0 40)} is VALID [2022-04-08 06:05:18,603 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69753#true} {70391#(< ~counter~0 40)} #94#return; {70391#(< ~counter~0 40)} is VALID [2022-04-08 06:05:18,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,603 INFO L272 TraceCheckUtils]: 19: Hoare triple {70391#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {70391#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {70391#(< ~counter~0 40)} is VALID [2022-04-08 06:05:18,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {70416#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70391#(< ~counter~0 40)} is VALID [2022-04-08 06:05:18,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {70416#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70416#(< ~counter~0 39)} is VALID [2022-04-08 06:05:18,605 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69753#true} {70416#(< ~counter~0 39)} #92#return; {70416#(< ~counter~0 39)} is VALID [2022-04-08 06:05:18,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,605 INFO L272 TraceCheckUtils]: 11: Hoare triple {70416#(< ~counter~0 39)} 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)); {69753#true} is VALID [2022-04-08 06:05:18,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69753#true} {70416#(< ~counter~0 39)} #90#return; {70416#(< ~counter~0 39)} is VALID [2022-04-08 06:05:18,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-08 06:05:18,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-08 06:05:18,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-08 06:05:18,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {70416#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69753#true} is VALID [2022-04-08 06:05:18,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {70416#(< ~counter~0 39)} 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; {70416#(< ~counter~0 39)} is VALID [2022-04-08 06:05:18,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {70416#(< ~counter~0 39)} call #t~ret9 := main(); {70416#(< ~counter~0 39)} is VALID [2022-04-08 06:05:18,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70416#(< ~counter~0 39)} {69753#true} #102#return; {70416#(< ~counter~0 39)} is VALID [2022-04-08 06:05:18,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {70416#(< ~counter~0 39)} assume true; {70416#(< ~counter~0 39)} is VALID [2022-04-08 06:05:18,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {69753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {70416#(< ~counter~0 39)} is VALID [2022-04-08 06:05:18,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {69753#true} call ULTIMATE.init(); {69753#true} is VALID [2022-04-08 06:05:18,608 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-08 06:05:18,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:05:18,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602351761] [2022-04-08 06:05:18,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:05:18,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395156344] [2022-04-08 06:05:18,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395156344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:05:18,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:05:18,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 06:05:18,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:05:18,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638086221] [2022-04-08 06:05:18,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638086221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:05:18,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:05:18,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:05:18,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874084724] [2022-04-08 06:05:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:05:18,609 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-08 06:05:18,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:05:18,610 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-08 06:05:18,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:18,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:05:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:18,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:05:18,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 06:05:18,706 INFO L87 Difference]: Start difference. First operand 578 states and 790 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-08 06:05:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:21,323 INFO L93 Difference]: Finished difference Result 791 states and 1114 transitions. [2022-04-08 06:05:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 06:05:21,323 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-08 06:05:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:21,324 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-08 06:05:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-08 06:05:21,326 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-08 06:05:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-08 06:05:21,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-08 06:05:21,549 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-08 06:05:21,566 INFO L225 Difference]: With dead ends: 791 [2022-04-08 06:05:21,567 INFO L226 Difference]: Without dead ends: 594 [2022-04-08 06:05:21,568 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-08 06:05:21,568 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 124 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:21,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 313 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:05:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-04-08 06:05:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-04-08 06:05:23,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:23,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:23,311 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:23,311 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:23,324 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-08 06:05:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 06:05:23,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:23,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:23,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-08 06:05:23,326 INFO L87 Difference]: Start difference. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-08 06:05:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:23,341 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-08 06:05:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 06:05:23,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:23,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:23,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:23,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:05:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 806 transitions. [2022-04-08 06:05:23,367 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 806 transitions. Word has length 115 [2022-04-08 06:05:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:23,367 INFO L478 AbstractCegarLoop]: Abstraction has 594 states and 806 transitions. [2022-04-08 06:05:23,368 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-08 06:05:23,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 594 states and 806 transitions. [2022-04-08 06:05:26,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 806 edges. 806 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 06:05:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 06:05:26,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:26,354 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-08 06:05:26,359 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-08 06:05:26,555 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-08 06:05:26,555 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-08 06:05:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:26,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259169523] [2022-04-08 06:05:26,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-08 06:05:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:26,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857171413] [2022-04-08 06:05:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:26,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:26,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815725888] [2022-04-08 06:05:26,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:05:26,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:26,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:26,569 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-08 06:05:26,570 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-08 06:05:26,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:05:26,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:26,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 06:05:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:26,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:27,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {74448#true} call ULTIMATE.init(); {74448#true} is VALID [2022-04-08 06:05:27,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {74448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74456#(<= ~counter~0 0)} {74448#true} #102#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {74456#(<= ~counter~0 0)} call #t~ret9 := main(); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {74456#(<= ~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; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {74456#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {74456#(<= ~counter~0 0)} ~cond := #in~cond; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {74456#(<= ~counter~0 0)} assume !(0 == ~cond); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,284 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74456#(<= ~counter~0 0)} {74456#(<= ~counter~0 0)} #90#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,284 INFO L272 TraceCheckUtils]: 11: Hoare triple {74456#(<= ~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)); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {74456#(<= ~counter~0 0)} ~cond := #in~cond; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {74456#(<= ~counter~0 0)} assume !(0 == ~cond); {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,285 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74456#(<= ~counter~0 0)} {74456#(<= ~counter~0 0)} #92#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {74456#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74456#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:27,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {74456#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:27,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {74505#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:27,288 INFO L272 TraceCheckUtils]: 19: Hoare triple {74505#(<= ~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)); {74505#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:27,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {74505#(<= ~counter~0 1)} ~cond := #in~cond; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:27,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {74505#(<= ~counter~0 1)} assume !(0 == ~cond); {74505#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:27,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {74505#(<= ~counter~0 1)} assume true; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:27,289 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74505#(<= ~counter~0 1)} {74505#(<= ~counter~0 1)} #94#return; {74505#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:27,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {74505#(<= ~counter~0 1)} assume !!(0 != ~r~0); {74505#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:27,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {74505#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:27,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {74530#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:27,291 INFO L272 TraceCheckUtils]: 27: Hoare triple {74530#(<= ~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)); {74530#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:27,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {74530#(<= ~counter~0 2)} ~cond := #in~cond; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:27,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {74530#(<= ~counter~0 2)} assume !(0 == ~cond); {74530#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:27,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {74530#(<= ~counter~0 2)} assume true; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:27,292 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74530#(<= ~counter~0 2)} {74530#(<= ~counter~0 2)} #96#return; {74530#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:27,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {74530#(<= ~counter~0 2)} assume !(~r~0 > 0); {74530#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:27,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {74530#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:27,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {74555#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:27,294 INFO L272 TraceCheckUtils]: 35: Hoare triple {74555#(<= ~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)); {74555#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:27,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {74555#(<= ~counter~0 3)} ~cond := #in~cond; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:27,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {74555#(<= ~counter~0 3)} assume !(0 == ~cond); {74555#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:27,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {74555#(<= ~counter~0 3)} assume true; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:27,296 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74555#(<= ~counter~0 3)} {74555#(<= ~counter~0 3)} #98#return; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:27,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {74555#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74555#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:27,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {74555#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:27,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {74580#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:27,297 INFO L272 TraceCheckUtils]: 43: Hoare triple {74580#(<= ~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)); {74580#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:27,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {74580#(<= ~counter~0 4)} ~cond := #in~cond; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:27,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {74580#(<= ~counter~0 4)} assume !(0 == ~cond); {74580#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:27,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {74580#(<= ~counter~0 4)} assume true; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:27,299 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74580#(<= ~counter~0 4)} {74580#(<= ~counter~0 4)} #98#return; {74580#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:27,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {74580#(<= ~counter~0 4)} assume !(~r~0 < 0); {74580#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:27,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {74580#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:27,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {74605#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:27,301 INFO L272 TraceCheckUtils]: 51: Hoare triple {74605#(<= ~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)); {74605#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:27,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {74605#(<= ~counter~0 5)} ~cond := #in~cond; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:27,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {74605#(<= ~counter~0 5)} assume !(0 == ~cond); {74605#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:27,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {74605#(<= ~counter~0 5)} assume true; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:27,302 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74605#(<= ~counter~0 5)} {74605#(<= ~counter~0 5)} #94#return; {74605#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:27,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {74605#(<= ~counter~0 5)} assume !!(0 != ~r~0); {74605#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:27,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {74605#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:27,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {74630#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:27,304 INFO L272 TraceCheckUtils]: 59: Hoare triple {74630#(<= ~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)); {74630#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:27,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {74630#(<= ~counter~0 6)} ~cond := #in~cond; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:27,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {74630#(<= ~counter~0 6)} assume !(0 == ~cond); {74630#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:27,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {74630#(<= ~counter~0 6)} assume true; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:27,305 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74630#(<= ~counter~0 6)} {74630#(<= ~counter~0 6)} #96#return; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:27,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {74630#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74630#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:27,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {74630#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:27,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {74655#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:27,311 INFO L272 TraceCheckUtils]: 67: Hoare triple {74655#(<= ~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)); {74655#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:27,312 INFO L290 TraceCheckUtils]: 68: Hoare triple {74655#(<= ~counter~0 7)} ~cond := #in~cond; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:27,312 INFO L290 TraceCheckUtils]: 69: Hoare triple {74655#(<= ~counter~0 7)} assume !(0 == ~cond); {74655#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:27,312 INFO L290 TraceCheckUtils]: 70: Hoare triple {74655#(<= ~counter~0 7)} assume true; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:27,313 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74655#(<= ~counter~0 7)} {74655#(<= ~counter~0 7)} #96#return; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:27,313 INFO L290 TraceCheckUtils]: 72: Hoare triple {74655#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74655#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:27,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {74655#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:27,315 INFO L290 TraceCheckUtils]: 74: Hoare triple {74680#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:27,315 INFO L272 TraceCheckUtils]: 75: Hoare triple {74680#(<= ~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)); {74680#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:27,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {74680#(<= ~counter~0 8)} ~cond := #in~cond; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:27,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {74680#(<= ~counter~0 8)} assume !(0 == ~cond); {74680#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:27,316 INFO L290 TraceCheckUtils]: 78: Hoare triple {74680#(<= ~counter~0 8)} assume true; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:27,317 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74680#(<= ~counter~0 8)} {74680#(<= ~counter~0 8)} #96#return; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:27,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {74680#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74680#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:27,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {74680#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:27,319 INFO L290 TraceCheckUtils]: 82: Hoare triple {74705#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:27,319 INFO L272 TraceCheckUtils]: 83: Hoare triple {74705#(<= ~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)); {74705#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:27,320 INFO L290 TraceCheckUtils]: 84: Hoare triple {74705#(<= ~counter~0 9)} ~cond := #in~cond; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:27,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {74705#(<= ~counter~0 9)} assume !(0 == ~cond); {74705#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:27,320 INFO L290 TraceCheckUtils]: 86: Hoare triple {74705#(<= ~counter~0 9)} assume true; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:27,321 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74705#(<= ~counter~0 9)} {74705#(<= ~counter~0 9)} #96#return; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:27,321 INFO L290 TraceCheckUtils]: 88: Hoare triple {74705#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74705#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:27,322 INFO L290 TraceCheckUtils]: 89: Hoare triple {74705#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:27,323 INFO L290 TraceCheckUtils]: 90: Hoare triple {74730#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:27,323 INFO L272 TraceCheckUtils]: 91: Hoare triple {74730#(<= ~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)); {74730#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:27,324 INFO L290 TraceCheckUtils]: 92: Hoare triple {74730#(<= ~counter~0 10)} ~cond := #in~cond; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:27,324 INFO L290 TraceCheckUtils]: 93: Hoare triple {74730#(<= ~counter~0 10)} assume !(0 == ~cond); {74730#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:27,324 INFO L290 TraceCheckUtils]: 94: Hoare triple {74730#(<= ~counter~0 10)} assume true; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:27,325 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74730#(<= ~counter~0 10)} {74730#(<= ~counter~0 10)} #96#return; {74730#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:27,326 INFO L290 TraceCheckUtils]: 96: Hoare triple {74730#(<= ~counter~0 10)} assume !(~r~0 > 0); {74730#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:27,327 INFO L290 TraceCheckUtils]: 97: Hoare triple {74730#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:27,327 INFO L290 TraceCheckUtils]: 98: Hoare triple {74755#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:27,327 INFO L272 TraceCheckUtils]: 99: Hoare triple {74755#(<= ~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)); {74755#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:27,328 INFO L290 TraceCheckUtils]: 100: Hoare triple {74755#(<= ~counter~0 11)} ~cond := #in~cond; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:27,328 INFO L290 TraceCheckUtils]: 101: Hoare triple {74755#(<= ~counter~0 11)} assume !(0 == ~cond); {74755#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:27,328 INFO L290 TraceCheckUtils]: 102: Hoare triple {74755#(<= ~counter~0 11)} assume true; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:27,329 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74755#(<= ~counter~0 11)} {74755#(<= ~counter~0 11)} #98#return; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:27,329 INFO L290 TraceCheckUtils]: 104: Hoare triple {74755#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74755#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:27,330 INFO L290 TraceCheckUtils]: 105: Hoare triple {74755#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:27,330 INFO L290 TraceCheckUtils]: 106: Hoare triple {74780#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:27,331 INFO L272 TraceCheckUtils]: 107: Hoare triple {74780#(<= ~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)); {74780#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:27,331 INFO L290 TraceCheckUtils]: 108: Hoare triple {74780#(<= ~counter~0 12)} ~cond := #in~cond; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:27,331 INFO L290 TraceCheckUtils]: 109: Hoare triple {74780#(<= ~counter~0 12)} assume !(0 == ~cond); {74780#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:27,332 INFO L290 TraceCheckUtils]: 110: Hoare triple {74780#(<= ~counter~0 12)} assume true; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:27,332 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74780#(<= ~counter~0 12)} {74780#(<= ~counter~0 12)} #98#return; {74780#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:27,333 INFO L290 TraceCheckUtils]: 112: Hoare triple {74780#(<= ~counter~0 12)} assume !(~r~0 < 0); {74780#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:27,333 INFO L290 TraceCheckUtils]: 113: Hoare triple {74780#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74805#(<= |main_#t~post6| 12)} is VALID [2022-04-08 06:05:27,333 INFO L290 TraceCheckUtils]: 114: Hoare triple {74805#(<= |main_#t~post6| 12)} assume !(#t~post6 < 50);havoc #t~post6; {74449#false} is VALID [2022-04-08 06:05:27,334 INFO L272 TraceCheckUtils]: 115: Hoare triple {74449#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)); {74449#false} is VALID [2022-04-08 06:05:27,334 INFO L290 TraceCheckUtils]: 116: Hoare triple {74449#false} ~cond := #in~cond; {74449#false} is VALID [2022-04-08 06:05:27,334 INFO L290 TraceCheckUtils]: 117: Hoare triple {74449#false} assume 0 == ~cond; {74449#false} is VALID [2022-04-08 06:05:27,334 INFO L290 TraceCheckUtils]: 118: Hoare triple {74449#false} assume !false; {74449#false} is VALID [2022-04-08 06:05:27,334 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-08 06:05:27,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:05:28,101 INFO L290 TraceCheckUtils]: 118: Hoare triple {74449#false} assume !false; {74449#false} is VALID [2022-04-08 06:05:28,101 INFO L290 TraceCheckUtils]: 117: Hoare triple {74449#false} assume 0 == ~cond; {74449#false} is VALID [2022-04-08 06:05:28,101 INFO L290 TraceCheckUtils]: 116: Hoare triple {74449#false} ~cond := #in~cond; {74449#false} is VALID [2022-04-08 06:05:28,102 INFO L272 TraceCheckUtils]: 115: Hoare triple {74449#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)); {74449#false} is VALID [2022-04-08 06:05:28,107 INFO L290 TraceCheckUtils]: 114: Hoare triple {74833#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {74449#false} is VALID [2022-04-08 06:05:28,108 INFO L290 TraceCheckUtils]: 113: Hoare triple {74837#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74833#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:05:28,108 INFO L290 TraceCheckUtils]: 112: Hoare triple {74837#(< ~counter~0 50)} assume !(~r~0 < 0); {74837#(< ~counter~0 50)} is VALID [2022-04-08 06:05:28,109 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74448#true} {74837#(< ~counter~0 50)} #98#return; {74837#(< ~counter~0 50)} is VALID [2022-04-08 06:05:28,109 INFO L290 TraceCheckUtils]: 110: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,109 INFO L290 TraceCheckUtils]: 109: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,109 INFO L290 TraceCheckUtils]: 108: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,109 INFO L272 TraceCheckUtils]: 107: Hoare triple {74837#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,109 INFO L290 TraceCheckUtils]: 106: Hoare triple {74837#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {74837#(< ~counter~0 50)} is VALID [2022-04-08 06:05:28,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {74862#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74837#(< ~counter~0 50)} is VALID [2022-04-08 06:05:28,112 INFO L290 TraceCheckUtils]: 104: Hoare triple {74862#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74862#(< ~counter~0 49)} is VALID [2022-04-08 06:05:28,112 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74448#true} {74862#(< ~counter~0 49)} #98#return; {74862#(< ~counter~0 49)} is VALID [2022-04-08 06:05:28,113 INFO L290 TraceCheckUtils]: 102: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,113 INFO L290 TraceCheckUtils]: 101: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,113 INFO L290 TraceCheckUtils]: 100: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,113 INFO L272 TraceCheckUtils]: 99: Hoare triple {74862#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,113 INFO L290 TraceCheckUtils]: 98: Hoare triple {74862#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {74862#(< ~counter~0 49)} is VALID [2022-04-08 06:05:28,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {74887#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74862#(< ~counter~0 49)} is VALID [2022-04-08 06:05:28,115 INFO L290 TraceCheckUtils]: 96: Hoare triple {74887#(< ~counter~0 48)} assume !(~r~0 > 0); {74887#(< ~counter~0 48)} is VALID [2022-04-08 06:05:28,115 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74448#true} {74887#(< ~counter~0 48)} #96#return; {74887#(< ~counter~0 48)} is VALID [2022-04-08 06:05:28,115 INFO L290 TraceCheckUtils]: 94: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,115 INFO L290 TraceCheckUtils]: 93: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,115 INFO L290 TraceCheckUtils]: 92: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,116 INFO L272 TraceCheckUtils]: 91: Hoare triple {74887#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,116 INFO L290 TraceCheckUtils]: 90: Hoare triple {74887#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {74887#(< ~counter~0 48)} is VALID [2022-04-08 06:05:28,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {74912#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74887#(< ~counter~0 48)} is VALID [2022-04-08 06:05:28,117 INFO L290 TraceCheckUtils]: 88: Hoare triple {74912#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74912#(< ~counter~0 47)} is VALID [2022-04-08 06:05:28,118 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74448#true} {74912#(< ~counter~0 47)} #96#return; {74912#(< ~counter~0 47)} is VALID [2022-04-08 06:05:28,118 INFO L290 TraceCheckUtils]: 86: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,118 INFO L290 TraceCheckUtils]: 85: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,118 INFO L272 TraceCheckUtils]: 83: Hoare triple {74912#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,119 INFO L290 TraceCheckUtils]: 82: Hoare triple {74912#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {74912#(< ~counter~0 47)} is VALID [2022-04-08 06:05:28,120 INFO L290 TraceCheckUtils]: 81: Hoare triple {74937#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74912#(< ~counter~0 47)} is VALID [2022-04-08 06:05:28,120 INFO L290 TraceCheckUtils]: 80: Hoare triple {74937#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74937#(< ~counter~0 46)} is VALID [2022-04-08 06:05:28,121 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74448#true} {74937#(< ~counter~0 46)} #96#return; {74937#(< ~counter~0 46)} is VALID [2022-04-08 06:05:28,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,121 INFO L272 TraceCheckUtils]: 75: Hoare triple {74937#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {74937#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {74937#(< ~counter~0 46)} is VALID [2022-04-08 06:05:28,122 INFO L290 TraceCheckUtils]: 73: Hoare triple {74962#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74937#(< ~counter~0 46)} is VALID [2022-04-08 06:05:28,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {74962#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74962#(< ~counter~0 45)} is VALID [2022-04-08 06:05:28,124 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74448#true} {74962#(< ~counter~0 45)} #96#return; {74962#(< ~counter~0 45)} is VALID [2022-04-08 06:05:28,124 INFO L290 TraceCheckUtils]: 70: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,124 INFO L290 TraceCheckUtils]: 69: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,124 INFO L290 TraceCheckUtils]: 68: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,124 INFO L272 TraceCheckUtils]: 67: Hoare triple {74962#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,124 INFO L290 TraceCheckUtils]: 66: Hoare triple {74962#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {74962#(< ~counter~0 45)} is VALID [2022-04-08 06:05:28,125 INFO L290 TraceCheckUtils]: 65: Hoare triple {74987#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74962#(< ~counter~0 45)} is VALID [2022-04-08 06:05:28,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {74987#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74987#(< ~counter~0 44)} is VALID [2022-04-08 06:05:28,126 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74448#true} {74987#(< ~counter~0 44)} #96#return; {74987#(< ~counter~0 44)} is VALID [2022-04-08 06:05:28,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,127 INFO L290 TraceCheckUtils]: 60: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,127 INFO L272 TraceCheckUtils]: 59: Hoare triple {74987#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {74987#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {74987#(< ~counter~0 44)} is VALID [2022-04-08 06:05:28,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {75012#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74987#(< ~counter~0 44)} is VALID [2022-04-08 06:05:28,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {75012#(< ~counter~0 43)} assume !!(0 != ~r~0); {75012#(< ~counter~0 43)} is VALID [2022-04-08 06:05:28,129 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74448#true} {75012#(< ~counter~0 43)} #94#return; {75012#(< ~counter~0 43)} is VALID [2022-04-08 06:05:28,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,130 INFO L272 TraceCheckUtils]: 51: Hoare triple {75012#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {75012#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {75012#(< ~counter~0 43)} is VALID [2022-04-08 06:05:28,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {75037#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75012#(< ~counter~0 43)} is VALID [2022-04-08 06:05:28,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {75037#(< ~counter~0 42)} assume !(~r~0 < 0); {75037#(< ~counter~0 42)} is VALID [2022-04-08 06:05:28,132 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74448#true} {75037#(< ~counter~0 42)} #98#return; {75037#(< ~counter~0 42)} is VALID [2022-04-08 06:05:28,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,133 INFO L272 TraceCheckUtils]: 43: Hoare triple {75037#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {75037#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {75037#(< ~counter~0 42)} is VALID [2022-04-08 06:05:28,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {75062#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75037#(< ~counter~0 42)} is VALID [2022-04-08 06:05:28,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {75062#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75062#(< ~counter~0 41)} is VALID [2022-04-08 06:05:28,135 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74448#true} {75062#(< ~counter~0 41)} #98#return; {75062#(< ~counter~0 41)} is VALID [2022-04-08 06:05:28,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,136 INFO L272 TraceCheckUtils]: 35: Hoare triple {75062#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {75062#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {75062#(< ~counter~0 41)} is VALID [2022-04-08 06:05:28,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {75087#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75062#(< ~counter~0 41)} is VALID [2022-04-08 06:05:28,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {75087#(< ~counter~0 40)} assume !(~r~0 > 0); {75087#(< ~counter~0 40)} is VALID [2022-04-08 06:05:28,138 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74448#true} {75087#(< ~counter~0 40)} #96#return; {75087#(< ~counter~0 40)} is VALID [2022-04-08 06:05:28,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,138 INFO L272 TraceCheckUtils]: 27: Hoare triple {75087#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {75087#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {75087#(< ~counter~0 40)} is VALID [2022-04-08 06:05:28,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {75112#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75087#(< ~counter~0 40)} is VALID [2022-04-08 06:05:28,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {75112#(< ~counter~0 39)} assume !!(0 != ~r~0); {75112#(< ~counter~0 39)} is VALID [2022-04-08 06:05:28,141 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74448#true} {75112#(< ~counter~0 39)} #94#return; {75112#(< ~counter~0 39)} is VALID [2022-04-08 06:05:28,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,141 INFO L272 TraceCheckUtils]: 19: Hoare triple {75112#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {75112#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {75112#(< ~counter~0 39)} is VALID [2022-04-08 06:05:28,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {75137#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75112#(< ~counter~0 39)} is VALID [2022-04-08 06:05:28,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {75137#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {75137#(< ~counter~0 38)} is VALID [2022-04-08 06:05:28,144 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74448#true} {75137#(< ~counter~0 38)} #92#return; {75137#(< ~counter~0 38)} is VALID [2022-04-08 06:05:28,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,144 INFO L272 TraceCheckUtils]: 11: Hoare triple {75137#(< ~counter~0 38)} 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)); {74448#true} is VALID [2022-04-08 06:05:28,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74448#true} {75137#(< ~counter~0 38)} #90#return; {75137#(< ~counter~0 38)} is VALID [2022-04-08 06:05:28,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-08 06:05:28,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-08 06:05:28,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-08 06:05:28,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {75137#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74448#true} is VALID [2022-04-08 06:05:28,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {75137#(< ~counter~0 38)} 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; {75137#(< ~counter~0 38)} is VALID [2022-04-08 06:05:28,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {75137#(< ~counter~0 38)} call #t~ret9 := main(); {75137#(< ~counter~0 38)} is VALID [2022-04-08 06:05:28,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75137#(< ~counter~0 38)} {74448#true} #102#return; {75137#(< ~counter~0 38)} is VALID [2022-04-08 06:05:28,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {75137#(< ~counter~0 38)} assume true; {75137#(< ~counter~0 38)} is VALID [2022-04-08 06:05:28,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {74448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {75137#(< ~counter~0 38)} is VALID [2022-04-08 06:05:28,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {74448#true} call ULTIMATE.init(); {74448#true} is VALID [2022-04-08 06:05:28,148 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-08 06:05:28,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:05:28,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857171413] [2022-04-08 06:05:28,148 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:05:28,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815725888] [2022-04-08 06:05:28,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815725888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:05:28,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:05:28,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 06:05:28,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:05:28,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259169523] [2022-04-08 06:05:28,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259169523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:05:28,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:05:28,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 06:05:28,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242113491] [2022-04-08 06:05:28,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:05:28,150 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-08 06:05:28,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:05:28,151 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-08 06:05:28,268 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-08 06:05:28,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 06:05:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 06:05:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 06:05:28,269 INFO L87 Difference]: Start difference. First operand 594 states and 806 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-08 06:05:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:31,242 INFO L93 Difference]: Finished difference Result 649 states and 883 transitions. [2022-04-08 06:05:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 06:05:31,242 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-08 06:05:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:31,242 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-08 06:05:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-08 06:05:31,244 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-08 06:05:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-08 06:05:31,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-08 06:05:31,490 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-08 06:05:31,507 INFO L225 Difference]: With dead ends: 649 [2022-04-08 06:05:31,507 INFO L226 Difference]: Without dead ends: 638 [2022-04-08 06:05:31,507 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-08 06:05:31,508 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 163 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:31,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 295 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:05:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-04-08 06:05:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 616. [2022-04-08 06:05:33,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:33,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:33,314 INFO L74 IsIncluded]: Start isIncluded. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:33,315 INFO L87 Difference]: Start difference. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:33,330 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-08 06:05:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-08 06:05:33,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:33,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:33,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-08 06:05:33,332 INFO L87 Difference]: Start difference. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-08 06:05:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:33,353 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-08 06:05:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-08 06:05:33,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:33,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:33,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:33,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 841 transitions. [2022-04-08 06:05:33,373 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 841 transitions. Word has length 119 [2022-04-08 06:05:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:33,374 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 841 transitions. [2022-04-08 06:05:33,374 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-08 06:05:33,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 616 states and 841 transitions. [2022-04-08 06:05:37,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 841 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 841 transitions. [2022-04-08 06:05:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 06:05:37,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:37,421 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-08 06:05:37,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-08 06:05:37,622 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-08 06:05:37,622 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:37,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-08 06:05:37,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:37,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [392596970] [2022-04-08 06:05:37,623 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-08 06:05:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:37,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646998637] [2022-04-08 06:05:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:37,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:37,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292763975] [2022-04-08 06:05:37,635 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:05:37,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:37,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:37,636 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-08 06:05:37,636 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-08 06:05:38,186 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 06:05:38,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:38,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 06:05:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:38,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:38,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {79015#true} call ULTIMATE.init(); {79015#true} is VALID [2022-04-08 06:05:38,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {79015#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79023#(<= ~counter~0 0)} {79015#true} #102#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {79023#(<= ~counter~0 0)} call #t~ret9 := main(); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {79023#(<= ~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; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {79023#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {79023#(<= ~counter~0 0)} ~cond := #in~cond; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {79023#(<= ~counter~0 0)} assume !(0 == ~cond); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79023#(<= ~counter~0 0)} {79023#(<= ~counter~0 0)} #90#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,833 INFO L272 TraceCheckUtils]: 11: Hoare triple {79023#(<= ~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)); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {79023#(<= ~counter~0 0)} ~cond := #in~cond; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {79023#(<= ~counter~0 0)} assume !(0 == ~cond); {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,834 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79023#(<= ~counter~0 0)} {79023#(<= ~counter~0 0)} #92#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {79023#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79023#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:38,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {79023#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:38,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {79072#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:38,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {79072#(<= ~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)); {79072#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:38,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {79072#(<= ~counter~0 1)} ~cond := #in~cond; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:38,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {79072#(<= ~counter~0 1)} assume !(0 == ~cond); {79072#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:38,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {79072#(<= ~counter~0 1)} assume true; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:38,838 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79072#(<= ~counter~0 1)} {79072#(<= ~counter~0 1)} #94#return; {79072#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:38,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {79072#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79072#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:38,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {79072#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:38,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {79097#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:38,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {79097#(<= ~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)); {79097#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:38,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {79097#(<= ~counter~0 2)} ~cond := #in~cond; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:38,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {79097#(<= ~counter~0 2)} assume !(0 == ~cond); {79097#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:38,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {79097#(<= ~counter~0 2)} assume true; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:38,841 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79097#(<= ~counter~0 2)} {79097#(<= ~counter~0 2)} #96#return; {79097#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:38,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {79097#(<= ~counter~0 2)} assume !(~r~0 > 0); {79097#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:38,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {79097#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:38,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {79122#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:38,843 INFO L272 TraceCheckUtils]: 35: Hoare triple {79122#(<= ~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)); {79122#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:38,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {79122#(<= ~counter~0 3)} ~cond := #in~cond; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:38,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {79122#(<= ~counter~0 3)} assume !(0 == ~cond); {79122#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:38,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {79122#(<= ~counter~0 3)} assume true; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:38,845 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79122#(<= ~counter~0 3)} {79122#(<= ~counter~0 3)} #98#return; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:38,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {79122#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79122#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:38,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {79122#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:38,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {79147#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:38,846 INFO L272 TraceCheckUtils]: 43: Hoare triple {79147#(<= ~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)); {79147#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:38,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {79147#(<= ~counter~0 4)} ~cond := #in~cond; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:38,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {79147#(<= ~counter~0 4)} assume !(0 == ~cond); {79147#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:38,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {79147#(<= ~counter~0 4)} assume true; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:38,848 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79147#(<= ~counter~0 4)} {79147#(<= ~counter~0 4)} #98#return; {79147#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:38,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {79147#(<= ~counter~0 4)} assume !(~r~0 < 0); {79147#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:38,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {79147#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:38,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {79172#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:38,850 INFO L272 TraceCheckUtils]: 51: Hoare triple {79172#(<= ~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)); {79172#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:38,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {79172#(<= ~counter~0 5)} ~cond := #in~cond; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:38,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {79172#(<= ~counter~0 5)} assume !(0 == ~cond); {79172#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:38,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {79172#(<= ~counter~0 5)} assume true; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:38,851 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79172#(<= ~counter~0 5)} {79172#(<= ~counter~0 5)} #94#return; {79172#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:38,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {79172#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79172#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:38,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {79172#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:38,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {79197#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:38,853 INFO L272 TraceCheckUtils]: 59: Hoare triple {79197#(<= ~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)); {79197#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:38,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {79197#(<= ~counter~0 6)} ~cond := #in~cond; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:38,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {79197#(<= ~counter~0 6)} assume !(0 == ~cond); {79197#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:38,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {79197#(<= ~counter~0 6)} assume true; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:38,854 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79197#(<= ~counter~0 6)} {79197#(<= ~counter~0 6)} #96#return; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:38,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {79197#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79197#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:38,855 INFO L290 TraceCheckUtils]: 65: Hoare triple {79197#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:38,855 INFO L290 TraceCheckUtils]: 66: Hoare triple {79222#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:38,856 INFO L272 TraceCheckUtils]: 67: Hoare triple {79222#(<= ~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)); {79222#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:38,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {79222#(<= ~counter~0 7)} ~cond := #in~cond; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:38,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {79222#(<= ~counter~0 7)} assume !(0 == ~cond); {79222#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:38,856 INFO L290 TraceCheckUtils]: 70: Hoare triple {79222#(<= ~counter~0 7)} assume true; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:38,857 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79222#(<= ~counter~0 7)} {79222#(<= ~counter~0 7)} #96#return; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:38,857 INFO L290 TraceCheckUtils]: 72: Hoare triple {79222#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79222#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:38,858 INFO L290 TraceCheckUtils]: 73: Hoare triple {79222#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:38,858 INFO L290 TraceCheckUtils]: 74: Hoare triple {79247#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:38,859 INFO L272 TraceCheckUtils]: 75: Hoare triple {79247#(<= ~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)); {79247#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:38,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {79247#(<= ~counter~0 8)} ~cond := #in~cond; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:38,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {79247#(<= ~counter~0 8)} assume !(0 == ~cond); {79247#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:38,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {79247#(<= ~counter~0 8)} assume true; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:38,860 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79247#(<= ~counter~0 8)} {79247#(<= ~counter~0 8)} #96#return; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:38,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {79247#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79247#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:38,861 INFO L290 TraceCheckUtils]: 81: Hoare triple {79247#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:38,861 INFO L290 TraceCheckUtils]: 82: Hoare triple {79272#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:38,862 INFO L272 TraceCheckUtils]: 83: Hoare triple {79272#(<= ~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)); {79272#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:38,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {79272#(<= ~counter~0 9)} ~cond := #in~cond; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:38,862 INFO L290 TraceCheckUtils]: 85: Hoare triple {79272#(<= ~counter~0 9)} assume !(0 == ~cond); {79272#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:38,863 INFO L290 TraceCheckUtils]: 86: Hoare triple {79272#(<= ~counter~0 9)} assume true; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:38,863 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79272#(<= ~counter~0 9)} {79272#(<= ~counter~0 9)} #96#return; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:38,863 INFO L290 TraceCheckUtils]: 88: Hoare triple {79272#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79272#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:38,864 INFO L290 TraceCheckUtils]: 89: Hoare triple {79272#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:38,865 INFO L290 TraceCheckUtils]: 90: Hoare triple {79297#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:38,865 INFO L272 TraceCheckUtils]: 91: Hoare triple {79297#(<= ~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)); {79297#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:38,865 INFO L290 TraceCheckUtils]: 92: Hoare triple {79297#(<= ~counter~0 10)} ~cond := #in~cond; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:38,866 INFO L290 TraceCheckUtils]: 93: Hoare triple {79297#(<= ~counter~0 10)} assume !(0 == ~cond); {79297#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:38,866 INFO L290 TraceCheckUtils]: 94: Hoare triple {79297#(<= ~counter~0 10)} assume true; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:38,866 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79297#(<= ~counter~0 10)} {79297#(<= ~counter~0 10)} #96#return; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:38,867 INFO L290 TraceCheckUtils]: 96: Hoare triple {79297#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79297#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:38,867 INFO L290 TraceCheckUtils]: 97: Hoare triple {79297#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:38,868 INFO L290 TraceCheckUtils]: 98: Hoare triple {79322#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:38,868 INFO L272 TraceCheckUtils]: 99: Hoare triple {79322#(<= ~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)); {79322#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:38,868 INFO L290 TraceCheckUtils]: 100: Hoare triple {79322#(<= ~counter~0 11)} ~cond := #in~cond; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:38,869 INFO L290 TraceCheckUtils]: 101: Hoare triple {79322#(<= ~counter~0 11)} assume !(0 == ~cond); {79322#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:38,869 INFO L290 TraceCheckUtils]: 102: Hoare triple {79322#(<= ~counter~0 11)} assume true; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:38,869 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79322#(<= ~counter~0 11)} {79322#(<= ~counter~0 11)} #96#return; {79322#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:38,870 INFO L290 TraceCheckUtils]: 104: Hoare triple {79322#(<= ~counter~0 11)} assume !(~r~0 > 0); {79322#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:38,871 INFO L290 TraceCheckUtils]: 105: Hoare triple {79322#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:38,871 INFO L290 TraceCheckUtils]: 106: Hoare triple {79347#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:38,871 INFO L272 TraceCheckUtils]: 107: Hoare triple {79347#(<= ~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)); {79347#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:38,872 INFO L290 TraceCheckUtils]: 108: Hoare triple {79347#(<= ~counter~0 12)} ~cond := #in~cond; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:38,872 INFO L290 TraceCheckUtils]: 109: Hoare triple {79347#(<= ~counter~0 12)} assume !(0 == ~cond); {79347#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:38,872 INFO L290 TraceCheckUtils]: 110: Hoare triple {79347#(<= ~counter~0 12)} assume true; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:38,873 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79347#(<= ~counter~0 12)} {79347#(<= ~counter~0 12)} #98#return; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:38,873 INFO L290 TraceCheckUtils]: 112: Hoare triple {79347#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79347#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:38,873 INFO L290 TraceCheckUtils]: 113: Hoare triple {79347#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79372#(<= |main_#t~post8| 12)} is VALID [2022-04-08 06:05:38,873 INFO L290 TraceCheckUtils]: 114: Hoare triple {79372#(<= |main_#t~post8| 12)} assume !(#t~post8 < 50);havoc #t~post8; {79016#false} is VALID [2022-04-08 06:05:38,874 INFO L290 TraceCheckUtils]: 115: Hoare triple {79016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79016#false} is VALID [2022-04-08 06:05:38,874 INFO L290 TraceCheckUtils]: 116: Hoare triple {79016#false} assume !(#t~post6 < 50);havoc #t~post6; {79016#false} is VALID [2022-04-08 06:05:38,874 INFO L272 TraceCheckUtils]: 117: Hoare triple {79016#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)); {79016#false} is VALID [2022-04-08 06:05:38,874 INFO L290 TraceCheckUtils]: 118: Hoare triple {79016#false} ~cond := #in~cond; {79016#false} is VALID [2022-04-08 06:05:38,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {79016#false} assume 0 == ~cond; {79016#false} is VALID [2022-04-08 06:05:38,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {79016#false} assume !false; {79016#false} is VALID [2022-04-08 06:05:38,874 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-08 06:05:38,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:05:39,537 INFO L290 TraceCheckUtils]: 120: Hoare triple {79016#false} assume !false; {79016#false} is VALID [2022-04-08 06:05:39,537 INFO L290 TraceCheckUtils]: 119: Hoare triple {79016#false} assume 0 == ~cond; {79016#false} is VALID [2022-04-08 06:05:39,537 INFO L290 TraceCheckUtils]: 118: Hoare triple {79016#false} ~cond := #in~cond; {79016#false} is VALID [2022-04-08 06:05:39,537 INFO L272 TraceCheckUtils]: 117: Hoare triple {79016#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)); {79016#false} is VALID [2022-04-08 06:05:39,537 INFO L290 TraceCheckUtils]: 116: Hoare triple {79016#false} assume !(#t~post6 < 50);havoc #t~post6; {79016#false} is VALID [2022-04-08 06:05:39,538 INFO L290 TraceCheckUtils]: 115: Hoare triple {79016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79016#false} is VALID [2022-04-08 06:05:39,538 INFO L290 TraceCheckUtils]: 114: Hoare triple {79412#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {79016#false} is VALID [2022-04-08 06:05:39,538 INFO L290 TraceCheckUtils]: 113: Hoare triple {79416#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79412#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:05:39,538 INFO L290 TraceCheckUtils]: 112: Hoare triple {79416#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79416#(< ~counter~0 50)} is VALID [2022-04-08 06:05:39,539 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79015#true} {79416#(< ~counter~0 50)} #98#return; {79416#(< ~counter~0 50)} is VALID [2022-04-08 06:05:39,539 INFO L290 TraceCheckUtils]: 110: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,539 INFO L290 TraceCheckUtils]: 109: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,539 INFO L290 TraceCheckUtils]: 108: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,539 INFO L272 TraceCheckUtils]: 107: Hoare triple {79416#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,540 INFO L290 TraceCheckUtils]: 106: Hoare triple {79416#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {79416#(< ~counter~0 50)} is VALID [2022-04-08 06:05:39,541 INFO L290 TraceCheckUtils]: 105: Hoare triple {79441#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79416#(< ~counter~0 50)} is VALID [2022-04-08 06:05:39,542 INFO L290 TraceCheckUtils]: 104: Hoare triple {79441#(< ~counter~0 49)} assume !(~r~0 > 0); {79441#(< ~counter~0 49)} is VALID [2022-04-08 06:05:39,542 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79015#true} {79441#(< ~counter~0 49)} #96#return; {79441#(< ~counter~0 49)} is VALID [2022-04-08 06:05:39,542 INFO L290 TraceCheckUtils]: 102: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,542 INFO L290 TraceCheckUtils]: 101: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,542 INFO L290 TraceCheckUtils]: 100: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,542 INFO L272 TraceCheckUtils]: 99: Hoare triple {79441#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,543 INFO L290 TraceCheckUtils]: 98: Hoare triple {79441#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {79441#(< ~counter~0 49)} is VALID [2022-04-08 06:05:39,543 INFO L290 TraceCheckUtils]: 97: Hoare triple {79466#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79441#(< ~counter~0 49)} is VALID [2022-04-08 06:05:39,544 INFO L290 TraceCheckUtils]: 96: Hoare triple {79466#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79466#(< ~counter~0 48)} is VALID [2022-04-08 06:05:39,544 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79015#true} {79466#(< ~counter~0 48)} #96#return; {79466#(< ~counter~0 48)} is VALID [2022-04-08 06:05:39,544 INFO L290 TraceCheckUtils]: 94: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,544 INFO L290 TraceCheckUtils]: 93: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,544 INFO L272 TraceCheckUtils]: 91: Hoare triple {79466#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,545 INFO L290 TraceCheckUtils]: 90: Hoare triple {79466#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {79466#(< ~counter~0 48)} is VALID [2022-04-08 06:05:39,545 INFO L290 TraceCheckUtils]: 89: Hoare triple {79491#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79466#(< ~counter~0 48)} is VALID [2022-04-08 06:05:39,546 INFO L290 TraceCheckUtils]: 88: Hoare triple {79491#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79491#(< ~counter~0 47)} is VALID [2022-04-08 06:05:39,546 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79015#true} {79491#(< ~counter~0 47)} #96#return; {79491#(< ~counter~0 47)} is VALID [2022-04-08 06:05:39,546 INFO L290 TraceCheckUtils]: 86: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,547 INFO L272 TraceCheckUtils]: 83: Hoare triple {79491#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,547 INFO L290 TraceCheckUtils]: 82: Hoare triple {79491#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {79491#(< ~counter~0 47)} is VALID [2022-04-08 06:05:39,548 INFO L290 TraceCheckUtils]: 81: Hoare triple {79516#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79491#(< ~counter~0 47)} is VALID [2022-04-08 06:05:39,548 INFO L290 TraceCheckUtils]: 80: Hoare triple {79516#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79516#(< ~counter~0 46)} is VALID [2022-04-08 06:05:39,548 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79015#true} {79516#(< ~counter~0 46)} #96#return; {79516#(< ~counter~0 46)} is VALID [2022-04-08 06:05:39,548 INFO L290 TraceCheckUtils]: 78: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,549 INFO L290 TraceCheckUtils]: 77: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,549 INFO L290 TraceCheckUtils]: 76: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,549 INFO L272 TraceCheckUtils]: 75: Hoare triple {79516#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,549 INFO L290 TraceCheckUtils]: 74: Hoare triple {79516#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {79516#(< ~counter~0 46)} is VALID [2022-04-08 06:05:39,550 INFO L290 TraceCheckUtils]: 73: Hoare triple {79541#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79516#(< ~counter~0 46)} is VALID [2022-04-08 06:05:39,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {79541#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79541#(< ~counter~0 45)} is VALID [2022-04-08 06:05:39,550 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79015#true} {79541#(< ~counter~0 45)} #96#return; {79541#(< ~counter~0 45)} is VALID [2022-04-08 06:05:39,551 INFO L290 TraceCheckUtils]: 70: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,551 INFO L272 TraceCheckUtils]: 67: Hoare triple {79541#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {79541#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {79541#(< ~counter~0 45)} is VALID [2022-04-08 06:05:39,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {79566#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79541#(< ~counter~0 45)} is VALID [2022-04-08 06:05:39,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {79566#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79566#(< ~counter~0 44)} is VALID [2022-04-08 06:05:39,553 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79015#true} {79566#(< ~counter~0 44)} #96#return; {79566#(< ~counter~0 44)} is VALID [2022-04-08 06:05:39,553 INFO L290 TraceCheckUtils]: 62: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,553 INFO L290 TraceCheckUtils]: 60: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,553 INFO L272 TraceCheckUtils]: 59: Hoare triple {79566#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {79566#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {79566#(< ~counter~0 44)} is VALID [2022-04-08 06:05:39,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {79591#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79566#(< ~counter~0 44)} is VALID [2022-04-08 06:05:39,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {79591#(< ~counter~0 43)} assume !!(0 != ~r~0); {79591#(< ~counter~0 43)} is VALID [2022-04-08 06:05:39,555 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79015#true} {79591#(< ~counter~0 43)} #94#return; {79591#(< ~counter~0 43)} is VALID [2022-04-08 06:05:39,555 INFO L290 TraceCheckUtils]: 54: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,555 INFO L290 TraceCheckUtils]: 52: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,555 INFO L272 TraceCheckUtils]: 51: Hoare triple {79591#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {79591#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {79591#(< ~counter~0 43)} is VALID [2022-04-08 06:05:39,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {79616#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79591#(< ~counter~0 43)} is VALID [2022-04-08 06:05:39,556 INFO L290 TraceCheckUtils]: 48: Hoare triple {79616#(< ~counter~0 42)} assume !(~r~0 < 0); {79616#(< ~counter~0 42)} is VALID [2022-04-08 06:05:39,557 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79015#true} {79616#(< ~counter~0 42)} #98#return; {79616#(< ~counter~0 42)} is VALID [2022-04-08 06:05:39,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,557 INFO L272 TraceCheckUtils]: 43: Hoare triple {79616#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {79616#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {79616#(< ~counter~0 42)} is VALID [2022-04-08 06:05:39,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {79641#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79616#(< ~counter~0 42)} is VALID [2022-04-08 06:05:39,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {79641#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79641#(< ~counter~0 41)} is VALID [2022-04-08 06:05:39,559 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79015#true} {79641#(< ~counter~0 41)} #98#return; {79641#(< ~counter~0 41)} is VALID [2022-04-08 06:05:39,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,559 INFO L272 TraceCheckUtils]: 35: Hoare triple {79641#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {79641#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {79641#(< ~counter~0 41)} is VALID [2022-04-08 06:05:39,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {79666#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79641#(< ~counter~0 41)} is VALID [2022-04-08 06:05:39,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {79666#(< ~counter~0 40)} assume !(~r~0 > 0); {79666#(< ~counter~0 40)} is VALID [2022-04-08 06:05:39,561 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79015#true} {79666#(< ~counter~0 40)} #96#return; {79666#(< ~counter~0 40)} is VALID [2022-04-08 06:05:39,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,561 INFO L272 TraceCheckUtils]: 27: Hoare triple {79666#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {79666#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {79666#(< ~counter~0 40)} is VALID [2022-04-08 06:05:39,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {79691#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79666#(< ~counter~0 40)} is VALID [2022-04-08 06:05:39,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {79691#(< ~counter~0 39)} assume !!(0 != ~r~0); {79691#(< ~counter~0 39)} is VALID [2022-04-08 06:05:39,563 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79015#true} {79691#(< ~counter~0 39)} #94#return; {79691#(< ~counter~0 39)} is VALID [2022-04-08 06:05:39,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {79691#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {79691#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {79691#(< ~counter~0 39)} is VALID [2022-04-08 06:05:39,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {79716#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79691#(< ~counter~0 39)} is VALID [2022-04-08 06:05:39,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {79716#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79716#(< ~counter~0 38)} is VALID [2022-04-08 06:05:39,565 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79015#true} {79716#(< ~counter~0 38)} #92#return; {79716#(< ~counter~0 38)} is VALID [2022-04-08 06:05:39,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,565 INFO L272 TraceCheckUtils]: 11: Hoare triple {79716#(< ~counter~0 38)} 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)); {79015#true} is VALID [2022-04-08 06:05:39,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79015#true} {79716#(< ~counter~0 38)} #90#return; {79716#(< ~counter~0 38)} is VALID [2022-04-08 06:05:39,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-08 06:05:39,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-08 06:05:39,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-08 06:05:39,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {79716#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79015#true} is VALID [2022-04-08 06:05:39,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {79716#(< ~counter~0 38)} 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; {79716#(< ~counter~0 38)} is VALID [2022-04-08 06:05:39,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {79716#(< ~counter~0 38)} call #t~ret9 := main(); {79716#(< ~counter~0 38)} is VALID [2022-04-08 06:05:39,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79716#(< ~counter~0 38)} {79015#true} #102#return; {79716#(< ~counter~0 38)} is VALID [2022-04-08 06:05:39,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {79716#(< ~counter~0 38)} assume true; {79716#(< ~counter~0 38)} is VALID [2022-04-08 06:05:39,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {79015#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79716#(< ~counter~0 38)} is VALID [2022-04-08 06:05:39,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {79015#true} call ULTIMATE.init(); {79015#true} is VALID [2022-04-08 06:05:39,568 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-08 06:05:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:05:39,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646998637] [2022-04-08 06:05:39,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:05:39,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292763975] [2022-04-08 06:05:39,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292763975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:05:39,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:05:39,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 06:05:39,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:05:39,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [392596970] [2022-04-08 06:05:39,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [392596970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:05:39,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:05:39,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 06:05:39,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629617372] [2022-04-08 06:05:39,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:05:39,569 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-08 06:05:39,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:05:39,570 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-08 06:05:39,663 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-08 06:05:39,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 06:05:39,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:39,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 06:05:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 06:05:39,664 INFO L87 Difference]: Start difference. First operand 616 states and 841 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-08 06:05:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:42,540 INFO L93 Difference]: Finished difference Result 837 states and 1174 transitions. [2022-04-08 06:05:42,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 06:05:42,540 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-08 06:05:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:42,540 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-08 06:05:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-08 06:05:42,542 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-08 06:05:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-08 06:05:42,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-08 06:05:42,775 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-08 06:05:42,793 INFO L225 Difference]: With dead ends: 837 [2022-04-08 06:05:42,794 INFO L226 Difference]: Without dead ends: 644 [2022-04-08 06:05:42,795 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-08 06:05:42,795 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 172 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:42,795 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 304 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:05:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-08 06:05:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 634. [2022-04-08 06:05:44,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:44,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:44,672 INFO L74 IsIncluded]: Start isIncluded. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:44,677 INFO L87 Difference]: Start difference. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:44,699 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-08 06:05:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-08 06:05:44,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:44,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:44,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-08 06:05:44,702 INFO L87 Difference]: Start difference. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-08 06:05:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:44,723 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-08 06:05:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-08 06:05:44,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:44,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:44,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:44,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 863 transitions. [2022-04-08 06:05:44,747 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 863 transitions. Word has length 121 [2022-04-08 06:05:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:44,747 INFO L478 AbstractCegarLoop]: Abstraction has 634 states and 863 transitions. [2022-04-08 06:05:44,748 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-08 06:05:44,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 863 transitions. [2022-04-08 06:05:47,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 863 edges. 863 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 863 transitions. [2022-04-08 06:05:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 06:05:47,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:47,615 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-08 06:05:47,622 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-08 06:05:47,815 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-08 06:05:47,815 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-08 06:05:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:47,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779532889] [2022-04-08 06:05:47,816 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-08 06:05:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:47,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098809289] [2022-04-08 06:05:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:47,828 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:47,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338631312] [2022-04-08 06:05:47,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:05:47,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:47,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:47,830 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-08 06:05:47,859 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-08 06:05:47,992 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:05:47,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:47,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 06:05:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:48,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:48,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {84020#true} call ULTIMATE.init(); {84020#true} is VALID [2022-04-08 06:05:48,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {84020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84028#(<= ~counter~0 0)} {84020#true} #102#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {84028#(<= ~counter~0 0)} call #t~ret9 := main(); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {84028#(<= ~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; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {84028#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {84028#(<= ~counter~0 0)} ~cond := #in~cond; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {84028#(<= ~counter~0 0)} assume !(0 == ~cond); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84028#(<= ~counter~0 0)} {84028#(<= ~counter~0 0)} #90#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,607 INFO L272 TraceCheckUtils]: 11: Hoare triple {84028#(<= ~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)); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {84028#(<= ~counter~0 0)} ~cond := #in~cond; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {84028#(<= ~counter~0 0)} assume !(0 == ~cond); {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,608 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84028#(<= ~counter~0 0)} {84028#(<= ~counter~0 0)} #92#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {84028#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84028#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:48,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {84028#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:48,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {84077#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:48,611 INFO L272 TraceCheckUtils]: 19: Hoare triple {84077#(<= ~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)); {84077#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:48,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {84077#(<= ~counter~0 1)} ~cond := #in~cond; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:48,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {84077#(<= ~counter~0 1)} assume !(0 == ~cond); {84077#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:48,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {84077#(<= ~counter~0 1)} assume true; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:48,613 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84077#(<= ~counter~0 1)} {84077#(<= ~counter~0 1)} #94#return; {84077#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:48,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {84077#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84077#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:48,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {84077#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:48,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {84102#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:48,615 INFO L272 TraceCheckUtils]: 27: Hoare triple {84102#(<= ~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)); {84102#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:48,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {84102#(<= ~counter~0 2)} ~cond := #in~cond; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:48,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {84102#(<= ~counter~0 2)} assume !(0 == ~cond); {84102#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:48,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {84102#(<= ~counter~0 2)} assume true; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:48,616 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84102#(<= ~counter~0 2)} {84102#(<= ~counter~0 2)} #96#return; {84102#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:48,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {84102#(<= ~counter~0 2)} assume !(~r~0 > 0); {84102#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:48,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {84102#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:48,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {84127#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:48,618 INFO L272 TraceCheckUtils]: 35: Hoare triple {84127#(<= ~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)); {84127#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:48,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {84127#(<= ~counter~0 3)} ~cond := #in~cond; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:48,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {84127#(<= ~counter~0 3)} assume !(0 == ~cond); {84127#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:48,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {84127#(<= ~counter~0 3)} assume true; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:48,619 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84127#(<= ~counter~0 3)} {84127#(<= ~counter~0 3)} #98#return; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:48,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {84127#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84127#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:48,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {84127#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:48,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {84152#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:48,621 INFO L272 TraceCheckUtils]: 43: Hoare triple {84152#(<= ~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)); {84152#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:48,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {84152#(<= ~counter~0 4)} ~cond := #in~cond; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:48,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {84152#(<= ~counter~0 4)} assume !(0 == ~cond); {84152#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:48,622 INFO L290 TraceCheckUtils]: 46: Hoare triple {84152#(<= ~counter~0 4)} assume true; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:48,622 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84152#(<= ~counter~0 4)} {84152#(<= ~counter~0 4)} #98#return; {84152#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:48,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {84152#(<= ~counter~0 4)} assume !(~r~0 < 0); {84152#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:48,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {84152#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:48,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {84177#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:48,624 INFO L272 TraceCheckUtils]: 51: Hoare triple {84177#(<= ~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)); {84177#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:48,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {84177#(<= ~counter~0 5)} ~cond := #in~cond; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:48,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {84177#(<= ~counter~0 5)} assume !(0 == ~cond); {84177#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:48,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {84177#(<= ~counter~0 5)} assume true; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:48,625 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84177#(<= ~counter~0 5)} {84177#(<= ~counter~0 5)} #94#return; {84177#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:48,626 INFO L290 TraceCheckUtils]: 56: Hoare triple {84177#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84177#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:48,626 INFO L290 TraceCheckUtils]: 57: Hoare triple {84177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:48,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {84202#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:48,627 INFO L272 TraceCheckUtils]: 59: Hoare triple {84202#(<= ~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)); {84202#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:48,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {84202#(<= ~counter~0 6)} ~cond := #in~cond; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:48,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {84202#(<= ~counter~0 6)} assume !(0 == ~cond); {84202#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:48,628 INFO L290 TraceCheckUtils]: 62: Hoare triple {84202#(<= ~counter~0 6)} assume true; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:48,629 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84202#(<= ~counter~0 6)} {84202#(<= ~counter~0 6)} #96#return; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:48,629 INFO L290 TraceCheckUtils]: 64: Hoare triple {84202#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84202#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:48,630 INFO L290 TraceCheckUtils]: 65: Hoare triple {84202#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:48,630 INFO L290 TraceCheckUtils]: 66: Hoare triple {84227#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:48,630 INFO L272 TraceCheckUtils]: 67: Hoare triple {84227#(<= ~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)); {84227#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:48,631 INFO L290 TraceCheckUtils]: 68: Hoare triple {84227#(<= ~counter~0 7)} ~cond := #in~cond; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:48,631 INFO L290 TraceCheckUtils]: 69: Hoare triple {84227#(<= ~counter~0 7)} assume !(0 == ~cond); {84227#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:48,631 INFO L290 TraceCheckUtils]: 70: Hoare triple {84227#(<= ~counter~0 7)} assume true; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:48,632 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84227#(<= ~counter~0 7)} {84227#(<= ~counter~0 7)} #96#return; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:48,632 INFO L290 TraceCheckUtils]: 72: Hoare triple {84227#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84227#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:48,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {84227#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:48,633 INFO L290 TraceCheckUtils]: 74: Hoare triple {84252#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:48,634 INFO L272 TraceCheckUtils]: 75: Hoare triple {84252#(<= ~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)); {84252#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:48,634 INFO L290 TraceCheckUtils]: 76: Hoare triple {84252#(<= ~counter~0 8)} ~cond := #in~cond; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:48,634 INFO L290 TraceCheckUtils]: 77: Hoare triple {84252#(<= ~counter~0 8)} assume !(0 == ~cond); {84252#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:48,634 INFO L290 TraceCheckUtils]: 78: Hoare triple {84252#(<= ~counter~0 8)} assume true; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:48,635 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84252#(<= ~counter~0 8)} {84252#(<= ~counter~0 8)} #96#return; {84252#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:48,635 INFO L290 TraceCheckUtils]: 80: Hoare triple {84252#(<= ~counter~0 8)} assume !(~r~0 > 0); {84252#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:48,636 INFO L290 TraceCheckUtils]: 81: Hoare triple {84252#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:48,636 INFO L290 TraceCheckUtils]: 82: Hoare triple {84277#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:48,637 INFO L272 TraceCheckUtils]: 83: Hoare triple {84277#(<= ~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)); {84277#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:48,637 INFO L290 TraceCheckUtils]: 84: Hoare triple {84277#(<= ~counter~0 9)} ~cond := #in~cond; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:48,637 INFO L290 TraceCheckUtils]: 85: Hoare triple {84277#(<= ~counter~0 9)} assume !(0 == ~cond); {84277#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:48,638 INFO L290 TraceCheckUtils]: 86: Hoare triple {84277#(<= ~counter~0 9)} assume true; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:48,638 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84277#(<= ~counter~0 9)} {84277#(<= ~counter~0 9)} #98#return; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:48,638 INFO L290 TraceCheckUtils]: 88: Hoare triple {84277#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84277#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:48,639 INFO L290 TraceCheckUtils]: 89: Hoare triple {84277#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:48,640 INFO L290 TraceCheckUtils]: 90: Hoare triple {84302#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:48,640 INFO L272 TraceCheckUtils]: 91: Hoare triple {84302#(<= ~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)); {84302#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:48,640 INFO L290 TraceCheckUtils]: 92: Hoare triple {84302#(<= ~counter~0 10)} ~cond := #in~cond; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:48,641 INFO L290 TraceCheckUtils]: 93: Hoare triple {84302#(<= ~counter~0 10)} assume !(0 == ~cond); {84302#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:48,641 INFO L290 TraceCheckUtils]: 94: Hoare triple {84302#(<= ~counter~0 10)} assume true; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:48,641 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84302#(<= ~counter~0 10)} {84302#(<= ~counter~0 10)} #98#return; {84302#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:48,642 INFO L290 TraceCheckUtils]: 96: Hoare triple {84302#(<= ~counter~0 10)} assume !(~r~0 < 0); {84302#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:48,642 INFO L290 TraceCheckUtils]: 97: Hoare triple {84302#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:48,643 INFO L290 TraceCheckUtils]: 98: Hoare triple {84327#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:48,643 INFO L272 TraceCheckUtils]: 99: Hoare triple {84327#(<= ~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)); {84327#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:48,644 INFO L290 TraceCheckUtils]: 100: Hoare triple {84327#(<= ~counter~0 11)} ~cond := #in~cond; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:48,644 INFO L290 TraceCheckUtils]: 101: Hoare triple {84327#(<= ~counter~0 11)} assume !(0 == ~cond); {84327#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:48,644 INFO L290 TraceCheckUtils]: 102: Hoare triple {84327#(<= ~counter~0 11)} assume true; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:48,645 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84327#(<= ~counter~0 11)} {84327#(<= ~counter~0 11)} #94#return; {84327#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:48,645 INFO L290 TraceCheckUtils]: 104: Hoare triple {84327#(<= ~counter~0 11)} assume !!(0 != ~r~0); {84327#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:48,646 INFO L290 TraceCheckUtils]: 105: Hoare triple {84327#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:48,646 INFO L290 TraceCheckUtils]: 106: Hoare triple {84352#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:48,646 INFO L272 TraceCheckUtils]: 107: Hoare triple {84352#(<= ~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)); {84352#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:48,647 INFO L290 TraceCheckUtils]: 108: Hoare triple {84352#(<= ~counter~0 12)} ~cond := #in~cond; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:48,647 INFO L290 TraceCheckUtils]: 109: Hoare triple {84352#(<= ~counter~0 12)} assume !(0 == ~cond); {84352#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:48,647 INFO L290 TraceCheckUtils]: 110: Hoare triple {84352#(<= ~counter~0 12)} assume true; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:48,648 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84352#(<= ~counter~0 12)} {84352#(<= ~counter~0 12)} #96#return; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:48,648 INFO L290 TraceCheckUtils]: 112: Hoare triple {84352#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84352#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:48,648 INFO L290 TraceCheckUtils]: 113: Hoare triple {84352#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84377#(<= |main_#t~post7| 12)} is VALID [2022-04-08 06:05:48,649 INFO L290 TraceCheckUtils]: 114: Hoare triple {84377#(<= |main_#t~post7| 12)} assume !(#t~post7 < 50);havoc #t~post7; {84021#false} is VALID [2022-04-08 06:05:48,649 INFO L290 TraceCheckUtils]: 115: Hoare triple {84021#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84021#false} is VALID [2022-04-08 06:05:48,649 INFO L290 TraceCheckUtils]: 116: Hoare triple {84021#false} assume !(#t~post8 < 50);havoc #t~post8; {84021#false} is VALID [2022-04-08 06:05:48,649 INFO L290 TraceCheckUtils]: 117: Hoare triple {84021#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84021#false} is VALID [2022-04-08 06:05:48,649 INFO L290 TraceCheckUtils]: 118: Hoare triple {84021#false} assume !(#t~post6 < 50);havoc #t~post6; {84021#false} is VALID [2022-04-08 06:05:48,649 INFO L272 TraceCheckUtils]: 119: Hoare triple {84021#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)); {84021#false} is VALID [2022-04-08 06:05:48,649 INFO L290 TraceCheckUtils]: 120: Hoare triple {84021#false} ~cond := #in~cond; {84021#false} is VALID [2022-04-08 06:05:48,649 INFO L290 TraceCheckUtils]: 121: Hoare triple {84021#false} assume 0 == ~cond; {84021#false} is VALID [2022-04-08 06:05:48,649 INFO L290 TraceCheckUtils]: 122: Hoare triple {84021#false} assume !false; {84021#false} is VALID [2022-04-08 06:05:48,650 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-08 06:05:48,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:05:49,347 INFO L290 TraceCheckUtils]: 122: Hoare triple {84021#false} assume !false; {84021#false} is VALID [2022-04-08 06:05:49,347 INFO L290 TraceCheckUtils]: 121: Hoare triple {84021#false} assume 0 == ~cond; {84021#false} is VALID [2022-04-08 06:05:49,347 INFO L290 TraceCheckUtils]: 120: Hoare triple {84021#false} ~cond := #in~cond; {84021#false} is VALID [2022-04-08 06:05:49,348 INFO L272 TraceCheckUtils]: 119: Hoare triple {84021#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)); {84021#false} is VALID [2022-04-08 06:05:49,348 INFO L290 TraceCheckUtils]: 118: Hoare triple {84021#false} assume !(#t~post6 < 50);havoc #t~post6; {84021#false} is VALID [2022-04-08 06:05:49,348 INFO L290 TraceCheckUtils]: 117: Hoare triple {84021#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84021#false} is VALID [2022-04-08 06:05:49,348 INFO L290 TraceCheckUtils]: 116: Hoare triple {84021#false} assume !(#t~post8 < 50);havoc #t~post8; {84021#false} is VALID [2022-04-08 06:05:49,348 INFO L290 TraceCheckUtils]: 115: Hoare triple {84021#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84021#false} is VALID [2022-04-08 06:05:49,348 INFO L290 TraceCheckUtils]: 114: Hoare triple {84429#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {84021#false} is VALID [2022-04-08 06:05:49,348 INFO L290 TraceCheckUtils]: 113: Hoare triple {84433#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84429#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:05:49,349 INFO L290 TraceCheckUtils]: 112: Hoare triple {84433#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84433#(< ~counter~0 50)} is VALID [2022-04-08 06:05:49,349 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84020#true} {84433#(< ~counter~0 50)} #96#return; {84433#(< ~counter~0 50)} is VALID [2022-04-08 06:05:49,349 INFO L290 TraceCheckUtils]: 110: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,349 INFO L290 TraceCheckUtils]: 109: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,349 INFO L290 TraceCheckUtils]: 108: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,350 INFO L272 TraceCheckUtils]: 107: Hoare triple {84433#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,350 INFO L290 TraceCheckUtils]: 106: Hoare triple {84433#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {84433#(< ~counter~0 50)} is VALID [2022-04-08 06:05:49,352 INFO L290 TraceCheckUtils]: 105: Hoare triple {84458#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84433#(< ~counter~0 50)} is VALID [2022-04-08 06:05:49,352 INFO L290 TraceCheckUtils]: 104: Hoare triple {84458#(< ~counter~0 49)} assume !!(0 != ~r~0); {84458#(< ~counter~0 49)} is VALID [2022-04-08 06:05:49,353 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84020#true} {84458#(< ~counter~0 49)} #94#return; {84458#(< ~counter~0 49)} is VALID [2022-04-08 06:05:49,353 INFO L290 TraceCheckUtils]: 102: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,353 INFO L290 TraceCheckUtils]: 101: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,353 INFO L290 TraceCheckUtils]: 100: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,353 INFO L272 TraceCheckUtils]: 99: Hoare triple {84458#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,353 INFO L290 TraceCheckUtils]: 98: Hoare triple {84458#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {84458#(< ~counter~0 49)} is VALID [2022-04-08 06:05:49,354 INFO L290 TraceCheckUtils]: 97: Hoare triple {84483#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84458#(< ~counter~0 49)} is VALID [2022-04-08 06:05:49,355 INFO L290 TraceCheckUtils]: 96: Hoare triple {84483#(< ~counter~0 48)} assume !(~r~0 < 0); {84483#(< ~counter~0 48)} is VALID [2022-04-08 06:05:49,355 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84020#true} {84483#(< ~counter~0 48)} #98#return; {84483#(< ~counter~0 48)} is VALID [2022-04-08 06:05:49,355 INFO L290 TraceCheckUtils]: 94: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,355 INFO L290 TraceCheckUtils]: 93: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,355 INFO L290 TraceCheckUtils]: 92: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,355 INFO L272 TraceCheckUtils]: 91: Hoare triple {84483#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,356 INFO L290 TraceCheckUtils]: 90: Hoare triple {84483#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {84483#(< ~counter~0 48)} is VALID [2022-04-08 06:05:49,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {84508#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84483#(< ~counter~0 48)} is VALID [2022-04-08 06:05:49,357 INFO L290 TraceCheckUtils]: 88: Hoare triple {84508#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84508#(< ~counter~0 47)} is VALID [2022-04-08 06:05:49,357 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84020#true} {84508#(< ~counter~0 47)} #98#return; {84508#(< ~counter~0 47)} is VALID [2022-04-08 06:05:49,357 INFO L290 TraceCheckUtils]: 86: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,357 INFO L290 TraceCheckUtils]: 85: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,358 INFO L290 TraceCheckUtils]: 84: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,358 INFO L272 TraceCheckUtils]: 83: Hoare triple {84508#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,358 INFO L290 TraceCheckUtils]: 82: Hoare triple {84508#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {84508#(< ~counter~0 47)} is VALID [2022-04-08 06:05:49,359 INFO L290 TraceCheckUtils]: 81: Hoare triple {84533#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84508#(< ~counter~0 47)} is VALID [2022-04-08 06:05:49,359 INFO L290 TraceCheckUtils]: 80: Hoare triple {84533#(< ~counter~0 46)} assume !(~r~0 > 0); {84533#(< ~counter~0 46)} is VALID [2022-04-08 06:05:49,360 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84020#true} {84533#(< ~counter~0 46)} #96#return; {84533#(< ~counter~0 46)} is VALID [2022-04-08 06:05:49,360 INFO L290 TraceCheckUtils]: 78: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,360 INFO L290 TraceCheckUtils]: 77: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,360 INFO L290 TraceCheckUtils]: 76: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,360 INFO L272 TraceCheckUtils]: 75: Hoare triple {84533#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,360 INFO L290 TraceCheckUtils]: 74: Hoare triple {84533#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {84533#(< ~counter~0 46)} is VALID [2022-04-08 06:05:49,361 INFO L290 TraceCheckUtils]: 73: Hoare triple {84558#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84533#(< ~counter~0 46)} is VALID [2022-04-08 06:05:49,361 INFO L290 TraceCheckUtils]: 72: Hoare triple {84558#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84558#(< ~counter~0 45)} is VALID [2022-04-08 06:05:49,362 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84020#true} {84558#(< ~counter~0 45)} #96#return; {84558#(< ~counter~0 45)} is VALID [2022-04-08 06:05:49,362 INFO L290 TraceCheckUtils]: 70: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,362 INFO L290 TraceCheckUtils]: 69: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,362 INFO L290 TraceCheckUtils]: 68: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,362 INFO L272 TraceCheckUtils]: 67: Hoare triple {84558#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,362 INFO L290 TraceCheckUtils]: 66: Hoare triple {84558#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {84558#(< ~counter~0 45)} is VALID [2022-04-08 06:05:49,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {84583#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84558#(< ~counter~0 45)} is VALID [2022-04-08 06:05:49,364 INFO L290 TraceCheckUtils]: 64: Hoare triple {84583#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84583#(< ~counter~0 44)} is VALID [2022-04-08 06:05:49,364 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84020#true} {84583#(< ~counter~0 44)} #96#return; {84583#(< ~counter~0 44)} is VALID [2022-04-08 06:05:49,364 INFO L290 TraceCheckUtils]: 62: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,364 INFO L290 TraceCheckUtils]: 60: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,364 INFO L272 TraceCheckUtils]: 59: Hoare triple {84583#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {84583#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {84583#(< ~counter~0 44)} is VALID [2022-04-08 06:05:49,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {84608#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84583#(< ~counter~0 44)} is VALID [2022-04-08 06:05:49,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {84608#(< ~counter~0 43)} assume !!(0 != ~r~0); {84608#(< ~counter~0 43)} is VALID [2022-04-08 06:05:49,366 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84020#true} {84608#(< ~counter~0 43)} #94#return; {84608#(< ~counter~0 43)} is VALID [2022-04-08 06:05:49,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,367 INFO L272 TraceCheckUtils]: 51: Hoare triple {84608#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {84608#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {84608#(< ~counter~0 43)} is VALID [2022-04-08 06:05:49,368 INFO L290 TraceCheckUtils]: 49: Hoare triple {84633#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84608#(< ~counter~0 43)} is VALID [2022-04-08 06:05:49,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {84633#(< ~counter~0 42)} assume !(~r~0 < 0); {84633#(< ~counter~0 42)} is VALID [2022-04-08 06:05:49,369 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84020#true} {84633#(< ~counter~0 42)} #98#return; {84633#(< ~counter~0 42)} is VALID [2022-04-08 06:05:49,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,369 INFO L272 TraceCheckUtils]: 43: Hoare triple {84633#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {84633#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {84633#(< ~counter~0 42)} is VALID [2022-04-08 06:05:49,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {84658#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84633#(< ~counter~0 42)} is VALID [2022-04-08 06:05:49,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {84658#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84658#(< ~counter~0 41)} is VALID [2022-04-08 06:05:49,371 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84020#true} {84658#(< ~counter~0 41)} #98#return; {84658#(< ~counter~0 41)} is VALID [2022-04-08 06:05:49,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,372 INFO L272 TraceCheckUtils]: 35: Hoare triple {84658#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {84658#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {84658#(< ~counter~0 41)} is VALID [2022-04-08 06:05:49,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {84683#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84658#(< ~counter~0 41)} is VALID [2022-04-08 06:05:49,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {84683#(< ~counter~0 40)} assume !(~r~0 > 0); {84683#(< ~counter~0 40)} is VALID [2022-04-08 06:05:49,374 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84020#true} {84683#(< ~counter~0 40)} #96#return; {84683#(< ~counter~0 40)} is VALID [2022-04-08 06:05:49,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,374 INFO L272 TraceCheckUtils]: 27: Hoare triple {84683#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {84683#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {84683#(< ~counter~0 40)} is VALID [2022-04-08 06:05:49,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {84708#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84683#(< ~counter~0 40)} is VALID [2022-04-08 06:05:49,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {84708#(< ~counter~0 39)} assume !!(0 != ~r~0); {84708#(< ~counter~0 39)} is VALID [2022-04-08 06:05:49,376 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84020#true} {84708#(< ~counter~0 39)} #94#return; {84708#(< ~counter~0 39)} is VALID [2022-04-08 06:05:49,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,376 INFO L272 TraceCheckUtils]: 19: Hoare triple {84708#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {84708#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {84708#(< ~counter~0 39)} is VALID [2022-04-08 06:05:49,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {84733#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84708#(< ~counter~0 39)} is VALID [2022-04-08 06:05:49,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {84733#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84733#(< ~counter~0 38)} is VALID [2022-04-08 06:05:49,378 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84020#true} {84733#(< ~counter~0 38)} #92#return; {84733#(< ~counter~0 38)} is VALID [2022-04-08 06:05:49,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,378 INFO L272 TraceCheckUtils]: 11: Hoare triple {84733#(< ~counter~0 38)} 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)); {84020#true} is VALID [2022-04-08 06:05:49,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84020#true} {84733#(< ~counter~0 38)} #90#return; {84733#(< ~counter~0 38)} is VALID [2022-04-08 06:05:49,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-08 06:05:49,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-08 06:05:49,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-08 06:05:49,379 INFO L272 TraceCheckUtils]: 6: Hoare triple {84733#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84020#true} is VALID [2022-04-08 06:05:49,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {84733#(< ~counter~0 38)} 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; {84733#(< ~counter~0 38)} is VALID [2022-04-08 06:05:49,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {84733#(< ~counter~0 38)} call #t~ret9 := main(); {84733#(< ~counter~0 38)} is VALID [2022-04-08 06:05:49,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84733#(< ~counter~0 38)} {84020#true} #102#return; {84733#(< ~counter~0 38)} is VALID [2022-04-08 06:05:49,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {84733#(< ~counter~0 38)} assume true; {84733#(< ~counter~0 38)} is VALID [2022-04-08 06:05:49,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {84020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84733#(< ~counter~0 38)} is VALID [2022-04-08 06:05:49,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {84020#true} call ULTIMATE.init(); {84020#true} is VALID [2022-04-08 06:05:49,381 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-08 06:05:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:05:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098809289] [2022-04-08 06:05:49,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:05:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338631312] [2022-04-08 06:05:49,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338631312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:05:49,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:05:49,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 06:05:49,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:05:49,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779532889] [2022-04-08 06:05:49,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779532889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:05:49,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:05:49,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 06:05:49,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564316521] [2022-04-08 06:05:49,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:05:49,382 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-08 06:05:49,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:05:49,382 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-08 06:05:49,492 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-08 06:05:49,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 06:05:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:49,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 06:05:49,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 06:05:49,493 INFO L87 Difference]: Start difference. First operand 634 states and 863 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-08 06:05:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:52,606 INFO L93 Difference]: Finished difference Result 847 states and 1187 transitions. [2022-04-08 06:05:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 06:05:52,606 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-08 06:05:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:52,607 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-08 06:05:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-08 06:05:52,609 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-08 06:05:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-08 06:05:52,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-08 06:05:52,923 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-08 06:05:52,944 INFO L225 Difference]: With dead ends: 847 [2022-04-08 06:05:52,944 INFO L226 Difference]: Without dead ends: 650 [2022-04-08 06:05:52,945 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-08 06:05:52,946 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 171 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:52,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 281 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:05:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-08 06:05:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-04-08 06:05:54,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:54,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:54,968 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:54,969 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:54,983 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-08 06:05:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 06:05:54,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:54,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:54,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-08 06:05:54,985 INFO L87 Difference]: Start difference. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-08 06:05:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:55,007 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-08 06:05:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 06:05:55,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:55,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:55,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:55,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:05:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 879 transitions. [2022-04-08 06:05:55,040 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 879 transitions. Word has length 123 [2022-04-08 06:05:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:55,040 INFO L478 AbstractCegarLoop]: Abstraction has 650 states and 879 transitions. [2022-04-08 06:05:55,041 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-08 06:05:55,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 650 states and 879 transitions. [2022-04-08 06:05:58,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 06:05:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 06:05:58,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:58,454 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-08 06:05:58,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 06:05:58,655 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-08 06:05:58,655 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-08 06:05:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:58,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [644638644] [2022-04-08 06:05:58,656 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-08 06:05:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:58,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046599875] [2022-04-08 06:05:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:58,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:58,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524434839] [2022-04-08 06:05:58,668 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:05:58,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:58,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:58,669 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-08 06:05:58,671 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-08 06:05:58,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:05:58,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:58,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 06:05:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:58,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:59,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {89103#true} call ULTIMATE.init(); {89103#true} is VALID [2022-04-08 06:05:59,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {89103#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89111#(<= ~counter~0 0)} {89103#true} #102#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {89111#(<= ~counter~0 0)} call #t~ret9 := main(); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {89111#(<= ~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; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {89111#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {89111#(<= ~counter~0 0)} ~cond := #in~cond; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {89111#(<= ~counter~0 0)} assume !(0 == ~cond); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89111#(<= ~counter~0 0)} {89111#(<= ~counter~0 0)} #90#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,395 INFO L272 TraceCheckUtils]: 11: Hoare triple {89111#(<= ~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)); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {89111#(<= ~counter~0 0)} ~cond := #in~cond; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {89111#(<= ~counter~0 0)} assume !(0 == ~cond); {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,396 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89111#(<= ~counter~0 0)} {89111#(<= ~counter~0 0)} #92#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {89111#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89111#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:59,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {89111#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:59,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {89160#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:59,399 INFO L272 TraceCheckUtils]: 19: Hoare triple {89160#(<= ~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)); {89160#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:59,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {89160#(<= ~counter~0 1)} ~cond := #in~cond; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:59,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {89160#(<= ~counter~0 1)} assume !(0 == ~cond); {89160#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:59,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {89160#(<= ~counter~0 1)} assume true; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:59,401 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89160#(<= ~counter~0 1)} {89160#(<= ~counter~0 1)} #94#return; {89160#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:59,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {89160#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89160#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:59,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {89160#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:59,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {89185#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:59,403 INFO L272 TraceCheckUtils]: 27: Hoare triple {89185#(<= ~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)); {89185#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:59,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {89185#(<= ~counter~0 2)} ~cond := #in~cond; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:59,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {89185#(<= ~counter~0 2)} assume !(0 == ~cond); {89185#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:59,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {89185#(<= ~counter~0 2)} assume true; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:59,404 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89185#(<= ~counter~0 2)} {89185#(<= ~counter~0 2)} #96#return; {89185#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:59,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {89185#(<= ~counter~0 2)} assume !(~r~0 > 0); {89185#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:59,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {89185#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:59,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {89210#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:59,406 INFO L272 TraceCheckUtils]: 35: Hoare triple {89210#(<= ~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)); {89210#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:59,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {89210#(<= ~counter~0 3)} ~cond := #in~cond; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:59,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {89210#(<= ~counter~0 3)} assume !(0 == ~cond); {89210#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:59,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {89210#(<= ~counter~0 3)} assume true; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:59,407 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89210#(<= ~counter~0 3)} {89210#(<= ~counter~0 3)} #98#return; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:59,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {89210#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89210#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:59,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {89210#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:59,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {89235#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:59,409 INFO L272 TraceCheckUtils]: 43: Hoare triple {89235#(<= ~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)); {89235#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:59,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {89235#(<= ~counter~0 4)} ~cond := #in~cond; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:59,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {89235#(<= ~counter~0 4)} assume !(0 == ~cond); {89235#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:59,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {89235#(<= ~counter~0 4)} assume true; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:59,411 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89235#(<= ~counter~0 4)} {89235#(<= ~counter~0 4)} #98#return; {89235#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:59,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {89235#(<= ~counter~0 4)} assume !(~r~0 < 0); {89235#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:59,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {89235#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:59,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {89260#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:59,412 INFO L272 TraceCheckUtils]: 51: Hoare triple {89260#(<= ~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)); {89260#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:59,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {89260#(<= ~counter~0 5)} ~cond := #in~cond; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:59,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {89260#(<= ~counter~0 5)} assume !(0 == ~cond); {89260#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:59,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {89260#(<= ~counter~0 5)} assume true; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:59,414 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89260#(<= ~counter~0 5)} {89260#(<= ~counter~0 5)} #94#return; {89260#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:59,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {89260#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89260#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:59,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {89260#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:59,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {89285#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:59,416 INFO L272 TraceCheckUtils]: 59: Hoare triple {89285#(<= ~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)); {89285#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:59,416 INFO L290 TraceCheckUtils]: 60: Hoare triple {89285#(<= ~counter~0 6)} ~cond := #in~cond; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:59,416 INFO L290 TraceCheckUtils]: 61: Hoare triple {89285#(<= ~counter~0 6)} assume !(0 == ~cond); {89285#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:59,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {89285#(<= ~counter~0 6)} assume true; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:59,417 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89285#(<= ~counter~0 6)} {89285#(<= ~counter~0 6)} #96#return; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:59,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {89285#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89285#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:59,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {89285#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:59,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {89310#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:59,419 INFO L272 TraceCheckUtils]: 67: Hoare triple {89310#(<= ~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)); {89310#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:59,419 INFO L290 TraceCheckUtils]: 68: Hoare triple {89310#(<= ~counter~0 7)} ~cond := #in~cond; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:59,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {89310#(<= ~counter~0 7)} assume !(0 == ~cond); {89310#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:59,420 INFO L290 TraceCheckUtils]: 70: Hoare triple {89310#(<= ~counter~0 7)} assume true; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:59,420 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89310#(<= ~counter~0 7)} {89310#(<= ~counter~0 7)} #96#return; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:59,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {89310#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89310#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:59,421 INFO L290 TraceCheckUtils]: 73: Hoare triple {89310#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:59,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {89335#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:59,422 INFO L272 TraceCheckUtils]: 75: Hoare triple {89335#(<= ~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)); {89335#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:59,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {89335#(<= ~counter~0 8)} ~cond := #in~cond; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:59,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {89335#(<= ~counter~0 8)} assume !(0 == ~cond); {89335#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:59,423 INFO L290 TraceCheckUtils]: 78: Hoare triple {89335#(<= ~counter~0 8)} assume true; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:59,424 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89335#(<= ~counter~0 8)} {89335#(<= ~counter~0 8)} #96#return; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:59,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {89335#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89335#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:59,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {89335#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:59,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {89360#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:59,426 INFO L272 TraceCheckUtils]: 83: Hoare triple {89360#(<= ~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)); {89360#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:59,426 INFO L290 TraceCheckUtils]: 84: Hoare triple {89360#(<= ~counter~0 9)} ~cond := #in~cond; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:59,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {89360#(<= ~counter~0 9)} assume !(0 == ~cond); {89360#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:59,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {89360#(<= ~counter~0 9)} assume true; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:59,427 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89360#(<= ~counter~0 9)} {89360#(<= ~counter~0 9)} #96#return; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:59,427 INFO L290 TraceCheckUtils]: 88: Hoare triple {89360#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89360#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:59,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {89360#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:59,428 INFO L290 TraceCheckUtils]: 90: Hoare triple {89385#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:59,429 INFO L272 TraceCheckUtils]: 91: Hoare triple {89385#(<= ~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)); {89385#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:59,429 INFO L290 TraceCheckUtils]: 92: Hoare triple {89385#(<= ~counter~0 10)} ~cond := #in~cond; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:59,429 INFO L290 TraceCheckUtils]: 93: Hoare triple {89385#(<= ~counter~0 10)} assume !(0 == ~cond); {89385#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:59,430 INFO L290 TraceCheckUtils]: 94: Hoare triple {89385#(<= ~counter~0 10)} assume true; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:59,430 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89385#(<= ~counter~0 10)} {89385#(<= ~counter~0 10)} #96#return; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:59,430 INFO L290 TraceCheckUtils]: 96: Hoare triple {89385#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89385#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:59,431 INFO L290 TraceCheckUtils]: 97: Hoare triple {89385#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:59,432 INFO L290 TraceCheckUtils]: 98: Hoare triple {89410#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:59,432 INFO L272 TraceCheckUtils]: 99: Hoare triple {89410#(<= ~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)); {89410#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:59,432 INFO L290 TraceCheckUtils]: 100: Hoare triple {89410#(<= ~counter~0 11)} ~cond := #in~cond; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:59,433 INFO L290 TraceCheckUtils]: 101: Hoare triple {89410#(<= ~counter~0 11)} assume !(0 == ~cond); {89410#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:59,433 INFO L290 TraceCheckUtils]: 102: Hoare triple {89410#(<= ~counter~0 11)} assume true; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:59,433 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89410#(<= ~counter~0 11)} {89410#(<= ~counter~0 11)} #96#return; {89410#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:59,434 INFO L290 TraceCheckUtils]: 104: Hoare triple {89410#(<= ~counter~0 11)} assume !(~r~0 > 0); {89410#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:59,435 INFO L290 TraceCheckUtils]: 105: Hoare triple {89410#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:59,435 INFO L290 TraceCheckUtils]: 106: Hoare triple {89435#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:59,435 INFO L272 TraceCheckUtils]: 107: Hoare triple {89435#(<= ~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)); {89435#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:59,436 INFO L290 TraceCheckUtils]: 108: Hoare triple {89435#(<= ~counter~0 12)} ~cond := #in~cond; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:59,436 INFO L290 TraceCheckUtils]: 109: Hoare triple {89435#(<= ~counter~0 12)} assume !(0 == ~cond); {89435#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:59,436 INFO L290 TraceCheckUtils]: 110: Hoare triple {89435#(<= ~counter~0 12)} assume true; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:59,437 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89435#(<= ~counter~0 12)} {89435#(<= ~counter~0 12)} #98#return; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:59,437 INFO L290 TraceCheckUtils]: 112: Hoare triple {89435#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89435#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:59,438 INFO L290 TraceCheckUtils]: 113: Hoare triple {89435#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:59,438 INFO L290 TraceCheckUtils]: 114: Hoare triple {89460#(<= ~counter~0 13)} assume !!(#t~post8 < 50);havoc #t~post8; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:59,439 INFO L272 TraceCheckUtils]: 115: Hoare triple {89460#(<= ~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)); {89460#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:59,439 INFO L290 TraceCheckUtils]: 116: Hoare triple {89460#(<= ~counter~0 13)} ~cond := #in~cond; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:59,439 INFO L290 TraceCheckUtils]: 117: Hoare triple {89460#(<= ~counter~0 13)} assume !(0 == ~cond); {89460#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:59,439 INFO L290 TraceCheckUtils]: 118: Hoare triple {89460#(<= ~counter~0 13)} assume true; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:59,440 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89460#(<= ~counter~0 13)} {89460#(<= ~counter~0 13)} #98#return; {89460#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:59,440 INFO L290 TraceCheckUtils]: 120: Hoare triple {89460#(<= ~counter~0 13)} assume !(~r~0 < 0); {89460#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:59,441 INFO L290 TraceCheckUtils]: 121: Hoare triple {89460#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89485#(<= |main_#t~post6| 13)} is VALID [2022-04-08 06:05:59,441 INFO L290 TraceCheckUtils]: 122: Hoare triple {89485#(<= |main_#t~post6| 13)} assume !(#t~post6 < 50);havoc #t~post6; {89104#false} is VALID [2022-04-08 06:05:59,441 INFO L272 TraceCheckUtils]: 123: Hoare triple {89104#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)); {89104#false} is VALID [2022-04-08 06:05:59,441 INFO L290 TraceCheckUtils]: 124: Hoare triple {89104#false} ~cond := #in~cond; {89104#false} is VALID [2022-04-08 06:05:59,441 INFO L290 TraceCheckUtils]: 125: Hoare triple {89104#false} assume 0 == ~cond; {89104#false} is VALID [2022-04-08 06:05:59,441 INFO L290 TraceCheckUtils]: 126: Hoare triple {89104#false} assume !false; {89104#false} is VALID [2022-04-08 06:05:59,442 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-08 06:05:59,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:06:00,181 INFO L290 TraceCheckUtils]: 126: Hoare triple {89104#false} assume !false; {89104#false} is VALID [2022-04-08 06:06:00,181 INFO L290 TraceCheckUtils]: 125: Hoare triple {89104#false} assume 0 == ~cond; {89104#false} is VALID [2022-04-08 06:06:00,181 INFO L290 TraceCheckUtils]: 124: Hoare triple {89104#false} ~cond := #in~cond; {89104#false} is VALID [2022-04-08 06:06:00,182 INFO L272 TraceCheckUtils]: 123: Hoare triple {89104#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)); {89104#false} is VALID [2022-04-08 06:06:00,182 INFO L290 TraceCheckUtils]: 122: Hoare triple {89513#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {89104#false} is VALID [2022-04-08 06:06:00,182 INFO L290 TraceCheckUtils]: 121: Hoare triple {89517#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89513#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:06:00,182 INFO L290 TraceCheckUtils]: 120: Hoare triple {89517#(< ~counter~0 50)} assume !(~r~0 < 0); {89517#(< ~counter~0 50)} is VALID [2022-04-08 06:06:00,183 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89103#true} {89517#(< ~counter~0 50)} #98#return; {89517#(< ~counter~0 50)} is VALID [2022-04-08 06:06:00,183 INFO L290 TraceCheckUtils]: 118: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,183 INFO L290 TraceCheckUtils]: 117: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,183 INFO L290 TraceCheckUtils]: 116: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,183 INFO L272 TraceCheckUtils]: 115: Hoare triple {89517#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,183 INFO L290 TraceCheckUtils]: 114: Hoare triple {89517#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {89517#(< ~counter~0 50)} is VALID [2022-04-08 06:06:00,185 INFO L290 TraceCheckUtils]: 113: Hoare triple {89542#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89517#(< ~counter~0 50)} is VALID [2022-04-08 06:06:00,186 INFO L290 TraceCheckUtils]: 112: Hoare triple {89542#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89542#(< ~counter~0 49)} is VALID [2022-04-08 06:06:00,186 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89103#true} {89542#(< ~counter~0 49)} #98#return; {89542#(< ~counter~0 49)} is VALID [2022-04-08 06:06:00,186 INFO L290 TraceCheckUtils]: 110: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,186 INFO L290 TraceCheckUtils]: 109: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,186 INFO L290 TraceCheckUtils]: 108: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,186 INFO L272 TraceCheckUtils]: 107: Hoare triple {89542#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,187 INFO L290 TraceCheckUtils]: 106: Hoare triple {89542#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {89542#(< ~counter~0 49)} is VALID [2022-04-08 06:06:00,188 INFO L290 TraceCheckUtils]: 105: Hoare triple {89567#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89542#(< ~counter~0 49)} is VALID [2022-04-08 06:06:00,188 INFO L290 TraceCheckUtils]: 104: Hoare triple {89567#(< ~counter~0 48)} assume !(~r~0 > 0); {89567#(< ~counter~0 48)} is VALID [2022-04-08 06:06:00,188 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89103#true} {89567#(< ~counter~0 48)} #96#return; {89567#(< ~counter~0 48)} is VALID [2022-04-08 06:06:00,188 INFO L290 TraceCheckUtils]: 102: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,188 INFO L290 TraceCheckUtils]: 101: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,189 INFO L290 TraceCheckUtils]: 100: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,189 INFO L272 TraceCheckUtils]: 99: Hoare triple {89567#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,189 INFO L290 TraceCheckUtils]: 98: Hoare triple {89567#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {89567#(< ~counter~0 48)} is VALID [2022-04-08 06:06:00,190 INFO L290 TraceCheckUtils]: 97: Hoare triple {89592#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89567#(< ~counter~0 48)} is VALID [2022-04-08 06:06:00,190 INFO L290 TraceCheckUtils]: 96: Hoare triple {89592#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89592#(< ~counter~0 47)} is VALID [2022-04-08 06:06:00,190 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89103#true} {89592#(< ~counter~0 47)} #96#return; {89592#(< ~counter~0 47)} is VALID [2022-04-08 06:06:00,191 INFO L290 TraceCheckUtils]: 94: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,191 INFO L290 TraceCheckUtils]: 93: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,191 INFO L290 TraceCheckUtils]: 92: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,191 INFO L272 TraceCheckUtils]: 91: Hoare triple {89592#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,191 INFO L290 TraceCheckUtils]: 90: Hoare triple {89592#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {89592#(< ~counter~0 47)} is VALID [2022-04-08 06:06:00,192 INFO L290 TraceCheckUtils]: 89: Hoare triple {89617#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89592#(< ~counter~0 47)} is VALID [2022-04-08 06:06:00,192 INFO L290 TraceCheckUtils]: 88: Hoare triple {89617#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89617#(< ~counter~0 46)} is VALID [2022-04-08 06:06:00,193 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89103#true} {89617#(< ~counter~0 46)} #96#return; {89617#(< ~counter~0 46)} is VALID [2022-04-08 06:06:00,193 INFO L290 TraceCheckUtils]: 86: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,193 INFO L290 TraceCheckUtils]: 85: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,193 INFO L290 TraceCheckUtils]: 84: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,193 INFO L272 TraceCheckUtils]: 83: Hoare triple {89617#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,193 INFO L290 TraceCheckUtils]: 82: Hoare triple {89617#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {89617#(< ~counter~0 46)} is VALID [2022-04-08 06:06:00,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {89642#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89617#(< ~counter~0 46)} is VALID [2022-04-08 06:06:00,194 INFO L290 TraceCheckUtils]: 80: Hoare triple {89642#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89642#(< ~counter~0 45)} is VALID [2022-04-08 06:06:00,195 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89103#true} {89642#(< ~counter~0 45)} #96#return; {89642#(< ~counter~0 45)} is VALID [2022-04-08 06:06:00,195 INFO L290 TraceCheckUtils]: 78: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,195 INFO L290 TraceCheckUtils]: 77: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,195 INFO L272 TraceCheckUtils]: 75: Hoare triple {89642#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,195 INFO L290 TraceCheckUtils]: 74: Hoare triple {89642#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {89642#(< ~counter~0 45)} is VALID [2022-04-08 06:06:00,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {89667#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89642#(< ~counter~0 45)} is VALID [2022-04-08 06:06:00,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {89667#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89667#(< ~counter~0 44)} is VALID [2022-04-08 06:06:00,197 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89103#true} {89667#(< ~counter~0 44)} #96#return; {89667#(< ~counter~0 44)} is VALID [2022-04-08 06:06:00,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,197 INFO L272 TraceCheckUtils]: 67: Hoare triple {89667#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,197 INFO L290 TraceCheckUtils]: 66: Hoare triple {89667#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {89667#(< ~counter~0 44)} is VALID [2022-04-08 06:06:00,198 INFO L290 TraceCheckUtils]: 65: Hoare triple {89692#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89667#(< ~counter~0 44)} is VALID [2022-04-08 06:06:00,199 INFO L290 TraceCheckUtils]: 64: Hoare triple {89692#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89692#(< ~counter~0 43)} is VALID [2022-04-08 06:06:00,199 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89103#true} {89692#(< ~counter~0 43)} #96#return; {89692#(< ~counter~0 43)} is VALID [2022-04-08 06:06:00,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,199 INFO L272 TraceCheckUtils]: 59: Hoare triple {89692#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {89692#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {89692#(< ~counter~0 43)} is VALID [2022-04-08 06:06:00,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {89717#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89692#(< ~counter~0 43)} is VALID [2022-04-08 06:06:00,201 INFO L290 TraceCheckUtils]: 56: Hoare triple {89717#(< ~counter~0 42)} assume !!(0 != ~r~0); {89717#(< ~counter~0 42)} is VALID [2022-04-08 06:06:00,201 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89103#true} {89717#(< ~counter~0 42)} #94#return; {89717#(< ~counter~0 42)} is VALID [2022-04-08 06:06:00,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,202 INFO L272 TraceCheckUtils]: 51: Hoare triple {89717#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {89717#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {89717#(< ~counter~0 42)} is VALID [2022-04-08 06:06:00,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {89742#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89717#(< ~counter~0 42)} is VALID [2022-04-08 06:06:00,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {89742#(< ~counter~0 41)} assume !(~r~0 < 0); {89742#(< ~counter~0 41)} is VALID [2022-04-08 06:06:00,203 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89103#true} {89742#(< ~counter~0 41)} #98#return; {89742#(< ~counter~0 41)} is VALID [2022-04-08 06:06:00,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,204 INFO L272 TraceCheckUtils]: 43: Hoare triple {89742#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {89742#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {89742#(< ~counter~0 41)} is VALID [2022-04-08 06:06:00,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {89767#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89742#(< ~counter~0 41)} is VALID [2022-04-08 06:06:00,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {89767#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89767#(< ~counter~0 40)} is VALID [2022-04-08 06:06:00,206 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89103#true} {89767#(< ~counter~0 40)} #98#return; {89767#(< ~counter~0 40)} is VALID [2022-04-08 06:06:00,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,206 INFO L272 TraceCheckUtils]: 35: Hoare triple {89767#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {89767#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {89767#(< ~counter~0 40)} is VALID [2022-04-08 06:06:00,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {89792#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89767#(< ~counter~0 40)} is VALID [2022-04-08 06:06:00,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {89792#(< ~counter~0 39)} assume !(~r~0 > 0); {89792#(< ~counter~0 39)} is VALID [2022-04-08 06:06:00,208 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89103#true} {89792#(< ~counter~0 39)} #96#return; {89792#(< ~counter~0 39)} is VALID [2022-04-08 06:06:00,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,208 INFO L272 TraceCheckUtils]: 27: Hoare triple {89792#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {89792#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {89792#(< ~counter~0 39)} is VALID [2022-04-08 06:06:00,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {89817#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89792#(< ~counter~0 39)} is VALID [2022-04-08 06:06:00,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {89817#(< ~counter~0 38)} assume !!(0 != ~r~0); {89817#(< ~counter~0 38)} is VALID [2022-04-08 06:06:00,210 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89103#true} {89817#(< ~counter~0 38)} #94#return; {89817#(< ~counter~0 38)} is VALID [2022-04-08 06:06:00,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,210 INFO L272 TraceCheckUtils]: 19: Hoare triple {89817#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {89817#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {89817#(< ~counter~0 38)} is VALID [2022-04-08 06:06:00,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {89842#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89817#(< ~counter~0 38)} is VALID [2022-04-08 06:06:00,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {89842#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89842#(< ~counter~0 37)} is VALID [2022-04-08 06:06:00,212 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89103#true} {89842#(< ~counter~0 37)} #92#return; {89842#(< ~counter~0 37)} is VALID [2022-04-08 06:06:00,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,212 INFO L272 TraceCheckUtils]: 11: Hoare triple {89842#(< ~counter~0 37)} 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)); {89103#true} is VALID [2022-04-08 06:06:00,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89103#true} {89842#(< ~counter~0 37)} #90#return; {89842#(< ~counter~0 37)} is VALID [2022-04-08 06:06:00,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-08 06:06:00,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-08 06:06:00,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-08 06:06:00,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {89842#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89103#true} is VALID [2022-04-08 06:06:00,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {89842#(< ~counter~0 37)} 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; {89842#(< ~counter~0 37)} is VALID [2022-04-08 06:06:00,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {89842#(< ~counter~0 37)} call #t~ret9 := main(); {89842#(< ~counter~0 37)} is VALID [2022-04-08 06:06:00,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89842#(< ~counter~0 37)} {89103#true} #102#return; {89842#(< ~counter~0 37)} is VALID [2022-04-08 06:06:00,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {89842#(< ~counter~0 37)} assume true; {89842#(< ~counter~0 37)} is VALID [2022-04-08 06:06:00,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {89103#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89842#(< ~counter~0 37)} is VALID [2022-04-08 06:06:00,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {89103#true} call ULTIMATE.init(); {89103#true} is VALID [2022-04-08 06:06:00,215 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-08 06:06:00,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:06:00,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046599875] [2022-04-08 06:06:00,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:06:00,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524434839] [2022-04-08 06:06:00,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524434839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:06:00,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:06:00,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 06:06:00,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:06:00,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [644638644] [2022-04-08 06:06:00,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [644638644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:06:00,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:06:00,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 06:06:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859347061] [2022-04-08 06:06:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:06:00,216 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-08 06:06:00,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:06:00,216 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-08 06:06:00,327 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-08 06:06:00,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 06:06:00,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 06:06:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 06:06:00,328 INFO L87 Difference]: Start difference. First operand 650 states and 879 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-08 06:06:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:03,652 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2022-04-08 06:06:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 06:06:03,652 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-08 06:06:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:06:03,653 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-08 06:06:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-08 06:06:03,654 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-08 06:06:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-08 06:06:03,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-08 06:06:03,905 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-08 06:06:03,924 INFO L225 Difference]: With dead ends: 705 [2022-04-08 06:06:03,925 INFO L226 Difference]: Without dead ends: 694 [2022-04-08 06:06:03,925 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-08 06:06:03,925 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 186 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:06:03,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 309 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:06:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-08 06:06:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2022-04-08 06:06:05,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:06:05,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:05,920 INFO L74 IsIncluded]: Start isIncluded. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:05,921 INFO L87 Difference]: Start difference. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:05,940 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-08 06:06:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-08 06:06:05,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:06:05,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:06:05,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-08 06:06:05,942 INFO L87 Difference]: Start difference. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-08 06:06:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:05,964 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-08 06:06:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-08 06:06:05,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:06:05,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:06:05,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:06:05,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:06:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 914 transitions. [2022-04-08 06:06:05,987 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 914 transitions. Word has length 127 [2022-04-08 06:06:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:06:05,987 INFO L478 AbstractCegarLoop]: Abstraction has 672 states and 914 transitions. [2022-04-08 06:06:05,987 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-08 06:06:05,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 672 states and 914 transitions. [2022-04-08 06:06:09,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 914 edges. 914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:06:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 914 transitions. [2022-04-08 06:06:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-08 06:06:09,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:06:09,286 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-08 06:06:09,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-08 06:06:09,491 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-08 06:06:09,491 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:06:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:06:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-08 06:06:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:09,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259225877] [2022-04-08 06:06:09,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:06:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-08 06:06:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:06:09,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177722118] [2022-04-08 06:06:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:06:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:06:09,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:06:09,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033047201] [2022-04-08 06:06:09,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:06:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:06:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:06:09,516 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-08 06:06:09,517 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-08 06:06:09,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:06:09,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:06:09,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 06:06:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:06:09,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:06:10,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {94058#true} call ULTIMATE.init(); {94058#true} is VALID [2022-04-08 06:06:10,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {94058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94066#(<= ~counter~0 0)} {94058#true} #102#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {94066#(<= ~counter~0 0)} call #t~ret9 := main(); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {94066#(<= ~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; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {94066#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {94066#(<= ~counter~0 0)} ~cond := #in~cond; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {94066#(<= ~counter~0 0)} assume !(0 == ~cond); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94066#(<= ~counter~0 0)} {94066#(<= ~counter~0 0)} #90#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,283 INFO L272 TraceCheckUtils]: 11: Hoare triple {94066#(<= ~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)); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {94066#(<= ~counter~0 0)} ~cond := #in~cond; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {94066#(<= ~counter~0 0)} assume !(0 == ~cond); {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,284 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94066#(<= ~counter~0 0)} {94066#(<= ~counter~0 0)} #92#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {94066#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94066#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:10,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {94066#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:10,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {94115#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:10,287 INFO L272 TraceCheckUtils]: 19: Hoare triple {94115#(<= ~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)); {94115#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:10,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {94115#(<= ~counter~0 1)} ~cond := #in~cond; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:10,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {94115#(<= ~counter~0 1)} assume !(0 == ~cond); {94115#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:10,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {94115#(<= ~counter~0 1)} assume true; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:10,289 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94115#(<= ~counter~0 1)} {94115#(<= ~counter~0 1)} #94#return; {94115#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:10,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {94115#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94115#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:10,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {94115#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:10,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {94140#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:10,291 INFO L272 TraceCheckUtils]: 27: Hoare triple {94140#(<= ~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)); {94140#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:10,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {94140#(<= ~counter~0 2)} ~cond := #in~cond; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:10,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {94140#(<= ~counter~0 2)} assume !(0 == ~cond); {94140#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:10,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {94140#(<= ~counter~0 2)} assume true; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:10,292 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94140#(<= ~counter~0 2)} {94140#(<= ~counter~0 2)} #96#return; {94140#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:10,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {94140#(<= ~counter~0 2)} assume !(~r~0 > 0); {94140#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:10,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {94140#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:10,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {94165#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:10,294 INFO L272 TraceCheckUtils]: 35: Hoare triple {94165#(<= ~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)); {94165#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:10,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {94165#(<= ~counter~0 3)} ~cond := #in~cond; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:10,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {94165#(<= ~counter~0 3)} assume !(0 == ~cond); {94165#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:10,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {94165#(<= ~counter~0 3)} assume true; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:10,295 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94165#(<= ~counter~0 3)} {94165#(<= ~counter~0 3)} #98#return; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:10,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {94165#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94165#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:10,296 INFO L290 TraceCheckUtils]: 41: Hoare triple {94165#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:10,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {94190#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:10,297 INFO L272 TraceCheckUtils]: 43: Hoare triple {94190#(<= ~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)); {94190#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:10,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {94190#(<= ~counter~0 4)} ~cond := #in~cond; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:10,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {94190#(<= ~counter~0 4)} assume !(0 == ~cond); {94190#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:10,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {94190#(<= ~counter~0 4)} assume true; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:10,298 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94190#(<= ~counter~0 4)} {94190#(<= ~counter~0 4)} #98#return; {94190#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:10,298 INFO L290 TraceCheckUtils]: 48: Hoare triple {94190#(<= ~counter~0 4)} assume !(~r~0 < 0); {94190#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:10,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {94190#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:10,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {94215#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:10,300 INFO L272 TraceCheckUtils]: 51: Hoare triple {94215#(<= ~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)); {94215#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:10,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {94215#(<= ~counter~0 5)} ~cond := #in~cond; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:10,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {94215#(<= ~counter~0 5)} assume !(0 == ~cond); {94215#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:10,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {94215#(<= ~counter~0 5)} assume true; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:10,301 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94215#(<= ~counter~0 5)} {94215#(<= ~counter~0 5)} #94#return; {94215#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:10,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {94215#(<= ~counter~0 5)} assume !!(0 != ~r~0); {94215#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:10,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {94215#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:10,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {94240#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:10,303 INFO L272 TraceCheckUtils]: 59: Hoare triple {94240#(<= ~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)); {94240#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:10,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {94240#(<= ~counter~0 6)} ~cond := #in~cond; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:10,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {94240#(<= ~counter~0 6)} assume !(0 == ~cond); {94240#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:10,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {94240#(<= ~counter~0 6)} assume true; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:10,304 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94240#(<= ~counter~0 6)} {94240#(<= ~counter~0 6)} #96#return; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:10,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {94240#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94240#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:10,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {94240#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:10,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {94265#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:10,306 INFO L272 TraceCheckUtils]: 67: Hoare triple {94265#(<= ~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)); {94265#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:10,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {94265#(<= ~counter~0 7)} ~cond := #in~cond; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:10,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {94265#(<= ~counter~0 7)} assume !(0 == ~cond); {94265#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:10,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {94265#(<= ~counter~0 7)} assume true; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:10,308 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94265#(<= ~counter~0 7)} {94265#(<= ~counter~0 7)} #96#return; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:10,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {94265#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94265#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:10,309 INFO L290 TraceCheckUtils]: 73: Hoare triple {94265#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:10,309 INFO L290 TraceCheckUtils]: 74: Hoare triple {94290#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:10,309 INFO L272 TraceCheckUtils]: 75: Hoare triple {94290#(<= ~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)); {94290#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:10,310 INFO L290 TraceCheckUtils]: 76: Hoare triple {94290#(<= ~counter~0 8)} ~cond := #in~cond; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:10,310 INFO L290 TraceCheckUtils]: 77: Hoare triple {94290#(<= ~counter~0 8)} assume !(0 == ~cond); {94290#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:10,310 INFO L290 TraceCheckUtils]: 78: Hoare triple {94290#(<= ~counter~0 8)} assume true; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:10,311 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94290#(<= ~counter~0 8)} {94290#(<= ~counter~0 8)} #96#return; {94290#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:10,311 INFO L290 TraceCheckUtils]: 80: Hoare triple {94290#(<= ~counter~0 8)} assume !(~r~0 > 0); {94290#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:10,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {94290#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:10,312 INFO L290 TraceCheckUtils]: 82: Hoare triple {94315#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:10,313 INFO L272 TraceCheckUtils]: 83: Hoare triple {94315#(<= ~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)); {94315#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:10,313 INFO L290 TraceCheckUtils]: 84: Hoare triple {94315#(<= ~counter~0 9)} ~cond := #in~cond; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:10,313 INFO L290 TraceCheckUtils]: 85: Hoare triple {94315#(<= ~counter~0 9)} assume !(0 == ~cond); {94315#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:10,313 INFO L290 TraceCheckUtils]: 86: Hoare triple {94315#(<= ~counter~0 9)} assume true; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:10,314 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94315#(<= ~counter~0 9)} {94315#(<= ~counter~0 9)} #98#return; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:10,314 INFO L290 TraceCheckUtils]: 88: Hoare triple {94315#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94315#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:10,315 INFO L290 TraceCheckUtils]: 89: Hoare triple {94315#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:10,315 INFO L290 TraceCheckUtils]: 90: Hoare triple {94340#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:10,316 INFO L272 TraceCheckUtils]: 91: Hoare triple {94340#(<= ~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)); {94340#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:10,316 INFO L290 TraceCheckUtils]: 92: Hoare triple {94340#(<= ~counter~0 10)} ~cond := #in~cond; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:10,316 INFO L290 TraceCheckUtils]: 93: Hoare triple {94340#(<= ~counter~0 10)} assume !(0 == ~cond); {94340#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:10,316 INFO L290 TraceCheckUtils]: 94: Hoare triple {94340#(<= ~counter~0 10)} assume true; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:10,317 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94340#(<= ~counter~0 10)} {94340#(<= ~counter~0 10)} #98#return; {94340#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:10,317 INFO L290 TraceCheckUtils]: 96: Hoare triple {94340#(<= ~counter~0 10)} assume !(~r~0 < 0); {94340#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:10,318 INFO L290 TraceCheckUtils]: 97: Hoare triple {94340#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:10,318 INFO L290 TraceCheckUtils]: 98: Hoare triple {94365#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:10,319 INFO L272 TraceCheckUtils]: 99: Hoare triple {94365#(<= ~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)); {94365#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:10,319 INFO L290 TraceCheckUtils]: 100: Hoare triple {94365#(<= ~counter~0 11)} ~cond := #in~cond; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:10,319 INFO L290 TraceCheckUtils]: 101: Hoare triple {94365#(<= ~counter~0 11)} assume !(0 == ~cond); {94365#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:10,320 INFO L290 TraceCheckUtils]: 102: Hoare triple {94365#(<= ~counter~0 11)} assume true; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:10,320 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94365#(<= ~counter~0 11)} {94365#(<= ~counter~0 11)} #94#return; {94365#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:10,320 INFO L290 TraceCheckUtils]: 104: Hoare triple {94365#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94365#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:10,321 INFO L290 TraceCheckUtils]: 105: Hoare triple {94365#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:10,322 INFO L290 TraceCheckUtils]: 106: Hoare triple {94390#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:10,322 INFO L272 TraceCheckUtils]: 107: Hoare triple {94390#(<= ~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)); {94390#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:10,322 INFO L290 TraceCheckUtils]: 108: Hoare triple {94390#(<= ~counter~0 12)} ~cond := #in~cond; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:10,323 INFO L290 TraceCheckUtils]: 109: Hoare triple {94390#(<= ~counter~0 12)} assume !(0 == ~cond); {94390#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:10,323 INFO L290 TraceCheckUtils]: 110: Hoare triple {94390#(<= ~counter~0 12)} assume true; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:10,323 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94390#(<= ~counter~0 12)} {94390#(<= ~counter~0 12)} #96#return; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:10,324 INFO L290 TraceCheckUtils]: 112: Hoare triple {94390#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94390#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:10,324 INFO L290 TraceCheckUtils]: 113: Hoare triple {94390#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:10,325 INFO L290 TraceCheckUtils]: 114: Hoare triple {94415#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:10,325 INFO L272 TraceCheckUtils]: 115: Hoare triple {94415#(<= ~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)); {94415#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:10,325 INFO L290 TraceCheckUtils]: 116: Hoare triple {94415#(<= ~counter~0 13)} ~cond := #in~cond; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:10,326 INFO L290 TraceCheckUtils]: 117: Hoare triple {94415#(<= ~counter~0 13)} assume !(0 == ~cond); {94415#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:10,326 INFO L290 TraceCheckUtils]: 118: Hoare triple {94415#(<= ~counter~0 13)} assume true; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:10,326 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94415#(<= ~counter~0 13)} {94415#(<= ~counter~0 13)} #96#return; {94415#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:10,327 INFO L290 TraceCheckUtils]: 120: Hoare triple {94415#(<= ~counter~0 13)} assume !(~r~0 > 0); {94415#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:10,327 INFO L290 TraceCheckUtils]: 121: Hoare triple {94415#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94440#(<= |main_#t~post8| 13)} is VALID [2022-04-08 06:06:10,327 INFO L290 TraceCheckUtils]: 122: Hoare triple {94440#(<= |main_#t~post8| 13)} assume !(#t~post8 < 50);havoc #t~post8; {94059#false} is VALID [2022-04-08 06:06:10,327 INFO L290 TraceCheckUtils]: 123: Hoare triple {94059#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94059#false} is VALID [2022-04-08 06:06:10,327 INFO L290 TraceCheckUtils]: 124: Hoare triple {94059#false} assume !(#t~post6 < 50);havoc #t~post6; {94059#false} is VALID [2022-04-08 06:06:10,328 INFO L272 TraceCheckUtils]: 125: Hoare triple {94059#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)); {94059#false} is VALID [2022-04-08 06:06:10,328 INFO L290 TraceCheckUtils]: 126: Hoare triple {94059#false} ~cond := #in~cond; {94059#false} is VALID [2022-04-08 06:06:10,328 INFO L290 TraceCheckUtils]: 127: Hoare triple {94059#false} assume 0 == ~cond; {94059#false} is VALID [2022-04-08 06:06:10,328 INFO L290 TraceCheckUtils]: 128: Hoare triple {94059#false} assume !false; {94059#false} is VALID [2022-04-08 06:06:10,328 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-08 06:06:10,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:06:11,096 INFO L290 TraceCheckUtils]: 128: Hoare triple {94059#false} assume !false; {94059#false} is VALID [2022-04-08 06:06:11,097 INFO L290 TraceCheckUtils]: 127: Hoare triple {94059#false} assume 0 == ~cond; {94059#false} is VALID [2022-04-08 06:06:11,097 INFO L290 TraceCheckUtils]: 126: Hoare triple {94059#false} ~cond := #in~cond; {94059#false} is VALID [2022-04-08 06:06:11,097 INFO L272 TraceCheckUtils]: 125: Hoare triple {94059#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)); {94059#false} is VALID [2022-04-08 06:06:11,097 INFO L290 TraceCheckUtils]: 124: Hoare triple {94059#false} assume !(#t~post6 < 50);havoc #t~post6; {94059#false} is VALID [2022-04-08 06:06:11,097 INFO L290 TraceCheckUtils]: 123: Hoare triple {94059#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94059#false} is VALID [2022-04-08 06:06:11,097 INFO L290 TraceCheckUtils]: 122: Hoare triple {94480#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {94059#false} is VALID [2022-04-08 06:06:11,098 INFO L290 TraceCheckUtils]: 121: Hoare triple {94484#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94480#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:06:11,098 INFO L290 TraceCheckUtils]: 120: Hoare triple {94484#(< ~counter~0 50)} assume !(~r~0 > 0); {94484#(< ~counter~0 50)} is VALID [2022-04-08 06:06:11,098 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94058#true} {94484#(< ~counter~0 50)} #96#return; {94484#(< ~counter~0 50)} is VALID [2022-04-08 06:06:11,098 INFO L290 TraceCheckUtils]: 118: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,099 INFO L290 TraceCheckUtils]: 117: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,099 INFO L290 TraceCheckUtils]: 116: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,099 INFO L272 TraceCheckUtils]: 115: Hoare triple {94484#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,099 INFO L290 TraceCheckUtils]: 114: Hoare triple {94484#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {94484#(< ~counter~0 50)} is VALID [2022-04-08 06:06:11,101 INFO L290 TraceCheckUtils]: 113: Hoare triple {94509#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94484#(< ~counter~0 50)} is VALID [2022-04-08 06:06:11,101 INFO L290 TraceCheckUtils]: 112: Hoare triple {94509#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94509#(< ~counter~0 49)} is VALID [2022-04-08 06:06:11,102 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94058#true} {94509#(< ~counter~0 49)} #96#return; {94509#(< ~counter~0 49)} is VALID [2022-04-08 06:06:11,102 INFO L290 TraceCheckUtils]: 110: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,102 INFO L290 TraceCheckUtils]: 109: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,102 INFO L290 TraceCheckUtils]: 108: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,102 INFO L272 TraceCheckUtils]: 107: Hoare triple {94509#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,102 INFO L290 TraceCheckUtils]: 106: Hoare triple {94509#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {94509#(< ~counter~0 49)} is VALID [2022-04-08 06:06:11,103 INFO L290 TraceCheckUtils]: 105: Hoare triple {94534#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94509#(< ~counter~0 49)} is VALID [2022-04-08 06:06:11,103 INFO L290 TraceCheckUtils]: 104: Hoare triple {94534#(< ~counter~0 48)} assume !!(0 != ~r~0); {94534#(< ~counter~0 48)} is VALID [2022-04-08 06:06:11,104 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94058#true} {94534#(< ~counter~0 48)} #94#return; {94534#(< ~counter~0 48)} is VALID [2022-04-08 06:06:11,104 INFO L290 TraceCheckUtils]: 102: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,104 INFO L290 TraceCheckUtils]: 101: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,104 INFO L290 TraceCheckUtils]: 100: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,104 INFO L272 TraceCheckUtils]: 99: Hoare triple {94534#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,104 INFO L290 TraceCheckUtils]: 98: Hoare triple {94534#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {94534#(< ~counter~0 48)} is VALID [2022-04-08 06:06:11,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {94559#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94534#(< ~counter~0 48)} is VALID [2022-04-08 06:06:11,106 INFO L290 TraceCheckUtils]: 96: Hoare triple {94559#(< ~counter~0 47)} assume !(~r~0 < 0); {94559#(< ~counter~0 47)} is VALID [2022-04-08 06:06:11,106 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94058#true} {94559#(< ~counter~0 47)} #98#return; {94559#(< ~counter~0 47)} is VALID [2022-04-08 06:06:11,106 INFO L290 TraceCheckUtils]: 94: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,106 INFO L290 TraceCheckUtils]: 93: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,106 INFO L290 TraceCheckUtils]: 92: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,106 INFO L272 TraceCheckUtils]: 91: Hoare triple {94559#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,107 INFO L290 TraceCheckUtils]: 90: Hoare triple {94559#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {94559#(< ~counter~0 47)} is VALID [2022-04-08 06:06:11,108 INFO L290 TraceCheckUtils]: 89: Hoare triple {94584#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94559#(< ~counter~0 47)} is VALID [2022-04-08 06:06:11,108 INFO L290 TraceCheckUtils]: 88: Hoare triple {94584#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94584#(< ~counter~0 46)} is VALID [2022-04-08 06:06:11,108 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94058#true} {94584#(< ~counter~0 46)} #98#return; {94584#(< ~counter~0 46)} is VALID [2022-04-08 06:06:11,108 INFO L290 TraceCheckUtils]: 86: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,109 INFO L290 TraceCheckUtils]: 84: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,109 INFO L272 TraceCheckUtils]: 83: Hoare triple {94584#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {94584#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {94584#(< ~counter~0 46)} is VALID [2022-04-08 06:06:11,110 INFO L290 TraceCheckUtils]: 81: Hoare triple {94609#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94584#(< ~counter~0 46)} is VALID [2022-04-08 06:06:11,110 INFO L290 TraceCheckUtils]: 80: Hoare triple {94609#(< ~counter~0 45)} assume !(~r~0 > 0); {94609#(< ~counter~0 45)} is VALID [2022-04-08 06:06:11,111 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94058#true} {94609#(< ~counter~0 45)} #96#return; {94609#(< ~counter~0 45)} is VALID [2022-04-08 06:06:11,111 INFO L290 TraceCheckUtils]: 78: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,111 INFO L290 TraceCheckUtils]: 77: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,111 INFO L290 TraceCheckUtils]: 76: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,111 INFO L272 TraceCheckUtils]: 75: Hoare triple {94609#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,111 INFO L290 TraceCheckUtils]: 74: Hoare triple {94609#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {94609#(< ~counter~0 45)} is VALID [2022-04-08 06:06:11,112 INFO L290 TraceCheckUtils]: 73: Hoare triple {94634#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94609#(< ~counter~0 45)} is VALID [2022-04-08 06:06:11,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {94634#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94634#(< ~counter~0 44)} is VALID [2022-04-08 06:06:11,113 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94058#true} {94634#(< ~counter~0 44)} #96#return; {94634#(< ~counter~0 44)} is VALID [2022-04-08 06:06:11,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,113 INFO L272 TraceCheckUtils]: 67: Hoare triple {94634#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {94634#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {94634#(< ~counter~0 44)} is VALID [2022-04-08 06:06:11,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {94659#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94634#(< ~counter~0 44)} is VALID [2022-04-08 06:06:11,114 INFO L290 TraceCheckUtils]: 64: Hoare triple {94659#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94659#(< ~counter~0 43)} is VALID [2022-04-08 06:06:11,115 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94058#true} {94659#(< ~counter~0 43)} #96#return; {94659#(< ~counter~0 43)} is VALID [2022-04-08 06:06:11,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,115 INFO L272 TraceCheckUtils]: 59: Hoare triple {94659#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,116 INFO L290 TraceCheckUtils]: 58: Hoare triple {94659#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {94659#(< ~counter~0 43)} is VALID [2022-04-08 06:06:11,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {94684#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94659#(< ~counter~0 43)} is VALID [2022-04-08 06:06:11,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {94684#(< ~counter~0 42)} assume !!(0 != ~r~0); {94684#(< ~counter~0 42)} is VALID [2022-04-08 06:06:11,117 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94058#true} {94684#(< ~counter~0 42)} #94#return; {94684#(< ~counter~0 42)} is VALID [2022-04-08 06:06:11,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,117 INFO L272 TraceCheckUtils]: 51: Hoare triple {94684#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,118 INFO L290 TraceCheckUtils]: 50: Hoare triple {94684#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {94684#(< ~counter~0 42)} is VALID [2022-04-08 06:06:11,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {94709#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94684#(< ~counter~0 42)} is VALID [2022-04-08 06:06:11,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {94709#(< ~counter~0 41)} assume !(~r~0 < 0); {94709#(< ~counter~0 41)} is VALID [2022-04-08 06:06:11,119 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94058#true} {94709#(< ~counter~0 41)} #98#return; {94709#(< ~counter~0 41)} is VALID [2022-04-08 06:06:11,119 INFO L290 TraceCheckUtils]: 46: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,120 INFO L272 TraceCheckUtils]: 43: Hoare triple {94709#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {94709#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {94709#(< ~counter~0 41)} is VALID [2022-04-08 06:06:11,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {94734#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94709#(< ~counter~0 41)} is VALID [2022-04-08 06:06:11,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {94734#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94734#(< ~counter~0 40)} is VALID [2022-04-08 06:06:11,122 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94058#true} {94734#(< ~counter~0 40)} #98#return; {94734#(< ~counter~0 40)} is VALID [2022-04-08 06:06:11,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,122 INFO L272 TraceCheckUtils]: 35: Hoare triple {94734#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {94734#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {94734#(< ~counter~0 40)} is VALID [2022-04-08 06:06:11,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {94759#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94734#(< ~counter~0 40)} is VALID [2022-04-08 06:06:11,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {94759#(< ~counter~0 39)} assume !(~r~0 > 0); {94759#(< ~counter~0 39)} is VALID [2022-04-08 06:06:11,124 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94058#true} {94759#(< ~counter~0 39)} #96#return; {94759#(< ~counter~0 39)} is VALID [2022-04-08 06:06:11,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,124 INFO L272 TraceCheckUtils]: 27: Hoare triple {94759#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {94759#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {94759#(< ~counter~0 39)} is VALID [2022-04-08 06:06:11,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {94784#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94759#(< ~counter~0 39)} is VALID [2022-04-08 06:06:11,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {94784#(< ~counter~0 38)} assume !!(0 != ~r~0); {94784#(< ~counter~0 38)} is VALID [2022-04-08 06:06:11,126 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94058#true} {94784#(< ~counter~0 38)} #94#return; {94784#(< ~counter~0 38)} is VALID [2022-04-08 06:06:11,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,126 INFO L272 TraceCheckUtils]: 19: Hoare triple {94784#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {94784#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {94784#(< ~counter~0 38)} is VALID [2022-04-08 06:06:11,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {94809#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94784#(< ~counter~0 38)} is VALID [2022-04-08 06:06:11,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {94809#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94809#(< ~counter~0 37)} is VALID [2022-04-08 06:06:11,128 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94058#true} {94809#(< ~counter~0 37)} #92#return; {94809#(< ~counter~0 37)} is VALID [2022-04-08 06:06:11,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,128 INFO L272 TraceCheckUtils]: 11: Hoare triple {94809#(< ~counter~0 37)} 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)); {94058#true} is VALID [2022-04-08 06:06:11,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94058#true} {94809#(< ~counter~0 37)} #90#return; {94809#(< ~counter~0 37)} is VALID [2022-04-08 06:06:11,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-08 06:06:11,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-08 06:06:11,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-08 06:06:11,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {94809#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94058#true} is VALID [2022-04-08 06:06:11,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {94809#(< ~counter~0 37)} 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; {94809#(< ~counter~0 37)} is VALID [2022-04-08 06:06:11,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {94809#(< ~counter~0 37)} call #t~ret9 := main(); {94809#(< ~counter~0 37)} is VALID [2022-04-08 06:06:11,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94809#(< ~counter~0 37)} {94058#true} #102#return; {94809#(< ~counter~0 37)} is VALID [2022-04-08 06:06:11,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {94809#(< ~counter~0 37)} assume true; {94809#(< ~counter~0 37)} is VALID [2022-04-08 06:06:11,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {94058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94809#(< ~counter~0 37)} is VALID [2022-04-08 06:06:11,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {94058#true} call ULTIMATE.init(); {94058#true} is VALID [2022-04-08 06:06:11,131 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-08 06:06:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:06:11,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177722118] [2022-04-08 06:06:11,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:06:11,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033047201] [2022-04-08 06:06:11,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033047201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:06:11,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:06:11,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 06:06:11,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:06:11,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259225877] [2022-04-08 06:06:11,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259225877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:06:11,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:06:11,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 06:06:11,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650474006] [2022-04-08 06:06:11,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:06:11,133 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-08 06:06:11,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:06:11,133 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-08 06:06:11,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:06:11,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 06:06:11,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:11,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 06:06:11,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 06:06:11,249 INFO L87 Difference]: Start difference. First operand 672 states and 914 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-08 06:06:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:14,808 INFO L93 Difference]: Finished difference Result 893 states and 1247 transitions. [2022-04-08 06:06:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 06:06:14,808 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-08 06:06:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:06:14,808 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-08 06:06:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-08 06:06:14,810 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-08 06:06:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-08 06:06:14,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-08 06:06:15,148 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-08 06:06:15,174 INFO L225 Difference]: With dead ends: 893 [2022-04-08 06:06:15,174 INFO L226 Difference]: Without dead ends: 700 [2022-04-08 06:06:15,175 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-08 06:06:15,176 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 216 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:06:15,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 292 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:06:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-04-08 06:06:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 690. [2022-04-08 06:06:17,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:06:17,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:17,305 INFO L74 IsIncluded]: Start isIncluded. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:17,307 INFO L87 Difference]: Start difference. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:17,324 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-08 06:06:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-08 06:06:17,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:06:17,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:06:17,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-08 06:06:17,326 INFO L87 Difference]: Start difference. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-08 06:06:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:17,343 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-08 06:06:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-08 06:06:17,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:06:17,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:06:17,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:06:17,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:06:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 936 transitions. [2022-04-08 06:06:17,366 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 936 transitions. Word has length 129 [2022-04-08 06:06:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:06:17,367 INFO L478 AbstractCegarLoop]: Abstraction has 690 states and 936 transitions. [2022-04-08 06:06:17,367 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-08 06:06:17,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 690 states and 936 transitions. [2022-04-08 06:06:22,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 936 edges. 935 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:06:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 936 transitions. [2022-04-08 06:06:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 06:06:22,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:06:22,803 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-08 06:06:22,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-08 06:06:23,011 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-08 06:06:23,011 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:06:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:06:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-08 06:06:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:23,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1132986376] [2022-04-08 06:06:23,012 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:06:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-08 06:06:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:06:23,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814694617] [2022-04-08 06:06:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:06:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:06:23,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:06:23,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266457866] [2022-04-08 06:06:23,026 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:06:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:06:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:06:23,027 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-08 06:06:23,030 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-08 06:06:23,206 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:06:23,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:06:23,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 06:06:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:06:23,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:06:23,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {99451#true} call ULTIMATE.init(); {99451#true} is VALID [2022-04-08 06:06:23,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {99451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99459#(<= ~counter~0 0)} {99451#true} #102#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {99459#(<= ~counter~0 0)} call #t~ret9 := main(); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {99459#(<= ~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; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {99459#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {99459#(<= ~counter~0 0)} ~cond := #in~cond; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {99459#(<= ~counter~0 0)} assume !(0 == ~cond); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99459#(<= ~counter~0 0)} {99459#(<= ~counter~0 0)} #90#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,871 INFO L272 TraceCheckUtils]: 11: Hoare triple {99459#(<= ~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)); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {99459#(<= ~counter~0 0)} ~cond := #in~cond; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {99459#(<= ~counter~0 0)} assume !(0 == ~cond); {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,872 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99459#(<= ~counter~0 0)} {99459#(<= ~counter~0 0)} #92#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {99459#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {99459#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:23,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {99459#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:23,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {99508#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:23,875 INFO L272 TraceCheckUtils]: 19: Hoare triple {99508#(<= ~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)); {99508#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:23,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {99508#(<= ~counter~0 1)} ~cond := #in~cond; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:23,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {99508#(<= ~counter~0 1)} assume !(0 == ~cond); {99508#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:23,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {99508#(<= ~counter~0 1)} assume true; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:23,876 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99508#(<= ~counter~0 1)} {99508#(<= ~counter~0 1)} #94#return; {99508#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:23,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {99508#(<= ~counter~0 1)} assume !!(0 != ~r~0); {99508#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:23,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {99508#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:23,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {99533#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:23,878 INFO L272 TraceCheckUtils]: 27: Hoare triple {99533#(<= ~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)); {99533#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:23,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {99533#(<= ~counter~0 2)} ~cond := #in~cond; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:23,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {99533#(<= ~counter~0 2)} assume !(0 == ~cond); {99533#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:23,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {99533#(<= ~counter~0 2)} assume true; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:23,880 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99533#(<= ~counter~0 2)} {99533#(<= ~counter~0 2)} #96#return; {99533#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:23,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {99533#(<= ~counter~0 2)} assume !(~r~0 > 0); {99533#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:23,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {99533#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:23,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {99558#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:23,882 INFO L272 TraceCheckUtils]: 35: Hoare triple {99558#(<= ~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)); {99558#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:23,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {99558#(<= ~counter~0 3)} ~cond := #in~cond; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:23,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {99558#(<= ~counter~0 3)} assume !(0 == ~cond); {99558#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:23,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {99558#(<= ~counter~0 3)} assume true; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:23,883 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99558#(<= ~counter~0 3)} {99558#(<= ~counter~0 3)} #98#return; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:23,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {99558#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99558#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:23,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {99558#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:23,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {99583#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:23,885 INFO L272 TraceCheckUtils]: 43: Hoare triple {99583#(<= ~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)); {99583#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:23,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {99583#(<= ~counter~0 4)} ~cond := #in~cond; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:23,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {99583#(<= ~counter~0 4)} assume !(0 == ~cond); {99583#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:23,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {99583#(<= ~counter~0 4)} assume true; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:23,886 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99583#(<= ~counter~0 4)} {99583#(<= ~counter~0 4)} #98#return; {99583#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:23,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {99583#(<= ~counter~0 4)} assume !(~r~0 < 0); {99583#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:23,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {99583#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:23,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {99608#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:23,888 INFO L272 TraceCheckUtils]: 51: Hoare triple {99608#(<= ~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)); {99608#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:23,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {99608#(<= ~counter~0 5)} ~cond := #in~cond; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:23,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {99608#(<= ~counter~0 5)} assume !(0 == ~cond); {99608#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:23,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {99608#(<= ~counter~0 5)} assume true; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:23,890 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99608#(<= ~counter~0 5)} {99608#(<= ~counter~0 5)} #94#return; {99608#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:23,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {99608#(<= ~counter~0 5)} assume !!(0 != ~r~0); {99608#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:23,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {99608#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:23,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {99633#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:23,892 INFO L272 TraceCheckUtils]: 59: Hoare triple {99633#(<= ~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)); {99633#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:23,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {99633#(<= ~counter~0 6)} ~cond := #in~cond; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:23,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {99633#(<= ~counter~0 6)} assume !(0 == ~cond); {99633#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:23,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {99633#(<= ~counter~0 6)} assume true; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:23,893 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99633#(<= ~counter~0 6)} {99633#(<= ~counter~0 6)} #96#return; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:23,893 INFO L290 TraceCheckUtils]: 64: Hoare triple {99633#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99633#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:23,894 INFO L290 TraceCheckUtils]: 65: Hoare triple {99633#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:23,894 INFO L290 TraceCheckUtils]: 66: Hoare triple {99658#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:23,895 INFO L272 TraceCheckUtils]: 67: Hoare triple {99658#(<= ~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)); {99658#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:23,895 INFO L290 TraceCheckUtils]: 68: Hoare triple {99658#(<= ~counter~0 7)} ~cond := #in~cond; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:23,895 INFO L290 TraceCheckUtils]: 69: Hoare triple {99658#(<= ~counter~0 7)} assume !(0 == ~cond); {99658#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:23,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {99658#(<= ~counter~0 7)} assume true; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:23,896 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99658#(<= ~counter~0 7)} {99658#(<= ~counter~0 7)} #96#return; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:23,896 INFO L290 TraceCheckUtils]: 72: Hoare triple {99658#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99658#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:23,897 INFO L290 TraceCheckUtils]: 73: Hoare triple {99658#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:23,898 INFO L290 TraceCheckUtils]: 74: Hoare triple {99683#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:23,898 INFO L272 TraceCheckUtils]: 75: Hoare triple {99683#(<= ~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)); {99683#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:23,898 INFO L290 TraceCheckUtils]: 76: Hoare triple {99683#(<= ~counter~0 8)} ~cond := #in~cond; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:23,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {99683#(<= ~counter~0 8)} assume !(0 == ~cond); {99683#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:23,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {99683#(<= ~counter~0 8)} assume true; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:23,899 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99683#(<= ~counter~0 8)} {99683#(<= ~counter~0 8)} #96#return; {99683#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:23,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {99683#(<= ~counter~0 8)} assume !(~r~0 > 0); {99683#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:23,900 INFO L290 TraceCheckUtils]: 81: Hoare triple {99683#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:23,901 INFO L290 TraceCheckUtils]: 82: Hoare triple {99708#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:23,901 INFO L272 TraceCheckUtils]: 83: Hoare triple {99708#(<= ~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)); {99708#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:23,902 INFO L290 TraceCheckUtils]: 84: Hoare triple {99708#(<= ~counter~0 9)} ~cond := #in~cond; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:23,902 INFO L290 TraceCheckUtils]: 85: Hoare triple {99708#(<= ~counter~0 9)} assume !(0 == ~cond); {99708#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:23,902 INFO L290 TraceCheckUtils]: 86: Hoare triple {99708#(<= ~counter~0 9)} assume true; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:23,903 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99708#(<= ~counter~0 9)} {99708#(<= ~counter~0 9)} #98#return; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:23,903 INFO L290 TraceCheckUtils]: 88: Hoare triple {99708#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99708#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:23,904 INFO L290 TraceCheckUtils]: 89: Hoare triple {99708#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:23,904 INFO L290 TraceCheckUtils]: 90: Hoare triple {99733#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:23,905 INFO L272 TraceCheckUtils]: 91: Hoare triple {99733#(<= ~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)); {99733#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:23,905 INFO L290 TraceCheckUtils]: 92: Hoare triple {99733#(<= ~counter~0 10)} ~cond := #in~cond; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:23,905 INFO L290 TraceCheckUtils]: 93: Hoare triple {99733#(<= ~counter~0 10)} assume !(0 == ~cond); {99733#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:23,905 INFO L290 TraceCheckUtils]: 94: Hoare triple {99733#(<= ~counter~0 10)} assume true; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:23,906 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99733#(<= ~counter~0 10)} {99733#(<= ~counter~0 10)} #98#return; {99733#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:23,906 INFO L290 TraceCheckUtils]: 96: Hoare triple {99733#(<= ~counter~0 10)} assume !(~r~0 < 0); {99733#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:23,907 INFO L290 TraceCheckUtils]: 97: Hoare triple {99733#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:23,907 INFO L290 TraceCheckUtils]: 98: Hoare triple {99758#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:23,908 INFO L272 TraceCheckUtils]: 99: Hoare triple {99758#(<= ~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)); {99758#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:23,908 INFO L290 TraceCheckUtils]: 100: Hoare triple {99758#(<= ~counter~0 11)} ~cond := #in~cond; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:23,908 INFO L290 TraceCheckUtils]: 101: Hoare triple {99758#(<= ~counter~0 11)} assume !(0 == ~cond); {99758#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:23,909 INFO L290 TraceCheckUtils]: 102: Hoare triple {99758#(<= ~counter~0 11)} assume true; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:23,909 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99758#(<= ~counter~0 11)} {99758#(<= ~counter~0 11)} #94#return; {99758#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:23,909 INFO L290 TraceCheckUtils]: 104: Hoare triple {99758#(<= ~counter~0 11)} assume !!(0 != ~r~0); {99758#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:23,910 INFO L290 TraceCheckUtils]: 105: Hoare triple {99758#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:23,911 INFO L290 TraceCheckUtils]: 106: Hoare triple {99783#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:23,911 INFO L272 TraceCheckUtils]: 107: Hoare triple {99783#(<= ~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)); {99783#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:23,911 INFO L290 TraceCheckUtils]: 108: Hoare triple {99783#(<= ~counter~0 12)} ~cond := #in~cond; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:23,912 INFO L290 TraceCheckUtils]: 109: Hoare triple {99783#(<= ~counter~0 12)} assume !(0 == ~cond); {99783#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:23,912 INFO L290 TraceCheckUtils]: 110: Hoare triple {99783#(<= ~counter~0 12)} assume true; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:23,912 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99783#(<= ~counter~0 12)} {99783#(<= ~counter~0 12)} #96#return; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:23,913 INFO L290 TraceCheckUtils]: 112: Hoare triple {99783#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99783#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:23,914 INFO L290 TraceCheckUtils]: 113: Hoare triple {99783#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:23,914 INFO L290 TraceCheckUtils]: 114: Hoare triple {99808#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:23,914 INFO L272 TraceCheckUtils]: 115: Hoare triple {99808#(<= ~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)); {99808#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:23,915 INFO L290 TraceCheckUtils]: 116: Hoare triple {99808#(<= ~counter~0 13)} ~cond := #in~cond; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:23,915 INFO L290 TraceCheckUtils]: 117: Hoare triple {99808#(<= ~counter~0 13)} assume !(0 == ~cond); {99808#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:23,915 INFO L290 TraceCheckUtils]: 118: Hoare triple {99808#(<= ~counter~0 13)} assume true; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:23,916 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99808#(<= ~counter~0 13)} {99808#(<= ~counter~0 13)} #96#return; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:23,916 INFO L290 TraceCheckUtils]: 120: Hoare triple {99808#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99808#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:23,916 INFO L290 TraceCheckUtils]: 121: Hoare triple {99808#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99833#(<= |main_#t~post7| 13)} is VALID [2022-04-08 06:06:23,917 INFO L290 TraceCheckUtils]: 122: Hoare triple {99833#(<= |main_#t~post7| 13)} assume !(#t~post7 < 50);havoc #t~post7; {99452#false} is VALID [2022-04-08 06:06:23,917 INFO L290 TraceCheckUtils]: 123: Hoare triple {99452#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99452#false} is VALID [2022-04-08 06:06:23,917 INFO L290 TraceCheckUtils]: 124: Hoare triple {99452#false} assume !(#t~post8 < 50);havoc #t~post8; {99452#false} is VALID [2022-04-08 06:06:23,917 INFO L290 TraceCheckUtils]: 125: Hoare triple {99452#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99452#false} is VALID [2022-04-08 06:06:23,917 INFO L290 TraceCheckUtils]: 126: Hoare triple {99452#false} assume !(#t~post6 < 50);havoc #t~post6; {99452#false} is VALID [2022-04-08 06:06:23,917 INFO L272 TraceCheckUtils]: 127: Hoare triple {99452#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)); {99452#false} is VALID [2022-04-08 06:06:23,917 INFO L290 TraceCheckUtils]: 128: Hoare triple {99452#false} ~cond := #in~cond; {99452#false} is VALID [2022-04-08 06:06:23,917 INFO L290 TraceCheckUtils]: 129: Hoare triple {99452#false} assume 0 == ~cond; {99452#false} is VALID [2022-04-08 06:06:23,917 INFO L290 TraceCheckUtils]: 130: Hoare triple {99452#false} assume !false; {99452#false} is VALID [2022-04-08 06:06:23,918 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-08 06:06:23,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:06:24,670 INFO L290 TraceCheckUtils]: 130: Hoare triple {99452#false} assume !false; {99452#false} is VALID [2022-04-08 06:06:24,670 INFO L290 TraceCheckUtils]: 129: Hoare triple {99452#false} assume 0 == ~cond; {99452#false} is VALID [2022-04-08 06:06:24,670 INFO L290 TraceCheckUtils]: 128: Hoare triple {99452#false} ~cond := #in~cond; {99452#false} is VALID [2022-04-08 06:06:24,670 INFO L272 TraceCheckUtils]: 127: Hoare triple {99452#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)); {99452#false} is VALID [2022-04-08 06:06:24,670 INFO L290 TraceCheckUtils]: 126: Hoare triple {99452#false} assume !(#t~post6 < 50);havoc #t~post6; {99452#false} is VALID [2022-04-08 06:06:24,671 INFO L290 TraceCheckUtils]: 125: Hoare triple {99452#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99452#false} is VALID [2022-04-08 06:06:24,671 INFO L290 TraceCheckUtils]: 124: Hoare triple {99452#false} assume !(#t~post8 < 50);havoc #t~post8; {99452#false} is VALID [2022-04-08 06:06:24,671 INFO L290 TraceCheckUtils]: 123: Hoare triple {99452#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99452#false} is VALID [2022-04-08 06:06:24,671 INFO L290 TraceCheckUtils]: 122: Hoare triple {99885#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {99452#false} is VALID [2022-04-08 06:06:24,671 INFO L290 TraceCheckUtils]: 121: Hoare triple {99889#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99885#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:06:24,672 INFO L290 TraceCheckUtils]: 120: Hoare triple {99889#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99889#(< ~counter~0 50)} is VALID [2022-04-08 06:06:24,672 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99451#true} {99889#(< ~counter~0 50)} #96#return; {99889#(< ~counter~0 50)} is VALID [2022-04-08 06:06:24,672 INFO L290 TraceCheckUtils]: 118: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,672 INFO L290 TraceCheckUtils]: 117: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,672 INFO L290 TraceCheckUtils]: 116: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,672 INFO L272 TraceCheckUtils]: 115: Hoare triple {99889#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,673 INFO L290 TraceCheckUtils]: 114: Hoare triple {99889#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {99889#(< ~counter~0 50)} is VALID [2022-04-08 06:06:24,675 INFO L290 TraceCheckUtils]: 113: Hoare triple {99914#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99889#(< ~counter~0 50)} is VALID [2022-04-08 06:06:24,675 INFO L290 TraceCheckUtils]: 112: Hoare triple {99914#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99914#(< ~counter~0 49)} is VALID [2022-04-08 06:06:24,676 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99451#true} {99914#(< ~counter~0 49)} #96#return; {99914#(< ~counter~0 49)} is VALID [2022-04-08 06:06:24,676 INFO L290 TraceCheckUtils]: 110: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,676 INFO L290 TraceCheckUtils]: 109: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,676 INFO L290 TraceCheckUtils]: 108: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,676 INFO L272 TraceCheckUtils]: 107: Hoare triple {99914#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,676 INFO L290 TraceCheckUtils]: 106: Hoare triple {99914#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {99914#(< ~counter~0 49)} is VALID [2022-04-08 06:06:24,678 INFO L290 TraceCheckUtils]: 105: Hoare triple {99939#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99914#(< ~counter~0 49)} is VALID [2022-04-08 06:06:24,678 INFO L290 TraceCheckUtils]: 104: Hoare triple {99939#(< ~counter~0 48)} assume !!(0 != ~r~0); {99939#(< ~counter~0 48)} is VALID [2022-04-08 06:06:24,679 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99451#true} {99939#(< ~counter~0 48)} #94#return; {99939#(< ~counter~0 48)} is VALID [2022-04-08 06:06:24,679 INFO L290 TraceCheckUtils]: 102: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,679 INFO L290 TraceCheckUtils]: 101: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,679 INFO L290 TraceCheckUtils]: 100: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,679 INFO L272 TraceCheckUtils]: 99: Hoare triple {99939#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,679 INFO L290 TraceCheckUtils]: 98: Hoare triple {99939#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {99939#(< ~counter~0 48)} is VALID [2022-04-08 06:06:24,681 INFO L290 TraceCheckUtils]: 97: Hoare triple {99964#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99939#(< ~counter~0 48)} is VALID [2022-04-08 06:06:24,681 INFO L290 TraceCheckUtils]: 96: Hoare triple {99964#(< ~counter~0 47)} assume !(~r~0 < 0); {99964#(< ~counter~0 47)} is VALID [2022-04-08 06:06:24,682 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99451#true} {99964#(< ~counter~0 47)} #98#return; {99964#(< ~counter~0 47)} is VALID [2022-04-08 06:06:24,682 INFO L290 TraceCheckUtils]: 94: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,682 INFO L290 TraceCheckUtils]: 93: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,682 INFO L290 TraceCheckUtils]: 92: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,682 INFO L272 TraceCheckUtils]: 91: Hoare triple {99964#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,682 INFO L290 TraceCheckUtils]: 90: Hoare triple {99964#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {99964#(< ~counter~0 47)} is VALID [2022-04-08 06:06:24,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {99989#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99964#(< ~counter~0 47)} is VALID [2022-04-08 06:06:24,684 INFO L290 TraceCheckUtils]: 88: Hoare triple {99989#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99989#(< ~counter~0 46)} is VALID [2022-04-08 06:06:24,684 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99451#true} {99989#(< ~counter~0 46)} #98#return; {99989#(< ~counter~0 46)} is VALID [2022-04-08 06:06:24,684 INFO L290 TraceCheckUtils]: 86: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,685 INFO L272 TraceCheckUtils]: 83: Hoare triple {99989#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,685 INFO L290 TraceCheckUtils]: 82: Hoare triple {99989#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {99989#(< ~counter~0 46)} is VALID [2022-04-08 06:06:24,686 INFO L290 TraceCheckUtils]: 81: Hoare triple {100014#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99989#(< ~counter~0 46)} is VALID [2022-04-08 06:06:24,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {100014#(< ~counter~0 45)} assume !(~r~0 > 0); {100014#(< ~counter~0 45)} is VALID [2022-04-08 06:06:24,687 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99451#true} {100014#(< ~counter~0 45)} #96#return; {100014#(< ~counter~0 45)} is VALID [2022-04-08 06:06:24,687 INFO L290 TraceCheckUtils]: 78: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,687 INFO L290 TraceCheckUtils]: 77: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,687 INFO L290 TraceCheckUtils]: 76: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,687 INFO L272 TraceCheckUtils]: 75: Hoare triple {100014#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {100014#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {100014#(< ~counter~0 45)} is VALID [2022-04-08 06:06:24,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {100039#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100014#(< ~counter~0 45)} is VALID [2022-04-08 06:06:24,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {100039#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100039#(< ~counter~0 44)} is VALID [2022-04-08 06:06:24,689 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99451#true} {100039#(< ~counter~0 44)} #96#return; {100039#(< ~counter~0 44)} is VALID [2022-04-08 06:06:24,690 INFO L290 TraceCheckUtils]: 70: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,690 INFO L290 TraceCheckUtils]: 69: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,690 INFO L290 TraceCheckUtils]: 68: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,690 INFO L272 TraceCheckUtils]: 67: Hoare triple {100039#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {100039#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {100039#(< ~counter~0 44)} is VALID [2022-04-08 06:06:24,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {100064#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100039#(< ~counter~0 44)} is VALID [2022-04-08 06:06:24,692 INFO L290 TraceCheckUtils]: 64: Hoare triple {100064#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100064#(< ~counter~0 43)} is VALID [2022-04-08 06:06:24,692 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99451#true} {100064#(< ~counter~0 43)} #96#return; {100064#(< ~counter~0 43)} is VALID [2022-04-08 06:06:24,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,692 INFO L272 TraceCheckUtils]: 59: Hoare triple {100064#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {100064#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {100064#(< ~counter~0 43)} is VALID [2022-04-08 06:06:24,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {100089#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100064#(< ~counter~0 43)} is VALID [2022-04-08 06:06:24,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {100089#(< ~counter~0 42)} assume !!(0 != ~r~0); {100089#(< ~counter~0 42)} is VALID [2022-04-08 06:06:24,695 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99451#true} {100089#(< ~counter~0 42)} #94#return; {100089#(< ~counter~0 42)} is VALID [2022-04-08 06:06:24,695 INFO L290 TraceCheckUtils]: 54: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,695 INFO L272 TraceCheckUtils]: 51: Hoare triple {100089#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {100089#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {100089#(< ~counter~0 42)} is VALID [2022-04-08 06:06:24,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {100114#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100089#(< ~counter~0 42)} is VALID [2022-04-08 06:06:24,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {100114#(< ~counter~0 41)} assume !(~r~0 < 0); {100114#(< ~counter~0 41)} is VALID [2022-04-08 06:06:24,697 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99451#true} {100114#(< ~counter~0 41)} #98#return; {100114#(< ~counter~0 41)} is VALID [2022-04-08 06:06:24,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,698 INFO L272 TraceCheckUtils]: 43: Hoare triple {100114#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {100114#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {100114#(< ~counter~0 41)} is VALID [2022-04-08 06:06:24,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {100139#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100114#(< ~counter~0 41)} is VALID [2022-04-08 06:06:24,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {100139#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100139#(< ~counter~0 40)} is VALID [2022-04-08 06:06:24,700 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99451#true} {100139#(< ~counter~0 40)} #98#return; {100139#(< ~counter~0 40)} is VALID [2022-04-08 06:06:24,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,700 INFO L272 TraceCheckUtils]: 35: Hoare triple {100139#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {100139#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {100139#(< ~counter~0 40)} is VALID [2022-04-08 06:06:24,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {100164#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100139#(< ~counter~0 40)} is VALID [2022-04-08 06:06:24,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {100164#(< ~counter~0 39)} assume !(~r~0 > 0); {100164#(< ~counter~0 39)} is VALID [2022-04-08 06:06:24,702 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99451#true} {100164#(< ~counter~0 39)} #96#return; {100164#(< ~counter~0 39)} is VALID [2022-04-08 06:06:24,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,703 INFO L272 TraceCheckUtils]: 27: Hoare triple {100164#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {100164#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {100164#(< ~counter~0 39)} is VALID [2022-04-08 06:06:24,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {100189#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100164#(< ~counter~0 39)} is VALID [2022-04-08 06:06:24,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {100189#(< ~counter~0 38)} assume !!(0 != ~r~0); {100189#(< ~counter~0 38)} is VALID [2022-04-08 06:06:24,705 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99451#true} {100189#(< ~counter~0 38)} #94#return; {100189#(< ~counter~0 38)} is VALID [2022-04-08 06:06:24,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,706 INFO L272 TraceCheckUtils]: 19: Hoare triple {100189#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {100189#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {100189#(< ~counter~0 38)} is VALID [2022-04-08 06:06:24,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {100214#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100189#(< ~counter~0 38)} is VALID [2022-04-08 06:06:24,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {100214#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100214#(< ~counter~0 37)} is VALID [2022-04-08 06:06:24,708 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99451#true} {100214#(< ~counter~0 37)} #92#return; {100214#(< ~counter~0 37)} is VALID [2022-04-08 06:06:24,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,708 INFO L272 TraceCheckUtils]: 11: Hoare triple {100214#(< ~counter~0 37)} 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)); {99451#true} is VALID [2022-04-08 06:06:24,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99451#true} {100214#(< ~counter~0 37)} #90#return; {100214#(< ~counter~0 37)} is VALID [2022-04-08 06:06:24,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-08 06:06:24,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-08 06:06:24,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-08 06:06:24,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {100214#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99451#true} is VALID [2022-04-08 06:06:24,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {100214#(< ~counter~0 37)} 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; {100214#(< ~counter~0 37)} is VALID [2022-04-08 06:06:24,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {100214#(< ~counter~0 37)} call #t~ret9 := main(); {100214#(< ~counter~0 37)} is VALID [2022-04-08 06:06:24,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100214#(< ~counter~0 37)} {99451#true} #102#return; {100214#(< ~counter~0 37)} is VALID [2022-04-08 06:06:24,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {100214#(< ~counter~0 37)} assume true; {100214#(< ~counter~0 37)} is VALID [2022-04-08 06:06:24,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {99451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {100214#(< ~counter~0 37)} is VALID [2022-04-08 06:06:24,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {99451#true} call ULTIMATE.init(); {99451#true} is VALID [2022-04-08 06:06:24,711 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-08 06:06:24,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:06:24,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814694617] [2022-04-08 06:06:24,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:06:24,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266457866] [2022-04-08 06:06:24,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266457866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:06:24,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:06:24,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 06:06:24,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:06:24,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1132986376] [2022-04-08 06:06:24,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1132986376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:06:24,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:06:24,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 06:06:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495696566] [2022-04-08 06:06:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:06:24,712 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-08 06:06:24,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:06:24,712 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-08 06:06:24,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:06:24,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 06:06:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 06:06:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 06:06:24,850 INFO L87 Difference]: Start difference. First operand 690 states and 936 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-08 06:06:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:28,500 INFO L93 Difference]: Finished difference Result 903 states and 1260 transitions. [2022-04-08 06:06:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 06:06:28,500 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-08 06:06:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:06:28,501 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-08 06:06:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-08 06:06:28,503 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-08 06:06:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-08 06:06:28,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-08 06:06:28,834 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-08 06:06:28,860 INFO L225 Difference]: With dead ends: 903 [2022-04-08 06:06:28,860 INFO L226 Difference]: Without dead ends: 706 [2022-04-08 06:06:28,861 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-08 06:06:28,862 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 207 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:06:28,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 315 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 06:06:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-04-08 06:06:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-04-08 06:06:31,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:06:31,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:31,106 INFO L74 IsIncluded]: Start isIncluded. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:31,107 INFO L87 Difference]: Start difference. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:31,124 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-08 06:06:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 06:06:31,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:06:31,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:06:31,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-08 06:06:31,126 INFO L87 Difference]: Start difference. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-08 06:06:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:31,142 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-08 06:06:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 06:06:31,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:06:31,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:06:31,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:06:31,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:06:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:06:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 952 transitions. [2022-04-08 06:06:31,166 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 952 transitions. Word has length 131 [2022-04-08 06:06:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:06:31,166 INFO L478 AbstractCegarLoop]: Abstraction has 706 states and 952 transitions. [2022-04-08 06:06:31,166 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-08 06:06:31,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 706 states and 952 transitions. [2022-04-08 06:06:37,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 952 edges. 951 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:06:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 06:06:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 06:06:37,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:06:37,488 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-08 06:06:37,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-08 06:06:37,688 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-08 06:06:37,688 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:06:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:06:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-08 06:06:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:37,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1014239415] [2022-04-08 06:06:37,689 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:06:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-08 06:06:37,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:06:37,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216834966] [2022-04-08 06:06:37,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:06:37,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:06:37,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:06:37,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1129997521] [2022-04-08 06:06:37,701 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:06:37,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:06:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:06:37,704 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-08 06:06:37,707 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-08 06:06:37,790 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 06:06:37,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:06:37,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 06:06:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:06:37,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:06:38,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {104922#true} call ULTIMATE.init(); {104922#true} is VALID [2022-04-08 06:06:38,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {104922#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {104922#true} is VALID [2022-04-08 06:06:38,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104922#true} {104922#true} #102#return; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {104922#true} call #t~ret9 := main(); {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {104922#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; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {104922#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {104922#true} {104922#true} #90#return; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {104922#true} {104922#true} #92#return; {104922#true} is VALID [2022-04-08 06:06:38,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {104922#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {104922#true} assume !!(#t~post6 < 50);havoc #t~post6; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L272 TraceCheckUtils]: 19: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {104922#true} assume !!(#t~post7 < 50);havoc #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L272 TraceCheckUtils]: 27: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 06:06:38,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {104922#true} assume !(~r~0 > 0); {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {104922#true} assume !!(#t~post8 < 50);havoc #t~post8; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L272 TraceCheckUtils]: 35: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {104922#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {104922#true} assume !!(#t~post8 < 50);havoc #t~post8; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L272 TraceCheckUtils]: 43: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,460 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {104922#true} assume !(~r~0 < 0); {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {104922#true} assume !!(#t~post6 < 50);havoc #t~post6; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L272 TraceCheckUtils]: 51: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 58: Hoare triple {104922#true} assume !!(#t~post7 < 50);havoc #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L272 TraceCheckUtils]: 59: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 60: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 61: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,461 INFO L290 TraceCheckUtils]: 62: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 66: Hoare triple {104922#true} assume !!(#t~post7 < 50);havoc #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L272 TraceCheckUtils]: 67: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 69: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 70: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 73: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 74: Hoare triple {104922#true} assume !!(#t~post7 < 50);havoc #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L272 TraceCheckUtils]: 75: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 76: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 77: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,462 INFO L290 TraceCheckUtils]: 78: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 80: Hoare triple {104922#true} assume !(~r~0 > 0); {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 81: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 82: Hoare triple {104922#true} assume !!(#t~post8 < 50);havoc #t~post8; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L272 TraceCheckUtils]: 83: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 84: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 85: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 86: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {104922#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 90: Hoare triple {104922#true} assume !!(#t~post8 < 50);havoc #t~post8; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L272 TraceCheckUtils]: 91: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 92: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,463 INFO L290 TraceCheckUtils]: 93: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 94: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {104922#true} assume !(~r~0 < 0); {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 98: Hoare triple {104922#true} assume !!(#t~post6 < 50);havoc #t~post6; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L272 TraceCheckUtils]: 99: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 100: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 101: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 102: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 104: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 105: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 106: Hoare triple {104922#true} assume !!(#t~post7 < 50);havoc #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L272 TraceCheckUtils]: 107: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,464 INFO L290 TraceCheckUtils]: 108: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 109: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 110: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 112: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 113: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 114: Hoare triple {104922#true} assume !!(#t~post7 < 50);havoc #t~post7; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L272 TraceCheckUtils]: 115: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 116: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 117: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 118: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-08 06:06:38,465 INFO L290 TraceCheckUtils]: 120: Hoare triple {104922#true} assume !(~r~0 > 0); {105287#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:06:38,466 INFO L290 TraceCheckUtils]: 121: Hoare triple {105287#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105287#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:06:38,466 INFO L290 TraceCheckUtils]: 122: Hoare triple {105287#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {105287#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:06:38,466 INFO L272 TraceCheckUtils]: 123: Hoare triple {105287#(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)); {104922#true} is VALID [2022-04-08 06:06:38,466 INFO L290 TraceCheckUtils]: 124: Hoare triple {104922#true} ~cond := #in~cond; {105300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:06:38,467 INFO L290 TraceCheckUtils]: 125: Hoare triple {105300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:06:38,467 INFO L290 TraceCheckUtils]: 126: Hoare triple {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:06:38,468 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} {105287#(not (< 0 main_~r~0))} #98#return; {105311#(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-08 06:06:38,470 INFO L290 TraceCheckUtils]: 128: Hoare triple {105311#(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); {105315#(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-08 06:06:38,470 INFO L290 TraceCheckUtils]: 129: Hoare triple {105315#(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; {105315#(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-08 06:06:38,471 INFO L290 TraceCheckUtils]: 130: Hoare triple {105315#(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 < 50);havoc #t~post6; {105315#(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-08 06:06:38,472 INFO L272 TraceCheckUtils]: 131: Hoare triple {105315#(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)); {105325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:06:38,472 INFO L290 TraceCheckUtils]: 132: Hoare triple {105325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {105329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:06:38,472 INFO L290 TraceCheckUtils]: 133: Hoare triple {105329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104923#false} is VALID [2022-04-08 06:06:38,473 INFO L290 TraceCheckUtils]: 134: Hoare triple {104923#false} assume !false; {104923#false} is VALID [2022-04-08 06:06:38,473 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-08 06:06:38,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:06:41,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:06:41,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216834966] [2022-04-08 06:06:41,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:06:41,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129997521] [2022-04-08 06:06:41,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129997521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 06:06:41,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:06:41,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 06:06:41,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:06:41,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1014239415] [2022-04-08 06:06:41,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1014239415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:06:41,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:06:41,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:06:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930784260] [2022-04-08 06:06:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:06:41,067 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-08 06:06:41,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:06:41,067 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-08 06:06:41,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:06:41,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:06:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:41,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:06:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-08 06:06:41,118 INFO L87 Difference]: Start difference. First operand 706 states and 952 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-08 06:06:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:44,438 INFO L93 Difference]: Finished difference Result 758 states and 1028 transitions. [2022-04-08 06:06:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:06:44,438 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-08 06:06:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:06:44,439 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-08 06:06:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-08 06:06:44,440 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-08 06:06:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-08 06:06:44,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-08 06:06:44,517 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-08 06:06:44,539 INFO L225 Difference]: With dead ends: 758 [2022-04-08 06:06:44,539 INFO L226 Difference]: Without dead ends: 746 [2022-04-08 06:06:44,540 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-08 06:06:44,540 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 28 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:06:44,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 251 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:06:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-08 06:06:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 683. [2022-04-08 06:06:46,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:06:46,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 06:06:46,716 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 06:06:46,717 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 06:06:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:46,735 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-08 06:06:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-08 06:06:46,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:06:46,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:06:46,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-08 06:06:46,737 INFO L87 Difference]: Start difference. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-08 06:06:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:46,754 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-08 06:06:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-08 06:06:46,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:06:46,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:06:46,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:06:46,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:06:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 06:06:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 912 transitions. [2022-04-08 06:06:46,775 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 912 transitions. Word has length 135 [2022-04-08 06:06:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:06:46,775 INFO L478 AbstractCegarLoop]: Abstraction has 683 states and 912 transitions. [2022-04-08 06:06:46,776 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-08 06:06:46,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 912 transitions. [2022-04-08 06:06:51,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 912 edges. 911 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:06:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 912 transitions. [2022-04-08 06:06:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 06:06:51,836 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:06:51,837 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-08 06:06:51,844 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-08 06:06:52,037 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-08 06:06:52,037 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:06:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:06:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-08 06:06:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:52,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517868060] [2022-04-08 06:06:52,038 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:06:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-08 06:06:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:06:52,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016216271] [2022-04-08 06:06:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:06:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:06:52,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:06:52,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515867673] [2022-04-08 06:06:52,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:06:52,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:06:52,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:06:52,054 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-08 06:06:52,056 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-08 06:06:52,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:06:52,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:06:52,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 06:06:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:06:52,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:06:52,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {109742#true} call ULTIMATE.init(); {109742#true} is VALID [2022-04-08 06:06:52,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {109742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109750#(<= ~counter~0 0)} {109742#true} #102#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {109750#(<= ~counter~0 0)} call #t~ret9 := main(); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {109750#(<= ~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; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {109750#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {109750#(<= ~counter~0 0)} ~cond := #in~cond; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {109750#(<= ~counter~0 0)} assume !(0 == ~cond); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109750#(<= ~counter~0 0)} {109750#(<= ~counter~0 0)} #90#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,895 INFO L272 TraceCheckUtils]: 11: Hoare triple {109750#(<= ~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)); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {109750#(<= ~counter~0 0)} ~cond := #in~cond; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {109750#(<= ~counter~0 0)} assume !(0 == ~cond); {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109750#(<= ~counter~0 0)} {109750#(<= ~counter~0 0)} #92#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {109750#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {109750#(<= ~counter~0 0)} is VALID [2022-04-08 06:06:52,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {109750#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:52,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {109799#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:52,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {109799#(<= ~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)); {109799#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:52,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {109799#(<= ~counter~0 1)} ~cond := #in~cond; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:52,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {109799#(<= ~counter~0 1)} assume !(0 == ~cond); {109799#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:52,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {109799#(<= ~counter~0 1)} assume true; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:52,901 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109799#(<= ~counter~0 1)} {109799#(<= ~counter~0 1)} #94#return; {109799#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:52,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {109799#(<= ~counter~0 1)} assume !!(0 != ~r~0); {109799#(<= ~counter~0 1)} is VALID [2022-04-08 06:06:52,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {109799#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:52,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {109824#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:52,903 INFO L272 TraceCheckUtils]: 27: Hoare triple {109824#(<= ~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)); {109824#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:52,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {109824#(<= ~counter~0 2)} ~cond := #in~cond; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:52,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {109824#(<= ~counter~0 2)} assume !(0 == ~cond); {109824#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:52,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {109824#(<= ~counter~0 2)} assume true; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:52,904 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109824#(<= ~counter~0 2)} {109824#(<= ~counter~0 2)} #96#return; {109824#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:52,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {109824#(<= ~counter~0 2)} assume !(~r~0 > 0); {109824#(<= ~counter~0 2)} is VALID [2022-04-08 06:06:52,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {109824#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:52,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {109849#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:52,906 INFO L272 TraceCheckUtils]: 35: Hoare triple {109849#(<= ~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)); {109849#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:52,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {109849#(<= ~counter~0 3)} ~cond := #in~cond; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:52,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {109849#(<= ~counter~0 3)} assume !(0 == ~cond); {109849#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:52,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {109849#(<= ~counter~0 3)} assume true; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:52,907 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109849#(<= ~counter~0 3)} {109849#(<= ~counter~0 3)} #98#return; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:52,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {109849#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {109849#(<= ~counter~0 3)} is VALID [2022-04-08 06:06:52,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {109849#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:52,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {109874#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:52,909 INFO L272 TraceCheckUtils]: 43: Hoare triple {109874#(<= ~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)); {109874#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:52,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {109874#(<= ~counter~0 4)} ~cond := #in~cond; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:52,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {109874#(<= ~counter~0 4)} assume !(0 == ~cond); {109874#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:52,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {109874#(<= ~counter~0 4)} assume true; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:52,911 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109874#(<= ~counter~0 4)} {109874#(<= ~counter~0 4)} #98#return; {109874#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:52,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {109874#(<= ~counter~0 4)} assume !(~r~0 < 0); {109874#(<= ~counter~0 4)} is VALID [2022-04-08 06:06:52,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {109874#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:52,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {109899#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:52,913 INFO L272 TraceCheckUtils]: 51: Hoare triple {109899#(<= ~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)); {109899#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:52,913 INFO L290 TraceCheckUtils]: 52: Hoare triple {109899#(<= ~counter~0 5)} ~cond := #in~cond; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:52,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {109899#(<= ~counter~0 5)} assume !(0 == ~cond); {109899#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:52,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {109899#(<= ~counter~0 5)} assume true; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:52,914 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109899#(<= ~counter~0 5)} {109899#(<= ~counter~0 5)} #94#return; {109899#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:52,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {109899#(<= ~counter~0 5)} assume !!(0 != ~r~0); {109899#(<= ~counter~0 5)} is VALID [2022-04-08 06:06:52,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {109899#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:52,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {109924#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:52,916 INFO L272 TraceCheckUtils]: 59: Hoare triple {109924#(<= ~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)); {109924#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:52,916 INFO L290 TraceCheckUtils]: 60: Hoare triple {109924#(<= ~counter~0 6)} ~cond := #in~cond; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:52,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {109924#(<= ~counter~0 6)} assume !(0 == ~cond); {109924#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:52,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {109924#(<= ~counter~0 6)} assume true; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:52,917 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109924#(<= ~counter~0 6)} {109924#(<= ~counter~0 6)} #96#return; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:52,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {109924#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109924#(<= ~counter~0 6)} is VALID [2022-04-08 06:06:52,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {109924#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:52,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {109949#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:52,919 INFO L272 TraceCheckUtils]: 67: Hoare triple {109949#(<= ~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)); {109949#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:52,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {109949#(<= ~counter~0 7)} ~cond := #in~cond; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:52,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {109949#(<= ~counter~0 7)} assume !(0 == ~cond); {109949#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:52,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {109949#(<= ~counter~0 7)} assume true; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:52,921 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109949#(<= ~counter~0 7)} {109949#(<= ~counter~0 7)} #96#return; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:52,921 INFO L290 TraceCheckUtils]: 72: Hoare triple {109949#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109949#(<= ~counter~0 7)} is VALID [2022-04-08 06:06:52,922 INFO L290 TraceCheckUtils]: 73: Hoare triple {109949#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:52,922 INFO L290 TraceCheckUtils]: 74: Hoare triple {109974#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:52,923 INFO L272 TraceCheckUtils]: 75: Hoare triple {109974#(<= ~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)); {109974#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:52,923 INFO L290 TraceCheckUtils]: 76: Hoare triple {109974#(<= ~counter~0 8)} ~cond := #in~cond; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:52,923 INFO L290 TraceCheckUtils]: 77: Hoare triple {109974#(<= ~counter~0 8)} assume !(0 == ~cond); {109974#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:52,924 INFO L290 TraceCheckUtils]: 78: Hoare triple {109974#(<= ~counter~0 8)} assume true; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:52,924 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109974#(<= ~counter~0 8)} {109974#(<= ~counter~0 8)} #96#return; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:52,924 INFO L290 TraceCheckUtils]: 80: Hoare triple {109974#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109974#(<= ~counter~0 8)} is VALID [2022-04-08 06:06:52,925 INFO L290 TraceCheckUtils]: 81: Hoare triple {109974#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:52,926 INFO L290 TraceCheckUtils]: 82: Hoare triple {109999#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:52,926 INFO L272 TraceCheckUtils]: 83: Hoare triple {109999#(<= ~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)); {109999#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:52,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {109999#(<= ~counter~0 9)} ~cond := #in~cond; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:52,927 INFO L290 TraceCheckUtils]: 85: Hoare triple {109999#(<= ~counter~0 9)} assume !(0 == ~cond); {109999#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:52,927 INFO L290 TraceCheckUtils]: 86: Hoare triple {109999#(<= ~counter~0 9)} assume true; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:52,927 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109999#(<= ~counter~0 9)} {109999#(<= ~counter~0 9)} #96#return; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:52,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {109999#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109999#(<= ~counter~0 9)} is VALID [2022-04-08 06:06:52,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {109999#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:52,929 INFO L290 TraceCheckUtils]: 90: Hoare triple {110024#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:52,929 INFO L272 TraceCheckUtils]: 91: Hoare triple {110024#(<= ~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)); {110024#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:52,930 INFO L290 TraceCheckUtils]: 92: Hoare triple {110024#(<= ~counter~0 10)} ~cond := #in~cond; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:52,930 INFO L290 TraceCheckUtils]: 93: Hoare triple {110024#(<= ~counter~0 10)} assume !(0 == ~cond); {110024#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:52,930 INFO L290 TraceCheckUtils]: 94: Hoare triple {110024#(<= ~counter~0 10)} assume true; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:52,931 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {110024#(<= ~counter~0 10)} {110024#(<= ~counter~0 10)} #96#return; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:52,931 INFO L290 TraceCheckUtils]: 96: Hoare triple {110024#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110024#(<= ~counter~0 10)} is VALID [2022-04-08 06:06:52,932 INFO L290 TraceCheckUtils]: 97: Hoare triple {110024#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:52,932 INFO L290 TraceCheckUtils]: 98: Hoare triple {110049#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:52,933 INFO L272 TraceCheckUtils]: 99: Hoare triple {110049#(<= ~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)); {110049#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:52,933 INFO L290 TraceCheckUtils]: 100: Hoare triple {110049#(<= ~counter~0 11)} ~cond := #in~cond; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:52,933 INFO L290 TraceCheckUtils]: 101: Hoare triple {110049#(<= ~counter~0 11)} assume !(0 == ~cond); {110049#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:52,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {110049#(<= ~counter~0 11)} assume true; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:52,934 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {110049#(<= ~counter~0 11)} {110049#(<= ~counter~0 11)} #96#return; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:52,934 INFO L290 TraceCheckUtils]: 104: Hoare triple {110049#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110049#(<= ~counter~0 11)} is VALID [2022-04-08 06:06:52,935 INFO L290 TraceCheckUtils]: 105: Hoare triple {110049#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:52,936 INFO L290 TraceCheckUtils]: 106: Hoare triple {110074#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:52,936 INFO L272 TraceCheckUtils]: 107: Hoare triple {110074#(<= ~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)); {110074#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:52,936 INFO L290 TraceCheckUtils]: 108: Hoare triple {110074#(<= ~counter~0 12)} ~cond := #in~cond; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:52,937 INFO L290 TraceCheckUtils]: 109: Hoare triple {110074#(<= ~counter~0 12)} assume !(0 == ~cond); {110074#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:52,937 INFO L290 TraceCheckUtils]: 110: Hoare triple {110074#(<= ~counter~0 12)} assume true; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:52,938 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110074#(<= ~counter~0 12)} {110074#(<= ~counter~0 12)} #96#return; {110074#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:52,938 INFO L290 TraceCheckUtils]: 112: Hoare triple {110074#(<= ~counter~0 12)} assume !(~r~0 > 0); {110074#(<= ~counter~0 12)} is VALID [2022-04-08 06:06:52,939 INFO L290 TraceCheckUtils]: 113: Hoare triple {110074#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:52,939 INFO L290 TraceCheckUtils]: 114: Hoare triple {110099#(<= ~counter~0 13)} assume !!(#t~post8 < 50);havoc #t~post8; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:52,940 INFO L272 TraceCheckUtils]: 115: Hoare triple {110099#(<= ~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)); {110099#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:52,940 INFO L290 TraceCheckUtils]: 116: Hoare triple {110099#(<= ~counter~0 13)} ~cond := #in~cond; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:52,940 INFO L290 TraceCheckUtils]: 117: Hoare triple {110099#(<= ~counter~0 13)} assume !(0 == ~cond); {110099#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:52,940 INFO L290 TraceCheckUtils]: 118: Hoare triple {110099#(<= ~counter~0 13)} assume true; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:52,941 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110099#(<= ~counter~0 13)} {110099#(<= ~counter~0 13)} #98#return; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:52,941 INFO L290 TraceCheckUtils]: 120: Hoare triple {110099#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110099#(<= ~counter~0 13)} is VALID [2022-04-08 06:06:52,942 INFO L290 TraceCheckUtils]: 121: Hoare triple {110099#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 06:06:52,942 INFO L290 TraceCheckUtils]: 122: Hoare triple {110124#(<= ~counter~0 14)} assume !!(#t~post8 < 50);havoc #t~post8; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 06:06:52,943 INFO L272 TraceCheckUtils]: 123: Hoare triple {110124#(<= ~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)); {110124#(<= ~counter~0 14)} is VALID [2022-04-08 06:06:52,943 INFO L290 TraceCheckUtils]: 124: Hoare triple {110124#(<= ~counter~0 14)} ~cond := #in~cond; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 06:06:52,943 INFO L290 TraceCheckUtils]: 125: Hoare triple {110124#(<= ~counter~0 14)} assume !(0 == ~cond); {110124#(<= ~counter~0 14)} is VALID [2022-04-08 06:06:52,944 INFO L290 TraceCheckUtils]: 126: Hoare triple {110124#(<= ~counter~0 14)} assume true; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 06:06:52,944 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110124#(<= ~counter~0 14)} {110124#(<= ~counter~0 14)} #98#return; {110124#(<= ~counter~0 14)} is VALID [2022-04-08 06:06:52,944 INFO L290 TraceCheckUtils]: 128: Hoare triple {110124#(<= ~counter~0 14)} assume !(~r~0 < 0); {110124#(<= ~counter~0 14)} is VALID [2022-04-08 06:06:52,945 INFO L290 TraceCheckUtils]: 129: Hoare triple {110124#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110149#(<= |main_#t~post6| 14)} is VALID [2022-04-08 06:06:52,945 INFO L290 TraceCheckUtils]: 130: Hoare triple {110149#(<= |main_#t~post6| 14)} assume !(#t~post6 < 50);havoc #t~post6; {109743#false} is VALID [2022-04-08 06:06:52,945 INFO L272 TraceCheckUtils]: 131: Hoare triple {109743#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)); {109743#false} is VALID [2022-04-08 06:06:52,945 INFO L290 TraceCheckUtils]: 132: Hoare triple {109743#false} ~cond := #in~cond; {109743#false} is VALID [2022-04-08 06:06:52,945 INFO L290 TraceCheckUtils]: 133: Hoare triple {109743#false} assume 0 == ~cond; {109743#false} is VALID [2022-04-08 06:06:52,945 INFO L290 TraceCheckUtils]: 134: Hoare triple {109743#false} assume !false; {109743#false} is VALID [2022-04-08 06:06:52,946 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-08 06:06:52,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:06:53,810 INFO L290 TraceCheckUtils]: 134: Hoare triple {109743#false} assume !false; {109743#false} is VALID [2022-04-08 06:06:53,810 INFO L290 TraceCheckUtils]: 133: Hoare triple {109743#false} assume 0 == ~cond; {109743#false} is VALID [2022-04-08 06:06:53,810 INFO L290 TraceCheckUtils]: 132: Hoare triple {109743#false} ~cond := #in~cond; {109743#false} is VALID [2022-04-08 06:06:53,811 INFO L272 TraceCheckUtils]: 131: Hoare triple {109743#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)); {109743#false} is VALID [2022-04-08 06:06:53,811 INFO L290 TraceCheckUtils]: 130: Hoare triple {110177#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {109743#false} is VALID [2022-04-08 06:06:53,811 INFO L290 TraceCheckUtils]: 129: Hoare triple {110181#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110177#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:06:53,811 INFO L290 TraceCheckUtils]: 128: Hoare triple {110181#(< ~counter~0 50)} assume !(~r~0 < 0); {110181#(< ~counter~0 50)} is VALID [2022-04-08 06:06:53,812 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {109742#true} {110181#(< ~counter~0 50)} #98#return; {110181#(< ~counter~0 50)} is VALID [2022-04-08 06:06:53,812 INFO L290 TraceCheckUtils]: 126: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,812 INFO L290 TraceCheckUtils]: 125: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,812 INFO L290 TraceCheckUtils]: 124: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,812 INFO L272 TraceCheckUtils]: 123: Hoare triple {110181#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,813 INFO L290 TraceCheckUtils]: 122: Hoare triple {110181#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {110181#(< ~counter~0 50)} is VALID [2022-04-08 06:06:53,815 INFO L290 TraceCheckUtils]: 121: Hoare triple {110206#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110181#(< ~counter~0 50)} is VALID [2022-04-08 06:06:53,815 INFO L290 TraceCheckUtils]: 120: Hoare triple {110206#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110206#(< ~counter~0 49)} is VALID [2022-04-08 06:06:53,816 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {109742#true} {110206#(< ~counter~0 49)} #98#return; {110206#(< ~counter~0 49)} is VALID [2022-04-08 06:06:53,816 INFO L290 TraceCheckUtils]: 118: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,816 INFO L290 TraceCheckUtils]: 117: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,816 INFO L290 TraceCheckUtils]: 116: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,816 INFO L272 TraceCheckUtils]: 115: Hoare triple {110206#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,816 INFO L290 TraceCheckUtils]: 114: Hoare triple {110206#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {110206#(< ~counter~0 49)} is VALID [2022-04-08 06:06:53,817 INFO L290 TraceCheckUtils]: 113: Hoare triple {110231#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110206#(< ~counter~0 49)} is VALID [2022-04-08 06:06:53,817 INFO L290 TraceCheckUtils]: 112: Hoare triple {110231#(< ~counter~0 48)} assume !(~r~0 > 0); {110231#(< ~counter~0 48)} is VALID [2022-04-08 06:06:53,818 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {109742#true} {110231#(< ~counter~0 48)} #96#return; {110231#(< ~counter~0 48)} is VALID [2022-04-08 06:06:53,818 INFO L290 TraceCheckUtils]: 110: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,818 INFO L290 TraceCheckUtils]: 109: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,818 INFO L290 TraceCheckUtils]: 108: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,818 INFO L272 TraceCheckUtils]: 107: Hoare triple {110231#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,818 INFO L290 TraceCheckUtils]: 106: Hoare triple {110231#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {110231#(< ~counter~0 48)} is VALID [2022-04-08 06:06:53,819 INFO L290 TraceCheckUtils]: 105: Hoare triple {110256#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110231#(< ~counter~0 48)} is VALID [2022-04-08 06:06:53,820 INFO L290 TraceCheckUtils]: 104: Hoare triple {110256#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110256#(< ~counter~0 47)} is VALID [2022-04-08 06:06:53,820 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {109742#true} {110256#(< ~counter~0 47)} #96#return; {110256#(< ~counter~0 47)} is VALID [2022-04-08 06:06:53,820 INFO L290 TraceCheckUtils]: 102: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,820 INFO L290 TraceCheckUtils]: 101: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,820 INFO L290 TraceCheckUtils]: 100: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,820 INFO L272 TraceCheckUtils]: 99: Hoare triple {110256#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,821 INFO L290 TraceCheckUtils]: 98: Hoare triple {110256#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {110256#(< ~counter~0 47)} is VALID [2022-04-08 06:06:53,822 INFO L290 TraceCheckUtils]: 97: Hoare triple {110281#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110256#(< ~counter~0 47)} is VALID [2022-04-08 06:06:53,822 INFO L290 TraceCheckUtils]: 96: Hoare triple {110281#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110281#(< ~counter~0 46)} is VALID [2022-04-08 06:06:53,822 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {109742#true} {110281#(< ~counter~0 46)} #96#return; {110281#(< ~counter~0 46)} is VALID [2022-04-08 06:06:53,823 INFO L290 TraceCheckUtils]: 94: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,823 INFO L290 TraceCheckUtils]: 93: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,823 INFO L272 TraceCheckUtils]: 91: Hoare triple {110281#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {110281#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {110281#(< ~counter~0 46)} is VALID [2022-04-08 06:06:53,824 INFO L290 TraceCheckUtils]: 89: Hoare triple {110306#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110281#(< ~counter~0 46)} is VALID [2022-04-08 06:06:53,824 INFO L290 TraceCheckUtils]: 88: Hoare triple {110306#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110306#(< ~counter~0 45)} is VALID [2022-04-08 06:06:53,825 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109742#true} {110306#(< ~counter~0 45)} #96#return; {110306#(< ~counter~0 45)} is VALID [2022-04-08 06:06:53,825 INFO L290 TraceCheckUtils]: 86: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,825 INFO L290 TraceCheckUtils]: 85: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,825 INFO L290 TraceCheckUtils]: 84: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,825 INFO L272 TraceCheckUtils]: 83: Hoare triple {110306#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,825 INFO L290 TraceCheckUtils]: 82: Hoare triple {110306#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {110306#(< ~counter~0 45)} is VALID [2022-04-08 06:06:53,826 INFO L290 TraceCheckUtils]: 81: Hoare triple {110331#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110306#(< ~counter~0 45)} is VALID [2022-04-08 06:06:53,827 INFO L290 TraceCheckUtils]: 80: Hoare triple {110331#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110331#(< ~counter~0 44)} is VALID [2022-04-08 06:06:53,827 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109742#true} {110331#(< ~counter~0 44)} #96#return; {110331#(< ~counter~0 44)} is VALID [2022-04-08 06:06:53,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,827 INFO L290 TraceCheckUtils]: 76: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,827 INFO L272 TraceCheckUtils]: 75: Hoare triple {110331#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {110331#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {110331#(< ~counter~0 44)} is VALID [2022-04-08 06:06:53,829 INFO L290 TraceCheckUtils]: 73: Hoare triple {110356#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110331#(< ~counter~0 44)} is VALID [2022-04-08 06:06:53,829 INFO L290 TraceCheckUtils]: 72: Hoare triple {110356#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110356#(< ~counter~0 43)} is VALID [2022-04-08 06:06:53,829 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109742#true} {110356#(< ~counter~0 43)} #96#return; {110356#(< ~counter~0 43)} is VALID [2022-04-08 06:06:53,830 INFO L290 TraceCheckUtils]: 70: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,830 INFO L290 TraceCheckUtils]: 69: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,830 INFO L272 TraceCheckUtils]: 67: Hoare triple {110356#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {110356#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {110356#(< ~counter~0 43)} is VALID [2022-04-08 06:06:53,831 INFO L290 TraceCheckUtils]: 65: Hoare triple {110381#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110356#(< ~counter~0 43)} is VALID [2022-04-08 06:06:53,831 INFO L290 TraceCheckUtils]: 64: Hoare triple {110381#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110381#(< ~counter~0 42)} is VALID [2022-04-08 06:06:53,832 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109742#true} {110381#(< ~counter~0 42)} #96#return; {110381#(< ~counter~0 42)} is VALID [2022-04-08 06:06:53,832 INFO L290 TraceCheckUtils]: 62: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,832 INFO L290 TraceCheckUtils]: 61: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,832 INFO L272 TraceCheckUtils]: 59: Hoare triple {110381#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {110381#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {110381#(< ~counter~0 42)} is VALID [2022-04-08 06:06:53,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {110406#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110381#(< ~counter~0 42)} is VALID [2022-04-08 06:06:53,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {110406#(< ~counter~0 41)} assume !!(0 != ~r~0); {110406#(< ~counter~0 41)} is VALID [2022-04-08 06:06:53,834 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109742#true} {110406#(< ~counter~0 41)} #94#return; {110406#(< ~counter~0 41)} is VALID [2022-04-08 06:06:53,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,834 INFO L272 TraceCheckUtils]: 51: Hoare triple {110406#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {110406#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {110406#(< ~counter~0 41)} is VALID [2022-04-08 06:06:53,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {110431#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110406#(< ~counter~0 41)} is VALID [2022-04-08 06:06:53,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {110431#(< ~counter~0 40)} assume !(~r~0 < 0); {110431#(< ~counter~0 40)} is VALID [2022-04-08 06:06:53,836 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109742#true} {110431#(< ~counter~0 40)} #98#return; {110431#(< ~counter~0 40)} is VALID [2022-04-08 06:06:53,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,837 INFO L272 TraceCheckUtils]: 43: Hoare triple {110431#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {110431#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {110431#(< ~counter~0 40)} is VALID [2022-04-08 06:06:53,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {110456#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110431#(< ~counter~0 40)} is VALID [2022-04-08 06:06:53,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {110456#(< ~counter~0 39)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110456#(< ~counter~0 39)} is VALID [2022-04-08 06:06:53,839 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109742#true} {110456#(< ~counter~0 39)} #98#return; {110456#(< ~counter~0 39)} is VALID [2022-04-08 06:06:53,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,839 INFO L272 TraceCheckUtils]: 35: Hoare triple {110456#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {110456#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {110456#(< ~counter~0 39)} is VALID [2022-04-08 06:06:53,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {110481#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110456#(< ~counter~0 39)} is VALID [2022-04-08 06:06:53,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {110481#(< ~counter~0 38)} assume !(~r~0 > 0); {110481#(< ~counter~0 38)} is VALID [2022-04-08 06:06:53,841 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109742#true} {110481#(< ~counter~0 38)} #96#return; {110481#(< ~counter~0 38)} is VALID [2022-04-08 06:06:53,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,841 INFO L272 TraceCheckUtils]: 27: Hoare triple {110481#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {110481#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {110481#(< ~counter~0 38)} is VALID [2022-04-08 06:06:53,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {110506#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110481#(< ~counter~0 38)} is VALID [2022-04-08 06:06:53,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {110506#(< ~counter~0 37)} assume !!(0 != ~r~0); {110506#(< ~counter~0 37)} is VALID [2022-04-08 06:06:53,843 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109742#true} {110506#(< ~counter~0 37)} #94#return; {110506#(< ~counter~0 37)} is VALID [2022-04-08 06:06:53,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,844 INFO L272 TraceCheckUtils]: 19: Hoare triple {110506#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {110506#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {110506#(< ~counter~0 37)} is VALID [2022-04-08 06:06:53,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {110531#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110506#(< ~counter~0 37)} is VALID [2022-04-08 06:06:53,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {110531#(< ~counter~0 36)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {110531#(< ~counter~0 36)} is VALID [2022-04-08 06:06:53,846 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109742#true} {110531#(< ~counter~0 36)} #92#return; {110531#(< ~counter~0 36)} is VALID [2022-04-08 06:06:53,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,846 INFO L272 TraceCheckUtils]: 11: Hoare triple {110531#(< ~counter~0 36)} 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)); {109742#true} is VALID [2022-04-08 06:06:53,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109742#true} {110531#(< ~counter~0 36)} #90#return; {110531#(< ~counter~0 36)} is VALID [2022-04-08 06:06:53,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-08 06:06:53,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-08 06:06:53,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-08 06:06:53,847 INFO L272 TraceCheckUtils]: 6: Hoare triple {110531#(< ~counter~0 36)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109742#true} is VALID [2022-04-08 06:06:53,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {110531#(< ~counter~0 36)} 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; {110531#(< ~counter~0 36)} is VALID [2022-04-08 06:06:53,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {110531#(< ~counter~0 36)} call #t~ret9 := main(); {110531#(< ~counter~0 36)} is VALID [2022-04-08 06:06:53,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110531#(< ~counter~0 36)} {109742#true} #102#return; {110531#(< ~counter~0 36)} is VALID [2022-04-08 06:06:53,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {110531#(< ~counter~0 36)} assume true; {110531#(< ~counter~0 36)} is VALID [2022-04-08 06:06:53,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {109742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {110531#(< ~counter~0 36)} is VALID [2022-04-08 06:06:53,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {109742#true} call ULTIMATE.init(); {109742#true} is VALID [2022-04-08 06:06:53,849 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-08 06:06:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:06:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016216271] [2022-04-08 06:06:53,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:06:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515867673] [2022-04-08 06:06:53,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515867673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:06:53,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:06:53,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-08 06:06:53,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:06:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517868060] [2022-04-08 06:06:53,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517868060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:06:53,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:06:53,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 06:06:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878580973] [2022-04-08 06:06:53,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:06:53,850 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-08 06:06:53,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:06:53,851 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-08 06:06:53,980 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-08 06:06:53,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 06:06:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:06:53,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 06:06:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 06:06:53,981 INFO L87 Difference]: Start difference. First operand 683 states and 912 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-08 06:06:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:06:57,953 INFO L93 Difference]: Finished difference Result 734 states and 982 transitions. [2022-04-08 06:06:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 06:06:57,953 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-08 06:06:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:06:57,953 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-08 06:06:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-08 06:06:57,955 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-08 06:06:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-08 06:06:57,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-08 06:06:58,293 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-08 06:06:58,327 INFO L225 Difference]: With dead ends: 734 [2022-04-08 06:06:58,327 INFO L226 Difference]: Without dead ends: 729 [2022-04-08 06:06:58,328 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-08 06:06:58,328 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 190 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:06:58,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 351 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 06:06:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-04-08 06:07:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 707. [2022-04-08 06:07:00,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:07:00,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:07:00,624 INFO L74 IsIncluded]: Start isIncluded. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:07:00,624 INFO L87 Difference]: Start difference. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:07:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:07:00,646 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-08 06:07:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-08 06:07:00,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:07:00,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:07:00,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-08 06:07:00,648 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-08 06:07:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:07:00,665 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-08 06:07:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-08 06:07:00,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:07:00,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:07:00,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:07:00,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:07:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:07:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-08 06:07:00,693 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 135 [2022-04-08 06:07:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:07:00,693 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-08 06:07:00,693 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-08 06:07:00,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-08 06:07:05,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:07:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-08 06:07:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 06:07:05,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:07:05,483 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-08 06:07:05,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-08 06:07:05,683 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-08 06:07:05,684 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:07:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:07:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-08 06:07:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:07:05,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800134736] [2022-04-08 06:07:05,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:07:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-08 06:07:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:07:05,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017335662] [2022-04-08 06:07:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:07:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:07:05,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:07:05,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989403534] [2022-04-08 06:07:05,697 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:07:05,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:07:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:07:05,698 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-08 06:07:05,699 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-08 06:07:05,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:07:05,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:07:05,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 06:07:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:07:05,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:09:19,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {114947#true} call ULTIMATE.init(); {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {114947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114947#true} {114947#true} #102#return; {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {114947#true} call #t~ret9 := main(); {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {114947#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; {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {114947#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114947#true} {114947#true} #90#return; {114947#true} is VALID [2022-04-08 06:09:19,912 INFO L272 TraceCheckUtils]: 11: Hoare triple {114947#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)); {114947#true} is VALID [2022-04-08 06:09:19,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {114947#true} ~cond := #in~cond; {114988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:09:19,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {114988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:09:19,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:09:19,914 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} {114947#true} #92#return; {114999#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} is VALID [2022-04-08 06:09:21,925 WARN L290 TraceCheckUtils]: 16: Hoare triple {114999#(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; {115003#(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-08 06:09:21,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {115003#(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; {115003#(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-08 06:09:21,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {115003#(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 < 50);havoc #t~post6; {115003#(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-08 06:09:21,926 INFO L272 TraceCheckUtils]: 19: Hoare triple {115003#(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)); {114947#true} is VALID [2022-04-08 06:09:21,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:21,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:21,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:21,927 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {114947#true} {115003#(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; {115003#(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-08 06:09:21,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {115003#(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); {115003#(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-08 06:09:21,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {115003#(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; {115003#(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-08 06:09:21,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {115003#(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 < 50);havoc #t~post7; {115003#(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-08 06:09:21,928 INFO L272 TraceCheckUtils]: 27: Hoare triple {115003#(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)); {114947#true} is VALID [2022-04-08 06:09:21,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:21,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:21,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:21,929 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {114947#true} {115003#(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; {115003#(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-08 06:09:21,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {115003#(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); {115003#(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-08 06:09:21,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {115003#(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; {115003#(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-08 06:09:21,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {115003#(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 < 50);havoc #t~post8; {115003#(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-08 06:09:21,931 INFO L272 TraceCheckUtils]: 35: Hoare triple {115003#(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)); {114947#true} is VALID [2022-04-08 06:09:21,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:21,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:21,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:21,932 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {114947#true} {115003#(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; {115003#(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-08 06:09:22,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {115003#(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; {115076#(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-08 06:09:22,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {115076#(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; {115076#(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-08 06:09:22,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {115076#(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 < 50);havoc #t~post8; {115076#(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-08 06:09:22,434 INFO L272 TraceCheckUtils]: 43: Hoare triple {115076#(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)); {114947#true} is VALID [2022-04-08 06:09:22,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:22,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:22,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:22,435 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {114947#true} {115076#(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; {115076#(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-08 06:09:22,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {115076#(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); {115076#(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-08 06:09:22,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {115076#(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; {115076#(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-08 06:09:22,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {115076#(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 < 50);havoc #t~post6; {115076#(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-08 06:09:22,445 INFO L272 TraceCheckUtils]: 51: Hoare triple {115076#(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)); {114947#true} is VALID [2022-04-08 06:09:22,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:22,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:22,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:22,445 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {114947#true} {115076#(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; {115076#(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-08 06:09:22,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {115076#(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); {115076#(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-08 06:09:22,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {115076#(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; {115076#(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-08 06:09:22,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {115076#(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 < 50);havoc #t~post7; {115076#(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-08 06:09:22,464 INFO L272 TraceCheckUtils]: 59: Hoare triple {115076#(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)); {114947#true} is VALID [2022-04-08 06:09:22,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:22,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:22,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:22,465 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {114947#true} {115076#(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; {115076#(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-08 06:09:22,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {115076#(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; {115149#(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-08 06:09:23,406 INFO L290 TraceCheckUtils]: 65: Hoare triple {115149#(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; {115149#(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-08 06:09:23,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {115149#(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 < 50);havoc #t~post7; {115149#(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-08 06:09:23,417 INFO L272 TraceCheckUtils]: 67: Hoare triple {115149#(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)); {114947#true} is VALID [2022-04-08 06:09:23,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:23,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:23,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:23,418 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {114947#true} {115149#(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; {115149#(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-08 06:09:23,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {115149#(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; {115174#(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-08 06:09:23,428 INFO L290 TraceCheckUtils]: 73: Hoare triple {115174#(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; {115174#(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-08 06:09:23,430 INFO L290 TraceCheckUtils]: 74: Hoare triple {115174#(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 < 50);havoc #t~post7; {115174#(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-08 06:09:23,430 INFO L272 TraceCheckUtils]: 75: Hoare triple {115174#(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)); {114947#true} is VALID [2022-04-08 06:09:23,430 INFO L290 TraceCheckUtils]: 76: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:23,430 INFO L290 TraceCheckUtils]: 77: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:23,430 INFO L290 TraceCheckUtils]: 78: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:23,431 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {114947#true} {115174#(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; {115174#(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-08 06:09:23,447 INFO L290 TraceCheckUtils]: 80: Hoare triple {115174#(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); {115174#(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-08 06:09:23,448 INFO L290 TraceCheckUtils]: 81: Hoare triple {115174#(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; {115174#(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-08 06:09:23,449 INFO L290 TraceCheckUtils]: 82: Hoare triple {115174#(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 < 50);havoc #t~post8; {115174#(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-08 06:09:23,449 INFO L272 TraceCheckUtils]: 83: Hoare triple {115174#(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)); {114947#true} is VALID [2022-04-08 06:09:23,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:23,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:23,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:23,450 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {114947#true} {115174#(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; {115174#(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-08 06:09:23,455 INFO L290 TraceCheckUtils]: 88: Hoare triple {115174#(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; {115223#(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-08 06:09:23,467 INFO L290 TraceCheckUtils]: 89: Hoare triple {115223#(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; {115223#(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-08 06:09:23,468 INFO L290 TraceCheckUtils]: 90: Hoare triple {115223#(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 < 50);havoc #t~post8; {115223#(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-08 06:09:23,469 INFO L272 TraceCheckUtils]: 91: Hoare triple {115223#(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)); {114947#true} is VALID [2022-04-08 06:09:23,469 INFO L290 TraceCheckUtils]: 92: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:23,469 INFO L290 TraceCheckUtils]: 93: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:23,469 INFO L290 TraceCheckUtils]: 94: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:23,470 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {114947#true} {115223#(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; {115223#(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-08 06:09:23,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {115223#(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); {115223#(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-08 06:09:23,486 INFO L290 TraceCheckUtils]: 97: Hoare triple {115223#(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; {115223#(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-08 06:09:23,488 INFO L290 TraceCheckUtils]: 98: Hoare triple {115223#(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 < 50);havoc #t~post6; {115223#(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-08 06:09:23,488 INFO L272 TraceCheckUtils]: 99: Hoare triple {115223#(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)); {114947#true} is VALID [2022-04-08 06:09:23,488 INFO L290 TraceCheckUtils]: 100: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:23,488 INFO L290 TraceCheckUtils]: 101: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:23,488 INFO L290 TraceCheckUtils]: 102: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:23,489 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {114947#true} {115223#(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; {115223#(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-08 06:09:23,494 INFO L290 TraceCheckUtils]: 104: Hoare triple {115223#(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); {115223#(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-08 06:09:23,502 INFO L290 TraceCheckUtils]: 105: Hoare triple {115223#(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; {115223#(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-08 06:09:23,507 INFO L290 TraceCheckUtils]: 106: Hoare triple {115223#(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 < 50);havoc #t~post7; {115223#(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-08 06:09:23,507 INFO L272 TraceCheckUtils]: 107: Hoare triple {115223#(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)); {114947#true} is VALID [2022-04-08 06:09:23,508 INFO L290 TraceCheckUtils]: 108: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:23,508 INFO L290 TraceCheckUtils]: 109: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:23,508 INFO L290 TraceCheckUtils]: 110: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:23,508 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {114947#true} {115223#(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; {115223#(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-08 06:09:23,510 INFO L290 TraceCheckUtils]: 112: Hoare triple {115223#(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; {115296#(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-08 06:09:23,511 INFO L290 TraceCheckUtils]: 113: Hoare triple {115296#(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; {115296#(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-08 06:09:23,512 INFO L290 TraceCheckUtils]: 114: Hoare triple {115296#(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 < 50);havoc #t~post7; {115296#(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-08 06:09:23,512 INFO L272 TraceCheckUtils]: 115: Hoare triple {115296#(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)); {114947#true} is VALID [2022-04-08 06:09:23,512 INFO L290 TraceCheckUtils]: 116: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:23,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:23,512 INFO L290 TraceCheckUtils]: 118: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:23,513 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {114947#true} {115296#(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; {115296#(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-08 06:09:23,514 INFO L290 TraceCheckUtils]: 120: Hoare triple {115296#(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); {115296#(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-08 06:09:23,515 INFO L290 TraceCheckUtils]: 121: Hoare triple {115296#(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; {115296#(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-08 06:09:23,516 INFO L290 TraceCheckUtils]: 122: Hoare triple {115296#(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 < 50);havoc #t~post8; {115296#(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-08 06:09:23,516 INFO L272 TraceCheckUtils]: 123: Hoare triple {115296#(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)); {114947#true} is VALID [2022-04-08 06:09:23,516 INFO L290 TraceCheckUtils]: 124: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:23,516 INFO L290 TraceCheckUtils]: 125: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:23,516 INFO L290 TraceCheckUtils]: 126: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:23,517 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {114947#true} {115296#(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; {115296#(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-08 06:09:23,521 INFO L290 TraceCheckUtils]: 128: Hoare triple {115296#(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; {114948#false} is VALID [2022-04-08 06:09:23,521 INFO L290 TraceCheckUtils]: 129: Hoare triple {114948#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114948#false} is VALID [2022-04-08 06:09:23,521 INFO L290 TraceCheckUtils]: 130: Hoare triple {114948#false} assume !(#t~post8 < 50);havoc #t~post8; {114948#false} is VALID [2022-04-08 06:09:23,521 INFO L290 TraceCheckUtils]: 131: Hoare triple {114948#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114948#false} is VALID [2022-04-08 06:09:23,521 INFO L290 TraceCheckUtils]: 132: Hoare triple {114948#false} assume !(#t~post6 < 50);havoc #t~post6; {114948#false} is VALID [2022-04-08 06:09:23,521 INFO L272 TraceCheckUtils]: 133: Hoare triple {114948#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)); {114948#false} is VALID [2022-04-08 06:09:23,521 INFO L290 TraceCheckUtils]: 134: Hoare triple {114948#false} ~cond := #in~cond; {114948#false} is VALID [2022-04-08 06:09:23,521 INFO L290 TraceCheckUtils]: 135: Hoare triple {114948#false} assume 0 == ~cond; {114948#false} is VALID [2022-04-08 06:09:23,521 INFO L290 TraceCheckUtils]: 136: Hoare triple {114948#false} assume !false; {114948#false} is VALID [2022-04-08 06:09:23,522 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-08 06:09:23,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:09:26,876 INFO L290 TraceCheckUtils]: 136: Hoare triple {114948#false} assume !false; {114948#false} is VALID [2022-04-08 06:09:26,877 INFO L290 TraceCheckUtils]: 135: Hoare triple {114948#false} assume 0 == ~cond; {114948#false} is VALID [2022-04-08 06:09:26,877 INFO L290 TraceCheckUtils]: 134: Hoare triple {114948#false} ~cond := #in~cond; {114948#false} is VALID [2022-04-08 06:09:26,877 INFO L272 TraceCheckUtils]: 133: Hoare triple {114948#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)); {114948#false} is VALID [2022-04-08 06:09:26,877 INFO L290 TraceCheckUtils]: 132: Hoare triple {114948#false} assume !(#t~post6 < 50);havoc #t~post6; {114948#false} is VALID [2022-04-08 06:09:26,877 INFO L290 TraceCheckUtils]: 131: Hoare triple {114948#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114948#false} is VALID [2022-04-08 06:09:26,877 INFO L290 TraceCheckUtils]: 130: Hoare triple {114948#false} assume !(#t~post8 < 50);havoc #t~post8; {114948#false} is VALID [2022-04-08 06:09:26,877 INFO L290 TraceCheckUtils]: 129: Hoare triple {114948#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114948#false} is VALID [2022-04-08 06:09:26,877 INFO L290 TraceCheckUtils]: 128: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {114948#false} is VALID [2022-04-08 06:09:26,879 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {114947#true} {115393#(not (< main_~r~0 0))} #98#return; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 06:09:26,880 INFO L290 TraceCheckUtils]: 126: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,880 INFO L290 TraceCheckUtils]: 125: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,880 INFO L290 TraceCheckUtils]: 124: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,880 INFO L272 TraceCheckUtils]: 123: Hoare triple {115393#(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)); {114947#true} is VALID [2022-04-08 06:09:26,880 INFO L290 TraceCheckUtils]: 122: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 06:09:26,881 INFO L290 TraceCheckUtils]: 121: Hoare triple {115393#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 06:09:26,881 INFO L290 TraceCheckUtils]: 120: Hoare triple {115393#(not (< main_~r~0 0))} assume !(~r~0 > 0); {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 06:09:26,882 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {114947#true} {115393#(not (< main_~r~0 0))} #96#return; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 06:09:26,882 INFO L290 TraceCheckUtils]: 118: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,882 INFO L290 TraceCheckUtils]: 117: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,882 INFO L290 TraceCheckUtils]: 116: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,882 INFO L272 TraceCheckUtils]: 115: Hoare triple {115393#(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)); {114947#true} is VALID [2022-04-08 06:09:26,883 INFO L290 TraceCheckUtils]: 114: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 06:09:26,883 INFO L290 TraceCheckUtils]: 113: Hoare triple {115393#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 06:09:26,885 INFO L290 TraceCheckUtils]: 112: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115393#(not (< main_~r~0 0))} is VALID [2022-04-08 06:09:26,886 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #96#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,886 INFO L290 TraceCheckUtils]: 110: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,886 INFO L290 TraceCheckUtils]: 109: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,886 INFO L290 TraceCheckUtils]: 108: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,886 INFO L272 TraceCheckUtils]: 107: Hoare triple {115442#(<= 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)); {114947#true} is VALID [2022-04-08 06:09:26,887 INFO L290 TraceCheckUtils]: 106: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 50);havoc #t~post7; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,887 INFO L290 TraceCheckUtils]: 105: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,888 INFO L290 TraceCheckUtils]: 104: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,888 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #94#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,888 INFO L290 TraceCheckUtils]: 102: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,889 INFO L290 TraceCheckUtils]: 101: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,889 INFO L272 TraceCheckUtils]: 99: Hoare triple {115442#(<= 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)); {114947#true} is VALID [2022-04-08 06:09:26,890 INFO L290 TraceCheckUtils]: 98: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 50);havoc #t~post6; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,890 INFO L290 TraceCheckUtils]: 97: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,891 INFO L290 TraceCheckUtils]: 96: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,891 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #98#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,891 INFO L290 TraceCheckUtils]: 94: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,891 INFO L290 TraceCheckUtils]: 93: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,892 INFO L290 TraceCheckUtils]: 92: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,892 INFO L272 TraceCheckUtils]: 91: Hoare triple {115442#(<= 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)); {114947#true} is VALID [2022-04-08 06:09:26,892 INFO L290 TraceCheckUtils]: 90: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 50);havoc #t~post8; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,892 INFO L290 TraceCheckUtils]: 89: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,896 INFO L290 TraceCheckUtils]: 88: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:09:26,897 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {114947#true} {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:09:26,897 INFO L290 TraceCheckUtils]: 86: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,897 INFO L290 TraceCheckUtils]: 85: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,897 INFO L290 TraceCheckUtils]: 84: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,897 INFO L272 TraceCheckUtils]: 83: Hoare triple {115515#(<= 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)); {114947#true} is VALID [2022-04-08 06:09:26,898 INFO L290 TraceCheckUtils]: 82: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:09:26,898 INFO L290 TraceCheckUtils]: 81: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:09:26,898 INFO L290 TraceCheckUtils]: 80: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:09:26,899 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {114947#true} {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:09:26,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,899 INFO L290 TraceCheckUtils]: 76: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,900 INFO L272 TraceCheckUtils]: 75: Hoare triple {115515#(<= 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)); {114947#true} is VALID [2022-04-08 06:09:26,900 INFO L290 TraceCheckUtils]: 74: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:09:26,900 INFO L290 TraceCheckUtils]: 73: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:09:26,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {115564#(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; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:09:26,902 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {114947#true} {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 06:09:26,903 INFO L290 TraceCheckUtils]: 70: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,903 INFO L290 TraceCheckUtils]: 69: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,903 INFO L272 TraceCheckUtils]: 67: Hoare triple {115564#(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)); {114947#true} is VALID [2022-04-08 06:09:26,903 INFO L290 TraceCheckUtils]: 66: Hoare triple {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 06:09:26,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {115564#(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; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 06:09:26,906 INFO L290 TraceCheckUtils]: 64: Hoare triple {115589#(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; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 06:09:26,907 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,907 INFO L272 TraceCheckUtils]: 59: Hoare triple {115589#(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)); {114947#true} is VALID [2022-04-08 06:09:26,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 50);havoc #t~post7; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {115589#(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; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,910 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,910 INFO L272 TraceCheckUtils]: 51: Hoare triple {115589#(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)); {114947#true} is VALID [2022-04-08 06:09:26,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 50);havoc #t~post6; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {115589#(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; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,912 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,913 INFO L290 TraceCheckUtils]: 46: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,913 INFO L272 TraceCheckUtils]: 43: Hoare triple {115589#(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)); {114947#true} is VALID [2022-04-08 06:09:26,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 50);havoc #t~post8; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {115589#(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; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {115662#(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; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:09:26,920 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {114947#true} {115662#(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; {115662#(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-08 06:09:26,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,920 INFO L272 TraceCheckUtils]: 35: Hoare triple {115662#(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)); {114947#true} is VALID [2022-04-08 06:09:26,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {115662#(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 < 50);havoc #t~post8; {115662#(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-08 06:09:26,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {115662#(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; {115662#(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-08 06:09:26,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {115662#(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); {115662#(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-08 06:09:26,922 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {114947#true} {115662#(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; {115662#(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-08 06:09:26,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,922 INFO L272 TraceCheckUtils]: 27: Hoare triple {115662#(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)); {114947#true} is VALID [2022-04-08 06:09:26,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {115662#(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 < 50);havoc #t~post7; {115662#(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-08 06:09:26,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {115662#(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; {115662#(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-08 06:09:26,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {115662#(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); {115662#(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-08 06:09:26,923 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {114947#true} {115662#(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; {115662#(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-08 06:09:26,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,924 INFO L272 TraceCheckUtils]: 19: Hoare triple {115662#(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)); {114947#true} is VALID [2022-04-08 06:09:26,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {115662#(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 < 50);havoc #t~post6; {115662#(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-08 06:09:26,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {115662#(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; {115662#(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-08 06:09:26,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {115735#(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; {115662#(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-08 06:09:26,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} {114947#true} #92#return; {115735#(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-08 06:09:26,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:09:26,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {115748#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:09:26,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {114947#true} ~cond := #in~cond; {115748#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 06:09:26,929 INFO L272 TraceCheckUtils]: 11: Hoare triple {114947#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)); {114947#true} is VALID [2022-04-08 06:09:26,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114947#true} {114947#true} #90#return; {114947#true} is VALID [2022-04-08 06:09:26,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-08 06:09:26,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-08 06:09:26,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {114947#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {114947#true} is VALID [2022-04-08 06:09:26,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {114947#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; {114947#true} is VALID [2022-04-08 06:09:26,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {114947#true} call #t~ret9 := main(); {114947#true} is VALID [2022-04-08 06:09:26,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114947#true} {114947#true} #102#return; {114947#true} is VALID [2022-04-08 06:09:26,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-08 06:09:26,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {114947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {114947#true} is VALID [2022-04-08 06:09:26,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {114947#true} call ULTIMATE.init(); {114947#true} is VALID [2022-04-08 06:09:26,930 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-08 06:09:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:09:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017335662] [2022-04-08 06:09:26,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:09:26,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989403534] [2022-04-08 06:09:26,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989403534] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:09:26,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:09:26,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-08 06:09:26,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:09:26,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800134736] [2022-04-08 06:09:26,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800134736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:09:26,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:09:26,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:09:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821394061] [2022-04-08 06:09:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:09:26,932 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-08 06:09:26,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:09:26,932 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-08 06:09:36,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 95 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:36,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:09:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:36,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:09:36,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=290, Unknown=1, NotChecked=0, Total=342 [2022-04-08 06:09:36,142 INFO L87 Difference]: Start difference. First operand 707 states and 950 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-08 06:09:42,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:09:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:51,896 INFO L93 Difference]: Finished difference Result 964 states and 1336 transitions. [2022-04-08 06:09:51,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:09:51,896 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-08 06:09:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:09:51,897 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-08 06:09:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-08 06:09:51,898 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-08 06:09:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-08 06:09:51,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-08 06:09:55,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 160 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:55,266 INFO L225 Difference]: With dead ends: 964 [2022-04-08 06:09:55,266 INFO L226 Difference]: Without dead ends: 851 [2022-04-08 06:09:55,266 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=69, Invalid=392, Unknown=1, NotChecked=0, Total=462 [2022-04-08 06:09:55,267 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 26 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:09:55,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 562 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 1 Unknown, 282 Unchecked, 2.7s Time] [2022-04-08 06:09:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-08 06:09:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 707. [2022-04-08 06:09:57,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:09:57,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:09:57,811 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:09:57,811 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:09:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:57,836 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-08 06:09:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-08 06:09:57,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:09:57,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:09:57,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-08 06:09:57,838 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-08 06:09:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:57,863 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-08 06:09:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-08 06:09:57,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:09:57,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:09:57,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:09:57,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:09:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:09:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-08 06:09:57,894 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 137 [2022-04-08 06:09:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:09:57,894 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-08 06:09:57,894 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-08 06:09:57,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-08 06:10:08,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 948 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-08 06:10:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 06:10:08,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:08,064 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-08 06:10:08,081 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-08 06:10:08,265 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-08 06:10:08,265 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:08,265 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-08 06:10:08,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:08,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [34802052] [2022-04-08 06:10:08,266 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-08 06:10:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:08,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924666035] [2022-04-08 06:10:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:08,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:08,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800022169] [2022-04-08 06:10:08,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:10:08,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:08,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:08,290 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-08 06:10:08,296 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-08 06:10:08,467 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:10:08,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:08,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 06:10:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:08,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:09,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {120837#true} call ULTIMATE.init(); {120837#true} is VALID [2022-04-08 06:10:09,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {120837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120845#(<= ~counter~0 0)} {120837#true} #102#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {120845#(<= ~counter~0 0)} call #t~ret9 := main(); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {120845#(<= ~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; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {120845#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {120845#(<= ~counter~0 0)} ~cond := #in~cond; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {120845#(<= ~counter~0 0)} assume !(0 == ~cond); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120845#(<= ~counter~0 0)} {120845#(<= ~counter~0 0)} #90#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,263 INFO L272 TraceCheckUtils]: 11: Hoare triple {120845#(<= ~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)); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {120845#(<= ~counter~0 0)} ~cond := #in~cond; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {120845#(<= ~counter~0 0)} assume !(0 == ~cond); {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,264 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120845#(<= ~counter~0 0)} {120845#(<= ~counter~0 0)} #92#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {120845#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {120845#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:09,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {120845#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:09,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {120894#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:09,268 INFO L272 TraceCheckUtils]: 19: Hoare triple {120894#(<= ~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)); {120894#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:09,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {120894#(<= ~counter~0 1)} ~cond := #in~cond; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:09,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {120894#(<= ~counter~0 1)} assume !(0 == ~cond); {120894#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:09,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {120894#(<= ~counter~0 1)} assume true; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:09,269 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120894#(<= ~counter~0 1)} {120894#(<= ~counter~0 1)} #94#return; {120894#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:09,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {120894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {120894#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:09,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {120894#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:09,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {120919#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:09,271 INFO L272 TraceCheckUtils]: 27: Hoare triple {120919#(<= ~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)); {120919#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:09,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {120919#(<= ~counter~0 2)} ~cond := #in~cond; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:09,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {120919#(<= ~counter~0 2)} assume !(0 == ~cond); {120919#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:09,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {120919#(<= ~counter~0 2)} assume true; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:09,273 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120919#(<= ~counter~0 2)} {120919#(<= ~counter~0 2)} #96#return; {120919#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:09,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {120919#(<= ~counter~0 2)} assume !(~r~0 > 0); {120919#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:09,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {120919#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:09,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {120944#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:09,275 INFO L272 TraceCheckUtils]: 35: Hoare triple {120944#(<= ~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)); {120944#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:09,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {120944#(<= ~counter~0 3)} ~cond := #in~cond; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:09,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {120944#(<= ~counter~0 3)} assume !(0 == ~cond); {120944#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:09,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {120944#(<= ~counter~0 3)} assume true; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:09,276 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120944#(<= ~counter~0 3)} {120944#(<= ~counter~0 3)} #98#return; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:09,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {120944#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {120944#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:09,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {120944#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:09,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {120969#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:09,278 INFO L272 TraceCheckUtils]: 43: Hoare triple {120969#(<= ~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)); {120969#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:09,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {120969#(<= ~counter~0 4)} ~cond := #in~cond; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:09,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {120969#(<= ~counter~0 4)} assume !(0 == ~cond); {120969#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:09,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {120969#(<= ~counter~0 4)} assume true; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:09,280 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120969#(<= ~counter~0 4)} {120969#(<= ~counter~0 4)} #98#return; {120969#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:09,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {120969#(<= ~counter~0 4)} assume !(~r~0 < 0); {120969#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:09,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {120969#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:09,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {120994#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:09,283 INFO L272 TraceCheckUtils]: 51: Hoare triple {120994#(<= ~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)); {120994#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:09,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {120994#(<= ~counter~0 5)} ~cond := #in~cond; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:09,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {120994#(<= ~counter~0 5)} assume !(0 == ~cond); {120994#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:09,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {120994#(<= ~counter~0 5)} assume true; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:09,284 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120994#(<= ~counter~0 5)} {120994#(<= ~counter~0 5)} #94#return; {120994#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:09,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {120994#(<= ~counter~0 5)} assume !!(0 != ~r~0); {120994#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:09,289 INFO L290 TraceCheckUtils]: 57: Hoare triple {120994#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:09,289 INFO L290 TraceCheckUtils]: 58: Hoare triple {121019#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:09,290 INFO L272 TraceCheckUtils]: 59: Hoare triple {121019#(<= ~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)); {121019#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:09,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {121019#(<= ~counter~0 6)} ~cond := #in~cond; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:09,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {121019#(<= ~counter~0 6)} assume !(0 == ~cond); {121019#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:09,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {121019#(<= ~counter~0 6)} assume true; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:09,291 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {121019#(<= ~counter~0 6)} {121019#(<= ~counter~0 6)} #96#return; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:09,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {121019#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121019#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:09,293 INFO L290 TraceCheckUtils]: 65: Hoare triple {121019#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:09,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {121044#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:09,294 INFO L272 TraceCheckUtils]: 67: Hoare triple {121044#(<= ~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)); {121044#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:09,294 INFO L290 TraceCheckUtils]: 68: Hoare triple {121044#(<= ~counter~0 7)} ~cond := #in~cond; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:09,294 INFO L290 TraceCheckUtils]: 69: Hoare triple {121044#(<= ~counter~0 7)} assume !(0 == ~cond); {121044#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:09,295 INFO L290 TraceCheckUtils]: 70: Hoare triple {121044#(<= ~counter~0 7)} assume true; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:09,295 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {121044#(<= ~counter~0 7)} {121044#(<= ~counter~0 7)} #96#return; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:09,295 INFO L290 TraceCheckUtils]: 72: Hoare triple {121044#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121044#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:09,296 INFO L290 TraceCheckUtils]: 73: Hoare triple {121044#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:09,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {121069#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:09,297 INFO L272 TraceCheckUtils]: 75: Hoare triple {121069#(<= ~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)); {121069#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:09,298 INFO L290 TraceCheckUtils]: 76: Hoare triple {121069#(<= ~counter~0 8)} ~cond := #in~cond; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:09,298 INFO L290 TraceCheckUtils]: 77: Hoare triple {121069#(<= ~counter~0 8)} assume !(0 == ~cond); {121069#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:09,298 INFO L290 TraceCheckUtils]: 78: Hoare triple {121069#(<= ~counter~0 8)} assume true; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:09,299 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {121069#(<= ~counter~0 8)} {121069#(<= ~counter~0 8)} #96#return; {121069#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:09,299 INFO L290 TraceCheckUtils]: 80: Hoare triple {121069#(<= ~counter~0 8)} assume !(~r~0 > 0); {121069#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:09,300 INFO L290 TraceCheckUtils]: 81: Hoare triple {121069#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:09,300 INFO L290 TraceCheckUtils]: 82: Hoare triple {121094#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:09,301 INFO L272 TraceCheckUtils]: 83: Hoare triple {121094#(<= ~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)); {121094#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:09,301 INFO L290 TraceCheckUtils]: 84: Hoare triple {121094#(<= ~counter~0 9)} ~cond := #in~cond; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:09,301 INFO L290 TraceCheckUtils]: 85: Hoare triple {121094#(<= ~counter~0 9)} assume !(0 == ~cond); {121094#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:09,302 INFO L290 TraceCheckUtils]: 86: Hoare triple {121094#(<= ~counter~0 9)} assume true; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:09,302 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121094#(<= ~counter~0 9)} {121094#(<= ~counter~0 9)} #98#return; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:09,302 INFO L290 TraceCheckUtils]: 88: Hoare triple {121094#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121094#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:09,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {121094#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:09,304 INFO L290 TraceCheckUtils]: 90: Hoare triple {121119#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:09,304 INFO L272 TraceCheckUtils]: 91: Hoare triple {121119#(<= ~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)); {121119#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:09,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {121119#(<= ~counter~0 10)} ~cond := #in~cond; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:09,305 INFO L290 TraceCheckUtils]: 93: Hoare triple {121119#(<= ~counter~0 10)} assume !(0 == ~cond); {121119#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:09,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {121119#(<= ~counter~0 10)} assume true; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:09,306 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121119#(<= ~counter~0 10)} {121119#(<= ~counter~0 10)} #98#return; {121119#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:09,308 INFO L290 TraceCheckUtils]: 96: Hoare triple {121119#(<= ~counter~0 10)} assume !(~r~0 < 0); {121119#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:09,309 INFO L290 TraceCheckUtils]: 97: Hoare triple {121119#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:09,309 INFO L290 TraceCheckUtils]: 98: Hoare triple {121144#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:09,310 INFO L272 TraceCheckUtils]: 99: Hoare triple {121144#(<= ~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)); {121144#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:09,310 INFO L290 TraceCheckUtils]: 100: Hoare triple {121144#(<= ~counter~0 11)} ~cond := #in~cond; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:09,310 INFO L290 TraceCheckUtils]: 101: Hoare triple {121144#(<= ~counter~0 11)} assume !(0 == ~cond); {121144#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:09,311 INFO L290 TraceCheckUtils]: 102: Hoare triple {121144#(<= ~counter~0 11)} assume true; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:09,311 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121144#(<= ~counter~0 11)} {121144#(<= ~counter~0 11)} #94#return; {121144#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:09,311 INFO L290 TraceCheckUtils]: 104: Hoare triple {121144#(<= ~counter~0 11)} assume !!(0 != ~r~0); {121144#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:09,312 INFO L290 TraceCheckUtils]: 105: Hoare triple {121144#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:09,313 INFO L290 TraceCheckUtils]: 106: Hoare triple {121169#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:09,313 INFO L272 TraceCheckUtils]: 107: Hoare triple {121169#(<= ~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)); {121169#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:09,313 INFO L290 TraceCheckUtils]: 108: Hoare triple {121169#(<= ~counter~0 12)} ~cond := #in~cond; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:09,314 INFO L290 TraceCheckUtils]: 109: Hoare triple {121169#(<= ~counter~0 12)} assume !(0 == ~cond); {121169#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:09,314 INFO L290 TraceCheckUtils]: 110: Hoare triple {121169#(<= ~counter~0 12)} assume true; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:09,314 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121169#(<= ~counter~0 12)} {121169#(<= ~counter~0 12)} #96#return; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:09,315 INFO L290 TraceCheckUtils]: 112: Hoare triple {121169#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121169#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:09,316 INFO L290 TraceCheckUtils]: 113: Hoare triple {121169#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:09,316 INFO L290 TraceCheckUtils]: 114: Hoare triple {121194#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:09,317 INFO L272 TraceCheckUtils]: 115: Hoare triple {121194#(<= ~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)); {121194#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:09,317 INFO L290 TraceCheckUtils]: 116: Hoare triple {121194#(<= ~counter~0 13)} ~cond := #in~cond; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:09,317 INFO L290 TraceCheckUtils]: 117: Hoare triple {121194#(<= ~counter~0 13)} assume !(0 == ~cond); {121194#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:09,317 INFO L290 TraceCheckUtils]: 118: Hoare triple {121194#(<= ~counter~0 13)} assume true; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:09,318 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121194#(<= ~counter~0 13)} {121194#(<= ~counter~0 13)} #96#return; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:09,318 INFO L290 TraceCheckUtils]: 120: Hoare triple {121194#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121194#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:09,319 INFO L290 TraceCheckUtils]: 121: Hoare triple {121194#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:09,319 INFO L290 TraceCheckUtils]: 122: Hoare triple {121219#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:09,320 INFO L272 TraceCheckUtils]: 123: Hoare triple {121219#(<= ~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)); {121219#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:09,320 INFO L290 TraceCheckUtils]: 124: Hoare triple {121219#(<= ~counter~0 14)} ~cond := #in~cond; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:09,321 INFO L290 TraceCheckUtils]: 125: Hoare triple {121219#(<= ~counter~0 14)} assume !(0 == ~cond); {121219#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:09,321 INFO L290 TraceCheckUtils]: 126: Hoare triple {121219#(<= ~counter~0 14)} assume true; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:09,321 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121219#(<= ~counter~0 14)} {121219#(<= ~counter~0 14)} #96#return; {121219#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:09,322 INFO L290 TraceCheckUtils]: 128: Hoare triple {121219#(<= ~counter~0 14)} assume !(~r~0 > 0); {121219#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:09,323 INFO L290 TraceCheckUtils]: 129: Hoare triple {121219#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121244#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:09,323 INFO L290 TraceCheckUtils]: 130: Hoare triple {121244#(<= ~counter~0 15)} assume !(#t~post8 < 50);havoc #t~post8; {121244#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:09,323 INFO L290 TraceCheckUtils]: 131: Hoare triple {121244#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121251#(<= |main_#t~post6| 15)} is VALID [2022-04-08 06:10:09,324 INFO L290 TraceCheckUtils]: 132: Hoare triple {121251#(<= |main_#t~post6| 15)} assume !(#t~post6 < 50);havoc #t~post6; {120838#false} is VALID [2022-04-08 06:10:09,324 INFO L272 TraceCheckUtils]: 133: Hoare triple {120838#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)); {120838#false} is VALID [2022-04-08 06:10:09,324 INFO L290 TraceCheckUtils]: 134: Hoare triple {120838#false} ~cond := #in~cond; {120838#false} is VALID [2022-04-08 06:10:09,324 INFO L290 TraceCheckUtils]: 135: Hoare triple {120838#false} assume 0 == ~cond; {120838#false} is VALID [2022-04-08 06:10:09,324 INFO L290 TraceCheckUtils]: 136: Hoare triple {120838#false} assume !false; {120838#false} is VALID [2022-04-08 06:10:09,324 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-08 06:10:09,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:10:10,297 INFO L290 TraceCheckUtils]: 136: Hoare triple {120838#false} assume !false; {120838#false} is VALID [2022-04-08 06:10:10,298 INFO L290 TraceCheckUtils]: 135: Hoare triple {120838#false} assume 0 == ~cond; {120838#false} is VALID [2022-04-08 06:10:10,298 INFO L290 TraceCheckUtils]: 134: Hoare triple {120838#false} ~cond := #in~cond; {120838#false} is VALID [2022-04-08 06:10:10,298 INFO L272 TraceCheckUtils]: 133: Hoare triple {120838#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)); {120838#false} is VALID [2022-04-08 06:10:10,298 INFO L290 TraceCheckUtils]: 132: Hoare triple {121279#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {120838#false} is VALID [2022-04-08 06:10:10,298 INFO L290 TraceCheckUtils]: 131: Hoare triple {121283#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121279#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:10:10,299 INFO L290 TraceCheckUtils]: 130: Hoare triple {121283#(< ~counter~0 50)} assume !(#t~post8 < 50);havoc #t~post8; {121283#(< ~counter~0 50)} is VALID [2022-04-08 06:10:10,301 INFO L290 TraceCheckUtils]: 129: Hoare triple {121290#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121283#(< ~counter~0 50)} is VALID [2022-04-08 06:10:10,301 INFO L290 TraceCheckUtils]: 128: Hoare triple {121290#(< ~counter~0 49)} assume !(~r~0 > 0); {121290#(< ~counter~0 49)} is VALID [2022-04-08 06:10:10,302 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {120837#true} {121290#(< ~counter~0 49)} #96#return; {121290#(< ~counter~0 49)} is VALID [2022-04-08 06:10:10,302 INFO L290 TraceCheckUtils]: 126: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,302 INFO L290 TraceCheckUtils]: 125: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,302 INFO L290 TraceCheckUtils]: 124: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,302 INFO L272 TraceCheckUtils]: 123: Hoare triple {121290#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,302 INFO L290 TraceCheckUtils]: 122: Hoare triple {121290#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {121290#(< ~counter~0 49)} is VALID [2022-04-08 06:10:10,303 INFO L290 TraceCheckUtils]: 121: Hoare triple {121315#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121290#(< ~counter~0 49)} is VALID [2022-04-08 06:10:10,304 INFO L290 TraceCheckUtils]: 120: Hoare triple {121315#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121315#(< ~counter~0 48)} is VALID [2022-04-08 06:10:10,304 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {120837#true} {121315#(< ~counter~0 48)} #96#return; {121315#(< ~counter~0 48)} is VALID [2022-04-08 06:10:10,304 INFO L290 TraceCheckUtils]: 118: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,304 INFO L290 TraceCheckUtils]: 117: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,304 INFO L290 TraceCheckUtils]: 116: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,304 INFO L272 TraceCheckUtils]: 115: Hoare triple {121315#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,305 INFO L290 TraceCheckUtils]: 114: Hoare triple {121315#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {121315#(< ~counter~0 48)} is VALID [2022-04-08 06:10:10,306 INFO L290 TraceCheckUtils]: 113: Hoare triple {121340#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121315#(< ~counter~0 48)} is VALID [2022-04-08 06:10:10,306 INFO L290 TraceCheckUtils]: 112: Hoare triple {121340#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121340#(< ~counter~0 47)} is VALID [2022-04-08 06:10:10,307 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {120837#true} {121340#(< ~counter~0 47)} #96#return; {121340#(< ~counter~0 47)} is VALID [2022-04-08 06:10:10,307 INFO L290 TraceCheckUtils]: 110: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,307 INFO L290 TraceCheckUtils]: 109: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,307 INFO L290 TraceCheckUtils]: 108: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,307 INFO L272 TraceCheckUtils]: 107: Hoare triple {121340#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,307 INFO L290 TraceCheckUtils]: 106: Hoare triple {121340#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {121340#(< ~counter~0 47)} is VALID [2022-04-08 06:10:10,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {121365#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121340#(< ~counter~0 47)} is VALID [2022-04-08 06:10:10,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {121365#(< ~counter~0 46)} assume !!(0 != ~r~0); {121365#(< ~counter~0 46)} is VALID [2022-04-08 06:10:10,309 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {120837#true} {121365#(< ~counter~0 46)} #94#return; {121365#(< ~counter~0 46)} is VALID [2022-04-08 06:10:10,309 INFO L290 TraceCheckUtils]: 102: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,309 INFO L290 TraceCheckUtils]: 101: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,309 INFO L290 TraceCheckUtils]: 100: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,309 INFO L272 TraceCheckUtils]: 99: Hoare triple {121365#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,309 INFO L290 TraceCheckUtils]: 98: Hoare triple {121365#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {121365#(< ~counter~0 46)} is VALID [2022-04-08 06:10:10,310 INFO L290 TraceCheckUtils]: 97: Hoare triple {121390#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121365#(< ~counter~0 46)} is VALID [2022-04-08 06:10:10,311 INFO L290 TraceCheckUtils]: 96: Hoare triple {121390#(< ~counter~0 45)} assume !(~r~0 < 0); {121390#(< ~counter~0 45)} is VALID [2022-04-08 06:10:10,311 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {120837#true} {121390#(< ~counter~0 45)} #98#return; {121390#(< ~counter~0 45)} is VALID [2022-04-08 06:10:10,311 INFO L290 TraceCheckUtils]: 94: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,311 INFO L290 TraceCheckUtils]: 93: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,311 INFO L290 TraceCheckUtils]: 92: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,312 INFO L272 TraceCheckUtils]: 91: Hoare triple {121390#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,312 INFO L290 TraceCheckUtils]: 90: Hoare triple {121390#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {121390#(< ~counter~0 45)} is VALID [2022-04-08 06:10:10,313 INFO L290 TraceCheckUtils]: 89: Hoare triple {121415#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121390#(< ~counter~0 45)} is VALID [2022-04-08 06:10:10,313 INFO L290 TraceCheckUtils]: 88: Hoare triple {121415#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121415#(< ~counter~0 44)} is VALID [2022-04-08 06:10:10,314 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {120837#true} {121415#(< ~counter~0 44)} #98#return; {121415#(< ~counter~0 44)} is VALID [2022-04-08 06:10:10,314 INFO L290 TraceCheckUtils]: 86: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,314 INFO L290 TraceCheckUtils]: 85: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,314 INFO L290 TraceCheckUtils]: 84: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,314 INFO L272 TraceCheckUtils]: 83: Hoare triple {121415#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,314 INFO L290 TraceCheckUtils]: 82: Hoare triple {121415#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {121415#(< ~counter~0 44)} is VALID [2022-04-08 06:10:10,315 INFO L290 TraceCheckUtils]: 81: Hoare triple {121440#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121415#(< ~counter~0 44)} is VALID [2022-04-08 06:10:10,315 INFO L290 TraceCheckUtils]: 80: Hoare triple {121440#(< ~counter~0 43)} assume !(~r~0 > 0); {121440#(< ~counter~0 43)} is VALID [2022-04-08 06:10:10,316 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120837#true} {121440#(< ~counter~0 43)} #96#return; {121440#(< ~counter~0 43)} is VALID [2022-04-08 06:10:10,316 INFO L290 TraceCheckUtils]: 78: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,316 INFO L272 TraceCheckUtils]: 75: Hoare triple {121440#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {121440#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {121440#(< ~counter~0 43)} is VALID [2022-04-08 06:10:10,318 INFO L290 TraceCheckUtils]: 73: Hoare triple {121465#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121440#(< ~counter~0 43)} is VALID [2022-04-08 06:10:10,318 INFO L290 TraceCheckUtils]: 72: Hoare triple {121465#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121465#(< ~counter~0 42)} is VALID [2022-04-08 06:10:10,318 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120837#true} {121465#(< ~counter~0 42)} #96#return; {121465#(< ~counter~0 42)} is VALID [2022-04-08 06:10:10,318 INFO L290 TraceCheckUtils]: 70: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,319 INFO L272 TraceCheckUtils]: 67: Hoare triple {121465#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {121465#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {121465#(< ~counter~0 42)} is VALID [2022-04-08 06:10:10,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {121490#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121465#(< ~counter~0 42)} is VALID [2022-04-08 06:10:10,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {121490#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121490#(< ~counter~0 41)} is VALID [2022-04-08 06:10:10,321 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120837#true} {121490#(< ~counter~0 41)} #96#return; {121490#(< ~counter~0 41)} is VALID [2022-04-08 06:10:10,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,321 INFO L272 TraceCheckUtils]: 59: Hoare triple {121490#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {121490#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {121490#(< ~counter~0 41)} is VALID [2022-04-08 06:10:10,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {121515#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121490#(< ~counter~0 41)} is VALID [2022-04-08 06:10:10,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {121515#(< ~counter~0 40)} assume !!(0 != ~r~0); {121515#(< ~counter~0 40)} is VALID [2022-04-08 06:10:10,323 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120837#true} {121515#(< ~counter~0 40)} #94#return; {121515#(< ~counter~0 40)} is VALID [2022-04-08 06:10:10,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,323 INFO L272 TraceCheckUtils]: 51: Hoare triple {121515#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {121515#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {121515#(< ~counter~0 40)} is VALID [2022-04-08 06:10:10,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {121540#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121515#(< ~counter~0 40)} is VALID [2022-04-08 06:10:10,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {121540#(< ~counter~0 39)} assume !(~r~0 < 0); {121540#(< ~counter~0 39)} is VALID [2022-04-08 06:10:10,325 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120837#true} {121540#(< ~counter~0 39)} #98#return; {121540#(< ~counter~0 39)} is VALID [2022-04-08 06:10:10,326 INFO L290 TraceCheckUtils]: 46: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,326 INFO L290 TraceCheckUtils]: 45: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,326 INFO L272 TraceCheckUtils]: 43: Hoare triple {121540#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {121540#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {121540#(< ~counter~0 39)} is VALID [2022-04-08 06:10:10,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {121565#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121540#(< ~counter~0 39)} is VALID [2022-04-08 06:10:10,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {121565#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121565#(< ~counter~0 38)} is VALID [2022-04-08 06:10:10,328 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120837#true} {121565#(< ~counter~0 38)} #98#return; {121565#(< ~counter~0 38)} is VALID [2022-04-08 06:10:10,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,328 INFO L272 TraceCheckUtils]: 35: Hoare triple {121565#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {121565#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {121565#(< ~counter~0 38)} is VALID [2022-04-08 06:10:10,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {121590#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121565#(< ~counter~0 38)} is VALID [2022-04-08 06:10:10,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {121590#(< ~counter~0 37)} assume !(~r~0 > 0); {121590#(< ~counter~0 37)} is VALID [2022-04-08 06:10:10,330 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120837#true} {121590#(< ~counter~0 37)} #96#return; {121590#(< ~counter~0 37)} is VALID [2022-04-08 06:10:10,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,331 INFO L272 TraceCheckUtils]: 27: Hoare triple {121590#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {121590#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {121590#(< ~counter~0 37)} is VALID [2022-04-08 06:10:10,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {121615#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121590#(< ~counter~0 37)} is VALID [2022-04-08 06:10:10,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {121615#(< ~counter~0 36)} assume !!(0 != ~r~0); {121615#(< ~counter~0 36)} is VALID [2022-04-08 06:10:10,333 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120837#true} {121615#(< ~counter~0 36)} #94#return; {121615#(< ~counter~0 36)} is VALID [2022-04-08 06:10:10,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,333 INFO L272 TraceCheckUtils]: 19: Hoare triple {121615#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {121615#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {121615#(< ~counter~0 36)} is VALID [2022-04-08 06:10:10,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {121640#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121615#(< ~counter~0 36)} is VALID [2022-04-08 06:10:10,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {121640#(< ~counter~0 35)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {121640#(< ~counter~0 35)} is VALID [2022-04-08 06:10:10,335 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120837#true} {121640#(< ~counter~0 35)} #92#return; {121640#(< ~counter~0 35)} is VALID [2022-04-08 06:10:10,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,335 INFO L272 TraceCheckUtils]: 11: Hoare triple {121640#(< ~counter~0 35)} 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)); {120837#true} is VALID [2022-04-08 06:10:10,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120837#true} {121640#(< ~counter~0 35)} #90#return; {121640#(< ~counter~0 35)} is VALID [2022-04-08 06:10:10,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-08 06:10:10,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-08 06:10:10,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-08 06:10:10,336 INFO L272 TraceCheckUtils]: 6: Hoare triple {121640#(< ~counter~0 35)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120837#true} is VALID [2022-04-08 06:10:10,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {121640#(< ~counter~0 35)} 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; {121640#(< ~counter~0 35)} is VALID [2022-04-08 06:10:10,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {121640#(< ~counter~0 35)} call #t~ret9 := main(); {121640#(< ~counter~0 35)} is VALID [2022-04-08 06:10:10,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121640#(< ~counter~0 35)} {120837#true} #102#return; {121640#(< ~counter~0 35)} is VALID [2022-04-08 06:10:10,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {121640#(< ~counter~0 35)} assume true; {121640#(< ~counter~0 35)} is VALID [2022-04-08 06:10:10,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {120837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {121640#(< ~counter~0 35)} is VALID [2022-04-08 06:10:10,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {120837#true} call ULTIMATE.init(); {120837#true} is VALID [2022-04-08 06:10:10,338 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-08 06:10:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:10,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924666035] [2022-04-08 06:10:10,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:10,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800022169] [2022-04-08 06:10:10,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800022169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:10:10,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:10:10,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 06:10:10,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [34802052] [2022-04-08 06:10:10,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [34802052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:10,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:10,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 06:10:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702608570] [2022-04-08 06:10:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:10,339 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-08 06:10:10,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:10,340 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-08 06:10:10,468 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-08 06:10:10,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 06:10:10,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 06:10:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 06:10:10,469 INFO L87 Difference]: Start difference. First operand 707 states and 950 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-08 06:10:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:15,331 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2022-04-08 06:10:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 06:10:15,331 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-08 06:10:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:15,331 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-08 06:10:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 06:10:15,333 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-08 06:10:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 06:10:15,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-08 06:10:15,711 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-08 06:10:15,738 INFO L225 Difference]: With dead ends: 807 [2022-04-08 06:10:15,738 INFO L226 Difference]: Without dead ends: 802 [2022-04-08 06:10:15,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=953, Invalid=1303, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 06:10:15,739 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 293 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 06:10:15,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 336 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 06:10:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-04-08 06:10:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 775. [2022-04-08 06:10:18,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:10:18,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:10:18,592 INFO L74 IsIncluded]: Start isIncluded. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:10:18,592 INFO L87 Difference]: Start difference. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:10:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:18,614 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-08 06:10:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-08 06:10:18,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:18,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:18,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-08 06:10:18,616 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-08 06:10:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:18,637 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-08 06:10:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-08 06:10:18,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:18,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:18,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:10:18,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:10:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:10:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1047 transitions. [2022-04-08 06:10:18,683 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1047 transitions. Word has length 137 [2022-04-08 06:10:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:10:18,683 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1047 transitions. [2022-04-08 06:10:18,683 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-08 06:10:18,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1047 transitions. [2022-04-08 06:10:30,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1047 edges. 1044 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1047 transitions. [2022-04-08 06:10:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-08 06:10:30,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:30,958 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-08 06:10:30,962 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-08 06:10:31,158 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-08 06:10:31,159 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 19 times [2022-04-08 06:10:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:31,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612418835] [2022-04-08 06:10:31,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 20 times [2022-04-08 06:10:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:31,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26002440] [2022-04-08 06:10:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:31,172 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:31,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298969169] [2022-04-08 06:10:31,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:10:31,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:31,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:31,174 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-08 06:10:31,178 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-08 06:10:31,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:10:31,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:31,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 06:10:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:31,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:32,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {126486#true} call ULTIMATE.init(); {126486#true} is VALID [2022-04-08 06:10:32,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {126486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126494#(<= ~counter~0 0)} {126486#true} #102#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {126494#(<= ~counter~0 0)} call #t~ret9 := main(); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {126494#(<= ~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; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,092 INFO L272 TraceCheckUtils]: 6: Hoare triple {126494#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {126494#(<= ~counter~0 0)} ~cond := #in~cond; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {126494#(<= ~counter~0 0)} assume !(0 == ~cond); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126494#(<= ~counter~0 0)} {126494#(<= ~counter~0 0)} #90#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,093 INFO L272 TraceCheckUtils]: 11: Hoare triple {126494#(<= ~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)); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {126494#(<= ~counter~0 0)} ~cond := #in~cond; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {126494#(<= ~counter~0 0)} assume !(0 == ~cond); {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,095 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126494#(<= ~counter~0 0)} {126494#(<= ~counter~0 0)} #92#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {126494#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {126494#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {126494#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {126543#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,099 INFO L272 TraceCheckUtils]: 19: Hoare triple {126543#(<= ~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)); {126543#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {126543#(<= ~counter~0 1)} ~cond := #in~cond; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {126543#(<= ~counter~0 1)} assume !(0 == ~cond); {126543#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {126543#(<= ~counter~0 1)} assume true; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,100 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126543#(<= ~counter~0 1)} {126543#(<= ~counter~0 1)} #94#return; {126543#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {126543#(<= ~counter~0 1)} assume !!(0 != ~r~0); {126543#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {126543#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {126568#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,103 INFO L272 TraceCheckUtils]: 27: Hoare triple {126568#(<= ~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)); {126568#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {126568#(<= ~counter~0 2)} ~cond := #in~cond; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {126568#(<= ~counter~0 2)} assume !(0 == ~cond); {126568#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {126568#(<= ~counter~0 2)} assume true; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,104 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126568#(<= ~counter~0 2)} {126568#(<= ~counter~0 2)} #96#return; {126568#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {126568#(<= ~counter~0 2)} assume !(~r~0 > 0); {126568#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {126568#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {126593#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,107 INFO L272 TraceCheckUtils]: 35: Hoare triple {126593#(<= ~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)); {126593#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {126593#(<= ~counter~0 3)} ~cond := #in~cond; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {126593#(<= ~counter~0 3)} assume !(0 == ~cond); {126593#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {126593#(<= ~counter~0 3)} assume true; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,109 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126593#(<= ~counter~0 3)} {126593#(<= ~counter~0 3)} #98#return; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {126593#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126593#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {126593#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {126618#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,112 INFO L272 TraceCheckUtils]: 43: Hoare triple {126618#(<= ~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)); {126618#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {126618#(<= ~counter~0 4)} ~cond := #in~cond; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {126618#(<= ~counter~0 4)} assume !(0 == ~cond); {126618#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {126618#(<= ~counter~0 4)} assume true; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,114 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126618#(<= ~counter~0 4)} {126618#(<= ~counter~0 4)} #98#return; {126618#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {126618#(<= ~counter~0 4)} assume !(~r~0 < 0); {126618#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {126618#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {126643#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,116 INFO L272 TraceCheckUtils]: 51: Hoare triple {126643#(<= ~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)); {126643#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {126643#(<= ~counter~0 5)} ~cond := #in~cond; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {126643#(<= ~counter~0 5)} assume !(0 == ~cond); {126643#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {126643#(<= ~counter~0 5)} assume true; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,117 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126643#(<= ~counter~0 5)} {126643#(<= ~counter~0 5)} #94#return; {126643#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {126643#(<= ~counter~0 5)} assume !!(0 != ~r~0); {126643#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {126643#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {126668#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,120 INFO L272 TraceCheckUtils]: 59: Hoare triple {126668#(<= ~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)); {126668#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,120 INFO L290 TraceCheckUtils]: 60: Hoare triple {126668#(<= ~counter~0 6)} ~cond := #in~cond; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {126668#(<= ~counter~0 6)} assume !(0 == ~cond); {126668#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {126668#(<= ~counter~0 6)} assume true; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,121 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126668#(<= ~counter~0 6)} {126668#(<= ~counter~0 6)} #96#return; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,121 INFO L290 TraceCheckUtils]: 64: Hoare triple {126668#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126668#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,123 INFO L290 TraceCheckUtils]: 65: Hoare triple {126668#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,123 INFO L290 TraceCheckUtils]: 66: Hoare triple {126693#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,124 INFO L272 TraceCheckUtils]: 67: Hoare triple {126693#(<= ~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)); {126693#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,124 INFO L290 TraceCheckUtils]: 68: Hoare triple {126693#(<= ~counter~0 7)} ~cond := #in~cond; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,124 INFO L290 TraceCheckUtils]: 69: Hoare triple {126693#(<= ~counter~0 7)} assume !(0 == ~cond); {126693#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,125 INFO L290 TraceCheckUtils]: 70: Hoare triple {126693#(<= ~counter~0 7)} assume true; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,125 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126693#(<= ~counter~0 7)} {126693#(<= ~counter~0 7)} #96#return; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,125 INFO L290 TraceCheckUtils]: 72: Hoare triple {126693#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126693#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,127 INFO L290 TraceCheckUtils]: 73: Hoare triple {126693#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {126718#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,128 INFO L272 TraceCheckUtils]: 75: Hoare triple {126718#(<= ~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)); {126718#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,128 INFO L290 TraceCheckUtils]: 76: Hoare triple {126718#(<= ~counter~0 8)} ~cond := #in~cond; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,129 INFO L290 TraceCheckUtils]: 77: Hoare triple {126718#(<= ~counter~0 8)} assume !(0 == ~cond); {126718#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,129 INFO L290 TraceCheckUtils]: 78: Hoare triple {126718#(<= ~counter~0 8)} assume true; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,129 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126718#(<= ~counter~0 8)} {126718#(<= ~counter~0 8)} #96#return; {126718#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,130 INFO L290 TraceCheckUtils]: 80: Hoare triple {126718#(<= ~counter~0 8)} assume !(~r~0 > 0); {126718#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,131 INFO L290 TraceCheckUtils]: 81: Hoare triple {126718#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,132 INFO L290 TraceCheckUtils]: 82: Hoare triple {126743#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,132 INFO L272 TraceCheckUtils]: 83: Hoare triple {126743#(<= ~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)); {126743#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,132 INFO L290 TraceCheckUtils]: 84: Hoare triple {126743#(<= ~counter~0 9)} ~cond := #in~cond; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,133 INFO L290 TraceCheckUtils]: 85: Hoare triple {126743#(<= ~counter~0 9)} assume !(0 == ~cond); {126743#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,133 INFO L290 TraceCheckUtils]: 86: Hoare triple {126743#(<= ~counter~0 9)} assume true; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,133 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126743#(<= ~counter~0 9)} {126743#(<= ~counter~0 9)} #98#return; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,134 INFO L290 TraceCheckUtils]: 88: Hoare triple {126743#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126743#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,135 INFO L290 TraceCheckUtils]: 89: Hoare triple {126743#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,136 INFO L290 TraceCheckUtils]: 90: Hoare triple {126768#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,136 INFO L272 TraceCheckUtils]: 91: Hoare triple {126768#(<= ~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)); {126768#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,137 INFO L290 TraceCheckUtils]: 92: Hoare triple {126768#(<= ~counter~0 10)} ~cond := #in~cond; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,137 INFO L290 TraceCheckUtils]: 93: Hoare triple {126768#(<= ~counter~0 10)} assume !(0 == ~cond); {126768#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,137 INFO L290 TraceCheckUtils]: 94: Hoare triple {126768#(<= ~counter~0 10)} assume true; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,138 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126768#(<= ~counter~0 10)} {126768#(<= ~counter~0 10)} #98#return; {126768#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,138 INFO L290 TraceCheckUtils]: 96: Hoare triple {126768#(<= ~counter~0 10)} assume !(~r~0 < 0); {126768#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,140 INFO L290 TraceCheckUtils]: 97: Hoare triple {126768#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,140 INFO L290 TraceCheckUtils]: 98: Hoare triple {126793#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,140 INFO L272 TraceCheckUtils]: 99: Hoare triple {126793#(<= ~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)); {126793#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,141 INFO L290 TraceCheckUtils]: 100: Hoare triple {126793#(<= ~counter~0 11)} ~cond := #in~cond; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,141 INFO L290 TraceCheckUtils]: 101: Hoare triple {126793#(<= ~counter~0 11)} assume !(0 == ~cond); {126793#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,141 INFO L290 TraceCheckUtils]: 102: Hoare triple {126793#(<= ~counter~0 11)} assume true; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,142 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126793#(<= ~counter~0 11)} {126793#(<= ~counter~0 11)} #94#return; {126793#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,142 INFO L290 TraceCheckUtils]: 104: Hoare triple {126793#(<= ~counter~0 11)} assume !!(0 != ~r~0); {126793#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,144 INFO L290 TraceCheckUtils]: 105: Hoare triple {126793#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,144 INFO L290 TraceCheckUtils]: 106: Hoare triple {126818#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,145 INFO L272 TraceCheckUtils]: 107: Hoare triple {126818#(<= ~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)); {126818#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,145 INFO L290 TraceCheckUtils]: 108: Hoare triple {126818#(<= ~counter~0 12)} ~cond := #in~cond; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,145 INFO L290 TraceCheckUtils]: 109: Hoare triple {126818#(<= ~counter~0 12)} assume !(0 == ~cond); {126818#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,146 INFO L290 TraceCheckUtils]: 110: Hoare triple {126818#(<= ~counter~0 12)} assume true; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,146 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126818#(<= ~counter~0 12)} {126818#(<= ~counter~0 12)} #96#return; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,146 INFO L290 TraceCheckUtils]: 112: Hoare triple {126818#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126818#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,148 INFO L290 TraceCheckUtils]: 113: Hoare triple {126818#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,149 INFO L290 TraceCheckUtils]: 114: Hoare triple {126843#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,149 INFO L272 TraceCheckUtils]: 115: Hoare triple {126843#(<= ~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)); {126843#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,150 INFO L290 TraceCheckUtils]: 116: Hoare triple {126843#(<= ~counter~0 13)} ~cond := #in~cond; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,150 INFO L290 TraceCheckUtils]: 117: Hoare triple {126843#(<= ~counter~0 13)} assume !(0 == ~cond); {126843#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,150 INFO L290 TraceCheckUtils]: 118: Hoare triple {126843#(<= ~counter~0 13)} assume true; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,151 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126843#(<= ~counter~0 13)} {126843#(<= ~counter~0 13)} #96#return; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,151 INFO L290 TraceCheckUtils]: 120: Hoare triple {126843#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126843#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,153 INFO L290 TraceCheckUtils]: 121: Hoare triple {126843#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,153 INFO L290 TraceCheckUtils]: 122: Hoare triple {126868#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,154 INFO L272 TraceCheckUtils]: 123: Hoare triple {126868#(<= ~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)); {126868#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,154 INFO L290 TraceCheckUtils]: 124: Hoare triple {126868#(<= ~counter~0 14)} ~cond := #in~cond; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,154 INFO L290 TraceCheckUtils]: 125: Hoare triple {126868#(<= ~counter~0 14)} assume !(0 == ~cond); {126868#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,154 INFO L290 TraceCheckUtils]: 126: Hoare triple {126868#(<= ~counter~0 14)} assume true; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,155 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126868#(<= ~counter~0 14)} {126868#(<= ~counter~0 14)} #96#return; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,155 INFO L290 TraceCheckUtils]: 128: Hoare triple {126868#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126868#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,156 INFO L290 TraceCheckUtils]: 129: Hoare triple {126868#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126893#(<= |main_#t~post7| 14)} is VALID [2022-04-08 06:10:32,156 INFO L290 TraceCheckUtils]: 130: Hoare triple {126893#(<= |main_#t~post7| 14)} assume !(#t~post7 < 50);havoc #t~post7; {126487#false} is VALID [2022-04-08 06:10:32,156 INFO L290 TraceCheckUtils]: 131: Hoare triple {126487#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126487#false} is VALID [2022-04-08 06:10:32,156 INFO L290 TraceCheckUtils]: 132: Hoare triple {126487#false} assume !(#t~post8 < 50);havoc #t~post8; {126487#false} is VALID [2022-04-08 06:10:32,156 INFO L290 TraceCheckUtils]: 133: Hoare triple {126487#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126487#false} is VALID [2022-04-08 06:10:32,156 INFO L290 TraceCheckUtils]: 134: Hoare triple {126487#false} assume !(#t~post6 < 50);havoc #t~post6; {126487#false} is VALID [2022-04-08 06:10:32,156 INFO L272 TraceCheckUtils]: 135: Hoare triple {126487#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)); {126487#false} is VALID [2022-04-08 06:10:32,156 INFO L290 TraceCheckUtils]: 136: Hoare triple {126487#false} ~cond := #in~cond; {126487#false} is VALID [2022-04-08 06:10:32,156 INFO L290 TraceCheckUtils]: 137: Hoare triple {126487#false} assume 0 == ~cond; {126487#false} is VALID [2022-04-08 06:10:32,157 INFO L290 TraceCheckUtils]: 138: Hoare triple {126487#false} assume !false; {126487#false} is VALID [2022-04-08 06:10:32,157 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-08 06:10:32,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:10:33,111 INFO L290 TraceCheckUtils]: 138: Hoare triple {126487#false} assume !false; {126487#false} is VALID [2022-04-08 06:10:33,111 INFO L290 TraceCheckUtils]: 137: Hoare triple {126487#false} assume 0 == ~cond; {126487#false} is VALID [2022-04-08 06:10:33,111 INFO L290 TraceCheckUtils]: 136: Hoare triple {126487#false} ~cond := #in~cond; {126487#false} is VALID [2022-04-08 06:10:33,111 INFO L272 TraceCheckUtils]: 135: Hoare triple {126487#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)); {126487#false} is VALID [2022-04-08 06:10:33,112 INFO L290 TraceCheckUtils]: 134: Hoare triple {126487#false} assume !(#t~post6 < 50);havoc #t~post6; {126487#false} is VALID [2022-04-08 06:10:33,112 INFO L290 TraceCheckUtils]: 133: Hoare triple {126487#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126487#false} is VALID [2022-04-08 06:10:33,112 INFO L290 TraceCheckUtils]: 132: Hoare triple {126487#false} assume !(#t~post8 < 50);havoc #t~post8; {126487#false} is VALID [2022-04-08 06:10:33,112 INFO L290 TraceCheckUtils]: 131: Hoare triple {126487#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126487#false} is VALID [2022-04-08 06:10:33,112 INFO L290 TraceCheckUtils]: 130: Hoare triple {126945#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {126487#false} is VALID [2022-04-08 06:10:33,112 INFO L290 TraceCheckUtils]: 129: Hoare triple {126949#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126945#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:10:33,113 INFO L290 TraceCheckUtils]: 128: Hoare triple {126949#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126949#(< ~counter~0 50)} is VALID [2022-04-08 06:10:33,113 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126486#true} {126949#(< ~counter~0 50)} #96#return; {126949#(< ~counter~0 50)} is VALID [2022-04-08 06:10:33,113 INFO L290 TraceCheckUtils]: 126: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,113 INFO L290 TraceCheckUtils]: 125: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,113 INFO L290 TraceCheckUtils]: 124: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,113 INFO L272 TraceCheckUtils]: 123: Hoare triple {126949#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,114 INFO L290 TraceCheckUtils]: 122: Hoare triple {126949#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {126949#(< ~counter~0 50)} is VALID [2022-04-08 06:10:33,117 INFO L290 TraceCheckUtils]: 121: Hoare triple {126974#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126949#(< ~counter~0 50)} is VALID [2022-04-08 06:10:33,117 INFO L290 TraceCheckUtils]: 120: Hoare triple {126974#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126974#(< ~counter~0 49)} is VALID [2022-04-08 06:10:33,117 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126486#true} {126974#(< ~counter~0 49)} #96#return; {126974#(< ~counter~0 49)} is VALID [2022-04-08 06:10:33,118 INFO L290 TraceCheckUtils]: 118: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,118 INFO L290 TraceCheckUtils]: 117: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,118 INFO L290 TraceCheckUtils]: 116: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,118 INFO L272 TraceCheckUtils]: 115: Hoare triple {126974#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,118 INFO L290 TraceCheckUtils]: 114: Hoare triple {126974#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {126974#(< ~counter~0 49)} is VALID [2022-04-08 06:10:33,119 INFO L290 TraceCheckUtils]: 113: Hoare triple {126999#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126974#(< ~counter~0 49)} is VALID [2022-04-08 06:10:33,120 INFO L290 TraceCheckUtils]: 112: Hoare triple {126999#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126999#(< ~counter~0 48)} is VALID [2022-04-08 06:10:33,120 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126486#true} {126999#(< ~counter~0 48)} #96#return; {126999#(< ~counter~0 48)} is VALID [2022-04-08 06:10:33,120 INFO L290 TraceCheckUtils]: 110: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,120 INFO L290 TraceCheckUtils]: 109: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,120 INFO L272 TraceCheckUtils]: 107: Hoare triple {126999#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,121 INFO L290 TraceCheckUtils]: 106: Hoare triple {126999#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {126999#(< ~counter~0 48)} is VALID [2022-04-08 06:10:33,122 INFO L290 TraceCheckUtils]: 105: Hoare triple {127024#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126999#(< ~counter~0 48)} is VALID [2022-04-08 06:10:33,122 INFO L290 TraceCheckUtils]: 104: Hoare triple {127024#(< ~counter~0 47)} assume !!(0 != ~r~0); {127024#(< ~counter~0 47)} is VALID [2022-04-08 06:10:33,123 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126486#true} {127024#(< ~counter~0 47)} #94#return; {127024#(< ~counter~0 47)} is VALID [2022-04-08 06:10:33,123 INFO L290 TraceCheckUtils]: 102: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,123 INFO L290 TraceCheckUtils]: 101: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,123 INFO L290 TraceCheckUtils]: 100: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,123 INFO L272 TraceCheckUtils]: 99: Hoare triple {127024#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,124 INFO L290 TraceCheckUtils]: 98: Hoare triple {127024#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {127024#(< ~counter~0 47)} is VALID [2022-04-08 06:10:33,125 INFO L290 TraceCheckUtils]: 97: Hoare triple {127049#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127024#(< ~counter~0 47)} is VALID [2022-04-08 06:10:33,126 INFO L290 TraceCheckUtils]: 96: Hoare triple {127049#(< ~counter~0 46)} assume !(~r~0 < 0); {127049#(< ~counter~0 46)} is VALID [2022-04-08 06:10:33,126 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126486#true} {127049#(< ~counter~0 46)} #98#return; {127049#(< ~counter~0 46)} is VALID [2022-04-08 06:10:33,126 INFO L290 TraceCheckUtils]: 94: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,126 INFO L290 TraceCheckUtils]: 93: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,126 INFO L290 TraceCheckUtils]: 92: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,126 INFO L272 TraceCheckUtils]: 91: Hoare triple {127049#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,127 INFO L290 TraceCheckUtils]: 90: Hoare triple {127049#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {127049#(< ~counter~0 46)} is VALID [2022-04-08 06:10:33,129 INFO L290 TraceCheckUtils]: 89: Hoare triple {127074#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127049#(< ~counter~0 46)} is VALID [2022-04-08 06:10:33,129 INFO L290 TraceCheckUtils]: 88: Hoare triple {127074#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127074#(< ~counter~0 45)} is VALID [2022-04-08 06:10:33,130 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126486#true} {127074#(< ~counter~0 45)} #98#return; {127074#(< ~counter~0 45)} is VALID [2022-04-08 06:10:33,130 INFO L290 TraceCheckUtils]: 86: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,130 INFO L290 TraceCheckUtils]: 85: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,130 INFO L290 TraceCheckUtils]: 84: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,130 INFO L272 TraceCheckUtils]: 83: Hoare triple {127074#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,130 INFO L290 TraceCheckUtils]: 82: Hoare triple {127074#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {127074#(< ~counter~0 45)} is VALID [2022-04-08 06:10:33,132 INFO L290 TraceCheckUtils]: 81: Hoare triple {127099#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127074#(< ~counter~0 45)} is VALID [2022-04-08 06:10:33,133 INFO L290 TraceCheckUtils]: 80: Hoare triple {127099#(< ~counter~0 44)} assume !(~r~0 > 0); {127099#(< ~counter~0 44)} is VALID [2022-04-08 06:10:33,133 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126486#true} {127099#(< ~counter~0 44)} #96#return; {127099#(< ~counter~0 44)} is VALID [2022-04-08 06:10:33,134 INFO L290 TraceCheckUtils]: 78: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,134 INFO L290 TraceCheckUtils]: 77: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,134 INFO L290 TraceCheckUtils]: 76: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,134 INFO L272 TraceCheckUtils]: 75: Hoare triple {127099#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,134 INFO L290 TraceCheckUtils]: 74: Hoare triple {127099#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {127099#(< ~counter~0 44)} is VALID [2022-04-08 06:10:33,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {127124#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127099#(< ~counter~0 44)} is VALID [2022-04-08 06:10:33,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {127124#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127124#(< ~counter~0 43)} is VALID [2022-04-08 06:10:33,137 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126486#true} {127124#(< ~counter~0 43)} #96#return; {127124#(< ~counter~0 43)} is VALID [2022-04-08 06:10:33,137 INFO L290 TraceCheckUtils]: 70: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,137 INFO L290 TraceCheckUtils]: 69: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,137 INFO L290 TraceCheckUtils]: 68: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,137 INFO L272 TraceCheckUtils]: 67: Hoare triple {127124#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,138 INFO L290 TraceCheckUtils]: 66: Hoare triple {127124#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {127124#(< ~counter~0 43)} is VALID [2022-04-08 06:10:33,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {127149#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127124#(< ~counter~0 43)} is VALID [2022-04-08 06:10:33,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {127149#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127149#(< ~counter~0 42)} is VALID [2022-04-08 06:10:33,140 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126486#true} {127149#(< ~counter~0 42)} #96#return; {127149#(< ~counter~0 42)} is VALID [2022-04-08 06:10:33,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,140 INFO L272 TraceCheckUtils]: 59: Hoare triple {127149#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {127149#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {127149#(< ~counter~0 42)} is VALID [2022-04-08 06:10:33,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {127174#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127149#(< ~counter~0 42)} is VALID [2022-04-08 06:10:33,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {127174#(< ~counter~0 41)} assume !!(0 != ~r~0); {127174#(< ~counter~0 41)} is VALID [2022-04-08 06:10:33,143 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126486#true} {127174#(< ~counter~0 41)} #94#return; {127174#(< ~counter~0 41)} is VALID [2022-04-08 06:10:33,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,144 INFO L272 TraceCheckUtils]: 51: Hoare triple {127174#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {127174#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {127174#(< ~counter~0 41)} is VALID [2022-04-08 06:10:33,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {127199#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127174#(< ~counter~0 41)} is VALID [2022-04-08 06:10:33,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {127199#(< ~counter~0 40)} assume !(~r~0 < 0); {127199#(< ~counter~0 40)} is VALID [2022-04-08 06:10:33,148 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126486#true} {127199#(< ~counter~0 40)} #98#return; {127199#(< ~counter~0 40)} is VALID [2022-04-08 06:10:33,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,148 INFO L272 TraceCheckUtils]: 43: Hoare triple {127199#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {127199#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {127199#(< ~counter~0 40)} is VALID [2022-04-08 06:10:33,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {127224#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127199#(< ~counter~0 40)} is VALID [2022-04-08 06:10:33,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {127224#(< ~counter~0 39)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127224#(< ~counter~0 39)} is VALID [2022-04-08 06:10:33,152 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126486#true} {127224#(< ~counter~0 39)} #98#return; {127224#(< ~counter~0 39)} is VALID [2022-04-08 06:10:33,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,152 INFO L272 TraceCheckUtils]: 35: Hoare triple {127224#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {127224#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {127224#(< ~counter~0 39)} is VALID [2022-04-08 06:10:33,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {127249#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127224#(< ~counter~0 39)} is VALID [2022-04-08 06:10:33,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {127249#(< ~counter~0 38)} assume !(~r~0 > 0); {127249#(< ~counter~0 38)} is VALID [2022-04-08 06:10:33,156 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126486#true} {127249#(< ~counter~0 38)} #96#return; {127249#(< ~counter~0 38)} is VALID [2022-04-08 06:10:33,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,156 INFO L272 TraceCheckUtils]: 27: Hoare triple {127249#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {127249#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {127249#(< ~counter~0 38)} is VALID [2022-04-08 06:10:33,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {127274#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127249#(< ~counter~0 38)} is VALID [2022-04-08 06:10:33,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {127274#(< ~counter~0 37)} assume !!(0 != ~r~0); {127274#(< ~counter~0 37)} is VALID [2022-04-08 06:10:33,160 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126486#true} {127274#(< ~counter~0 37)} #94#return; {127274#(< ~counter~0 37)} is VALID [2022-04-08 06:10:33,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,161 INFO L272 TraceCheckUtils]: 19: Hoare triple {127274#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {127274#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {127274#(< ~counter~0 37)} is VALID [2022-04-08 06:10:33,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {127299#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127274#(< ~counter~0 37)} is VALID [2022-04-08 06:10:33,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {127299#(< ~counter~0 36)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {127299#(< ~counter~0 36)} is VALID [2022-04-08 06:10:33,164 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126486#true} {127299#(< ~counter~0 36)} #92#return; {127299#(< ~counter~0 36)} is VALID [2022-04-08 06:10:33,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,164 INFO L272 TraceCheckUtils]: 11: Hoare triple {127299#(< ~counter~0 36)} 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)); {126486#true} is VALID [2022-04-08 06:10:33,165 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126486#true} {127299#(< ~counter~0 36)} #90#return; {127299#(< ~counter~0 36)} is VALID [2022-04-08 06:10:33,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-08 06:10:33,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-08 06:10:33,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-08 06:10:33,165 INFO L272 TraceCheckUtils]: 6: Hoare triple {127299#(< ~counter~0 36)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126486#true} is VALID [2022-04-08 06:10:33,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {127299#(< ~counter~0 36)} 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; {127299#(< ~counter~0 36)} is VALID [2022-04-08 06:10:33,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {127299#(< ~counter~0 36)} call #t~ret9 := main(); {127299#(< ~counter~0 36)} is VALID [2022-04-08 06:10:33,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127299#(< ~counter~0 36)} {126486#true} #102#return; {127299#(< ~counter~0 36)} is VALID [2022-04-08 06:10:33,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {127299#(< ~counter~0 36)} assume true; {127299#(< ~counter~0 36)} is VALID [2022-04-08 06:10:33,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {126486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {127299#(< ~counter~0 36)} is VALID [2022-04-08 06:10:33,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {126486#true} call ULTIMATE.init(); {126486#true} is VALID [2022-04-08 06:10:33,167 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-08 06:10:33,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:33,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26002440] [2022-04-08 06:10:33,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:33,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298969169] [2022-04-08 06:10:33,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298969169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:10:33,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:10:33,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-08 06:10:33,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:33,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612418835] [2022-04-08 06:10:33,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612418835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:33,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:33,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 06:10:33,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841426492] [2022-04-08 06:10:33,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:33,168 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-08 06:10:33,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:33,169 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-08 06:10:33,357 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-08 06:10:33,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 06:10:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 06:10:33,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 06:10:33,358 INFO L87 Difference]: Start difference. First operand 775 states and 1047 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-08 06:10:38,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:38,504 INFO L93 Difference]: Finished difference Result 945 states and 1302 transitions. [2022-04-08 06:10:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 06:10:38,505 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-08 06:10:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:38,505 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-08 06:10:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 06:10:38,508 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-08 06:10:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 06:10:38,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-08 06:10:38,876 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-08 06:10:38,901 INFO L225 Difference]: With dead ends: 945 [2022-04-08 06:10:38,901 INFO L226 Difference]: Without dead ends: 775 [2022-04-08 06:10:38,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=917, Invalid=1245, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 06:10:38,902 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:10:38,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 324 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 06:10:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-08 06:10:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-04-08 06:10:41,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:10:41,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:10:41,778 INFO L74 IsIncluded]: Start isIncluded. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:10:41,778 INFO L87 Difference]: Start difference. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:10:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:41,799 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-08 06:10:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 06:10:41,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:41,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:41,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-08 06:10:41,801 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-08 06:10:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:41,821 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-08 06:10:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 06:10:41,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:41,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:41,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:10:41,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:10:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:10:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-04-08 06:10:41,850 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 139 [2022-04-08 06:10:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:10:41,850 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-04-08 06:10:41,850 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-08 06:10:41,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1041 transitions. [2022-04-08 06:10:51,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1041 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 06:10:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 06:10:51,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:51,491 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-08 06:10:51,508 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-08 06:10:51,691 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-08 06:10:51,691 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 25 times [2022-04-08 06:10:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:51,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [960629375] [2022-04-08 06:10:51,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 26 times [2022-04-08 06:10:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:51,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108473504] [2022-04-08 06:10:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:51,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:51,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695947194] [2022-04-08 06:10:51,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:10:51,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:51,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:51,707 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-08 06:10:51,708 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-08 06:10:51,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:10:51,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:51,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 06:10:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:51,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:52,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {132369#true} call ULTIMATE.init(); {132369#true} is VALID [2022-04-08 06:10:52,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {132369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132377#(<= ~counter~0 0)} {132369#true} #102#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {132377#(<= ~counter~0 0)} call #t~ret9 := main(); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {132377#(<= ~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; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {132377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {132377#(<= ~counter~0 0)} ~cond := #in~cond; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {132377#(<= ~counter~0 0)} assume !(0 == ~cond); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,673 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132377#(<= ~counter~0 0)} {132377#(<= ~counter~0 0)} #90#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,673 INFO L272 TraceCheckUtils]: 11: Hoare triple {132377#(<= ~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)); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {132377#(<= ~counter~0 0)} ~cond := #in~cond; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {132377#(<= ~counter~0 0)} assume !(0 == ~cond); {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,675 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132377#(<= ~counter~0 0)} {132377#(<= ~counter~0 0)} #92#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {132377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {132377#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:52,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {132377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:52,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {132426#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:52,678 INFO L272 TraceCheckUtils]: 19: Hoare triple {132426#(<= ~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)); {132426#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:52,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {132426#(<= ~counter~0 1)} ~cond := #in~cond; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:52,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {132426#(<= ~counter~0 1)} assume !(0 == ~cond); {132426#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:52,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {132426#(<= ~counter~0 1)} assume true; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:52,679 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132426#(<= ~counter~0 1)} {132426#(<= ~counter~0 1)} #94#return; {132426#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:52,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {132426#(<= ~counter~0 1)} assume !!(0 != ~r~0); {132426#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:52,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {132426#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:52,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {132451#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:52,682 INFO L272 TraceCheckUtils]: 27: Hoare triple {132451#(<= ~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)); {132451#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:52,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {132451#(<= ~counter~0 2)} ~cond := #in~cond; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:52,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {132451#(<= ~counter~0 2)} assume !(0 == ~cond); {132451#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:52,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {132451#(<= ~counter~0 2)} assume true; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:52,683 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132451#(<= ~counter~0 2)} {132451#(<= ~counter~0 2)} #96#return; {132451#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:52,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {132451#(<= ~counter~0 2)} assume !(~r~0 > 0); {132451#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:52,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {132451#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:52,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {132476#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:52,685 INFO L272 TraceCheckUtils]: 35: Hoare triple {132476#(<= ~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)); {132476#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:52,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {132476#(<= ~counter~0 3)} ~cond := #in~cond; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:52,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {132476#(<= ~counter~0 3)} assume !(0 == ~cond); {132476#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:52,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {132476#(<= ~counter~0 3)} assume true; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:52,686 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132476#(<= ~counter~0 3)} {132476#(<= ~counter~0 3)} #98#return; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:52,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {132476#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132476#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:52,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {132476#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:52,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {132501#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:52,689 INFO L272 TraceCheckUtils]: 43: Hoare triple {132501#(<= ~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)); {132501#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:52,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {132501#(<= ~counter~0 4)} ~cond := #in~cond; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:52,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {132501#(<= ~counter~0 4)} assume !(0 == ~cond); {132501#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:52,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {132501#(<= ~counter~0 4)} assume true; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:52,690 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132501#(<= ~counter~0 4)} {132501#(<= ~counter~0 4)} #98#return; {132501#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:52,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {132501#(<= ~counter~0 4)} assume !(~r~0 < 0); {132501#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:52,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {132501#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:52,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {132526#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:52,692 INFO L272 TraceCheckUtils]: 51: Hoare triple {132526#(<= ~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)); {132526#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:52,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {132526#(<= ~counter~0 5)} ~cond := #in~cond; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:52,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {132526#(<= ~counter~0 5)} assume !(0 == ~cond); {132526#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:52,693 INFO L290 TraceCheckUtils]: 54: Hoare triple {132526#(<= ~counter~0 5)} assume true; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:52,694 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132526#(<= ~counter~0 5)} {132526#(<= ~counter~0 5)} #94#return; {132526#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:52,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {132526#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132526#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:52,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {132526#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:52,696 INFO L290 TraceCheckUtils]: 58: Hoare triple {132551#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:52,696 INFO L272 TraceCheckUtils]: 59: Hoare triple {132551#(<= ~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)); {132551#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:52,697 INFO L290 TraceCheckUtils]: 60: Hoare triple {132551#(<= ~counter~0 6)} ~cond := #in~cond; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:52,697 INFO L290 TraceCheckUtils]: 61: Hoare triple {132551#(<= ~counter~0 6)} assume !(0 == ~cond); {132551#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:52,697 INFO L290 TraceCheckUtils]: 62: Hoare triple {132551#(<= ~counter~0 6)} assume true; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:52,698 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132551#(<= ~counter~0 6)} {132551#(<= ~counter~0 6)} #96#return; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:52,698 INFO L290 TraceCheckUtils]: 64: Hoare triple {132551#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132551#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:52,699 INFO L290 TraceCheckUtils]: 65: Hoare triple {132551#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:52,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {132576#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:52,700 INFO L272 TraceCheckUtils]: 67: Hoare triple {132576#(<= ~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)); {132576#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:52,701 INFO L290 TraceCheckUtils]: 68: Hoare triple {132576#(<= ~counter~0 7)} ~cond := #in~cond; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:52,701 INFO L290 TraceCheckUtils]: 69: Hoare triple {132576#(<= ~counter~0 7)} assume !(0 == ~cond); {132576#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:52,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {132576#(<= ~counter~0 7)} assume true; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:52,702 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132576#(<= ~counter~0 7)} {132576#(<= ~counter~0 7)} #96#return; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:52,702 INFO L290 TraceCheckUtils]: 72: Hoare triple {132576#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132576#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:52,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {132576#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:52,704 INFO L290 TraceCheckUtils]: 74: Hoare triple {132601#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:52,704 INFO L272 TraceCheckUtils]: 75: Hoare triple {132601#(<= ~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)); {132601#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:52,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {132601#(<= ~counter~0 8)} ~cond := #in~cond; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:52,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {132601#(<= ~counter~0 8)} assume !(0 == ~cond); {132601#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:52,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {132601#(<= ~counter~0 8)} assume true; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:52,706 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132601#(<= ~counter~0 8)} {132601#(<= ~counter~0 8)} #96#return; {132601#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:52,706 INFO L290 TraceCheckUtils]: 80: Hoare triple {132601#(<= ~counter~0 8)} assume !(~r~0 > 0); {132601#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:52,707 INFO L290 TraceCheckUtils]: 81: Hoare triple {132601#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:52,708 INFO L290 TraceCheckUtils]: 82: Hoare triple {132626#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:52,708 INFO L272 TraceCheckUtils]: 83: Hoare triple {132626#(<= ~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)); {132626#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:52,708 INFO L290 TraceCheckUtils]: 84: Hoare triple {132626#(<= ~counter~0 9)} ~cond := #in~cond; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:52,709 INFO L290 TraceCheckUtils]: 85: Hoare triple {132626#(<= ~counter~0 9)} assume !(0 == ~cond); {132626#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:52,709 INFO L290 TraceCheckUtils]: 86: Hoare triple {132626#(<= ~counter~0 9)} assume true; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:52,709 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132626#(<= ~counter~0 9)} {132626#(<= ~counter~0 9)} #98#return; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:52,710 INFO L290 TraceCheckUtils]: 88: Hoare triple {132626#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132626#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:52,711 INFO L290 TraceCheckUtils]: 89: Hoare triple {132626#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:52,711 INFO L290 TraceCheckUtils]: 90: Hoare triple {132651#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:52,712 INFO L272 TraceCheckUtils]: 91: Hoare triple {132651#(<= ~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)); {132651#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:52,712 INFO L290 TraceCheckUtils]: 92: Hoare triple {132651#(<= ~counter~0 10)} ~cond := #in~cond; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:52,712 INFO L290 TraceCheckUtils]: 93: Hoare triple {132651#(<= ~counter~0 10)} assume !(0 == ~cond); {132651#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:52,712 INFO L290 TraceCheckUtils]: 94: Hoare triple {132651#(<= ~counter~0 10)} assume true; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:52,713 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132651#(<= ~counter~0 10)} {132651#(<= ~counter~0 10)} #98#return; {132651#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:52,713 INFO L290 TraceCheckUtils]: 96: Hoare triple {132651#(<= ~counter~0 10)} assume !(~r~0 < 0); {132651#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:52,714 INFO L290 TraceCheckUtils]: 97: Hoare triple {132651#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:52,715 INFO L290 TraceCheckUtils]: 98: Hoare triple {132676#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:52,715 INFO L272 TraceCheckUtils]: 99: Hoare triple {132676#(<= ~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)); {132676#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:52,715 INFO L290 TraceCheckUtils]: 100: Hoare triple {132676#(<= ~counter~0 11)} ~cond := #in~cond; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:52,716 INFO L290 TraceCheckUtils]: 101: Hoare triple {132676#(<= ~counter~0 11)} assume !(0 == ~cond); {132676#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:52,716 INFO L290 TraceCheckUtils]: 102: Hoare triple {132676#(<= ~counter~0 11)} assume true; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:52,716 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132676#(<= ~counter~0 11)} {132676#(<= ~counter~0 11)} #94#return; {132676#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:52,717 INFO L290 TraceCheckUtils]: 104: Hoare triple {132676#(<= ~counter~0 11)} assume !!(0 != ~r~0); {132676#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:52,718 INFO L290 TraceCheckUtils]: 105: Hoare triple {132676#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:52,718 INFO L290 TraceCheckUtils]: 106: Hoare triple {132701#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:52,718 INFO L272 TraceCheckUtils]: 107: Hoare triple {132701#(<= ~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)); {132701#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:52,719 INFO L290 TraceCheckUtils]: 108: Hoare triple {132701#(<= ~counter~0 12)} ~cond := #in~cond; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:52,719 INFO L290 TraceCheckUtils]: 109: Hoare triple {132701#(<= ~counter~0 12)} assume !(0 == ~cond); {132701#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:52,719 INFO L290 TraceCheckUtils]: 110: Hoare triple {132701#(<= ~counter~0 12)} assume true; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:52,720 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132701#(<= ~counter~0 12)} {132701#(<= ~counter~0 12)} #96#return; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:52,720 INFO L290 TraceCheckUtils]: 112: Hoare triple {132701#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132701#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:52,721 INFO L290 TraceCheckUtils]: 113: Hoare triple {132701#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:52,721 INFO L290 TraceCheckUtils]: 114: Hoare triple {132726#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:52,722 INFO L272 TraceCheckUtils]: 115: Hoare triple {132726#(<= ~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)); {132726#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:52,722 INFO L290 TraceCheckUtils]: 116: Hoare triple {132726#(<= ~counter~0 13)} ~cond := #in~cond; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:52,723 INFO L290 TraceCheckUtils]: 117: Hoare triple {132726#(<= ~counter~0 13)} assume !(0 == ~cond); {132726#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:52,723 INFO L290 TraceCheckUtils]: 118: Hoare triple {132726#(<= ~counter~0 13)} assume true; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:52,723 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132726#(<= ~counter~0 13)} {132726#(<= ~counter~0 13)} #96#return; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:52,724 INFO L290 TraceCheckUtils]: 120: Hoare triple {132726#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132726#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:52,725 INFO L290 TraceCheckUtils]: 121: Hoare triple {132726#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:52,725 INFO L290 TraceCheckUtils]: 122: Hoare triple {132751#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:52,725 INFO L272 TraceCheckUtils]: 123: Hoare triple {132751#(<= ~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)); {132751#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:52,726 INFO L290 TraceCheckUtils]: 124: Hoare triple {132751#(<= ~counter~0 14)} ~cond := #in~cond; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:52,726 INFO L290 TraceCheckUtils]: 125: Hoare triple {132751#(<= ~counter~0 14)} assume !(0 == ~cond); {132751#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:52,726 INFO L290 TraceCheckUtils]: 126: Hoare triple {132751#(<= ~counter~0 14)} assume true; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:52,727 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132751#(<= ~counter~0 14)} {132751#(<= ~counter~0 14)} #96#return; {132751#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:52,727 INFO L290 TraceCheckUtils]: 128: Hoare triple {132751#(<= ~counter~0 14)} assume !(~r~0 > 0); {132751#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:52,728 INFO L290 TraceCheckUtils]: 129: Hoare triple {132751#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:52,728 INFO L290 TraceCheckUtils]: 130: Hoare triple {132776#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:52,729 INFO L272 TraceCheckUtils]: 131: Hoare triple {132776#(<= ~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)); {132776#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:52,729 INFO L290 TraceCheckUtils]: 132: Hoare triple {132776#(<= ~counter~0 15)} ~cond := #in~cond; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:52,729 INFO L290 TraceCheckUtils]: 133: Hoare triple {132776#(<= ~counter~0 15)} assume !(0 == ~cond); {132776#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:52,730 INFO L290 TraceCheckUtils]: 134: Hoare triple {132776#(<= ~counter~0 15)} assume true; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:52,730 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132776#(<= ~counter~0 15)} {132776#(<= ~counter~0 15)} #98#return; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:52,731 INFO L290 TraceCheckUtils]: 136: Hoare triple {132776#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132776#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:52,731 INFO L290 TraceCheckUtils]: 137: Hoare triple {132776#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132801#(<= |main_#t~post8| 15)} is VALID [2022-04-08 06:10:52,731 INFO L290 TraceCheckUtils]: 138: Hoare triple {132801#(<= |main_#t~post8| 15)} assume !(#t~post8 < 50);havoc #t~post8; {132370#false} is VALID [2022-04-08 06:10:52,731 INFO L290 TraceCheckUtils]: 139: Hoare triple {132370#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132370#false} is VALID [2022-04-08 06:10:52,731 INFO L290 TraceCheckUtils]: 140: Hoare triple {132370#false} assume !(#t~post6 < 50);havoc #t~post6; {132370#false} is VALID [2022-04-08 06:10:52,731 INFO L272 TraceCheckUtils]: 141: Hoare triple {132370#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)); {132370#false} is VALID [2022-04-08 06:10:52,732 INFO L290 TraceCheckUtils]: 142: Hoare triple {132370#false} ~cond := #in~cond; {132370#false} is VALID [2022-04-08 06:10:52,732 INFO L290 TraceCheckUtils]: 143: Hoare triple {132370#false} assume 0 == ~cond; {132370#false} is VALID [2022-04-08 06:10:52,732 INFO L290 TraceCheckUtils]: 144: Hoare triple {132370#false} assume !false; {132370#false} is VALID [2022-04-08 06:10:52,732 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-08 06:10:52,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:10:53,723 INFO L290 TraceCheckUtils]: 144: Hoare triple {132370#false} assume !false; {132370#false} is VALID [2022-04-08 06:10:53,723 INFO L290 TraceCheckUtils]: 143: Hoare triple {132370#false} assume 0 == ~cond; {132370#false} is VALID [2022-04-08 06:10:53,723 INFO L290 TraceCheckUtils]: 142: Hoare triple {132370#false} ~cond := #in~cond; {132370#false} is VALID [2022-04-08 06:10:53,723 INFO L272 TraceCheckUtils]: 141: Hoare triple {132370#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)); {132370#false} is VALID [2022-04-08 06:10:53,723 INFO L290 TraceCheckUtils]: 140: Hoare triple {132370#false} assume !(#t~post6 < 50);havoc #t~post6; {132370#false} is VALID [2022-04-08 06:10:53,723 INFO L290 TraceCheckUtils]: 139: Hoare triple {132370#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132370#false} is VALID [2022-04-08 06:10:53,724 INFO L290 TraceCheckUtils]: 138: Hoare triple {132841#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {132370#false} is VALID [2022-04-08 06:10:53,724 INFO L290 TraceCheckUtils]: 137: Hoare triple {132845#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132841#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:10:53,724 INFO L290 TraceCheckUtils]: 136: Hoare triple {132845#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132845#(< ~counter~0 50)} is VALID [2022-04-08 06:10:53,725 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132369#true} {132845#(< ~counter~0 50)} #98#return; {132845#(< ~counter~0 50)} is VALID [2022-04-08 06:10:53,725 INFO L290 TraceCheckUtils]: 134: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,725 INFO L290 TraceCheckUtils]: 133: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,725 INFO L290 TraceCheckUtils]: 132: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,725 INFO L272 TraceCheckUtils]: 131: Hoare triple {132845#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,725 INFO L290 TraceCheckUtils]: 130: Hoare triple {132845#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {132845#(< ~counter~0 50)} is VALID [2022-04-08 06:10:53,728 INFO L290 TraceCheckUtils]: 129: Hoare triple {132870#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132845#(< ~counter~0 50)} is VALID [2022-04-08 06:10:53,729 INFO L290 TraceCheckUtils]: 128: Hoare triple {132870#(< ~counter~0 49)} assume !(~r~0 > 0); {132870#(< ~counter~0 49)} is VALID [2022-04-08 06:10:53,729 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132369#true} {132870#(< ~counter~0 49)} #96#return; {132870#(< ~counter~0 49)} is VALID [2022-04-08 06:10:53,730 INFO L290 TraceCheckUtils]: 126: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,730 INFO L290 TraceCheckUtils]: 125: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,730 INFO L290 TraceCheckUtils]: 124: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,730 INFO L272 TraceCheckUtils]: 123: Hoare triple {132870#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,730 INFO L290 TraceCheckUtils]: 122: Hoare triple {132870#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {132870#(< ~counter~0 49)} is VALID [2022-04-08 06:10:53,732 INFO L290 TraceCheckUtils]: 121: Hoare triple {132895#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132870#(< ~counter~0 49)} is VALID [2022-04-08 06:10:53,732 INFO L290 TraceCheckUtils]: 120: Hoare triple {132895#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132895#(< ~counter~0 48)} is VALID [2022-04-08 06:10:53,733 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132369#true} {132895#(< ~counter~0 48)} #96#return; {132895#(< ~counter~0 48)} is VALID [2022-04-08 06:10:53,733 INFO L290 TraceCheckUtils]: 118: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,733 INFO L290 TraceCheckUtils]: 117: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,733 INFO L290 TraceCheckUtils]: 116: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,733 INFO L272 TraceCheckUtils]: 115: Hoare triple {132895#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,733 INFO L290 TraceCheckUtils]: 114: Hoare triple {132895#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {132895#(< ~counter~0 48)} is VALID [2022-04-08 06:10:53,736 INFO L290 TraceCheckUtils]: 113: Hoare triple {132920#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132895#(< ~counter~0 48)} is VALID [2022-04-08 06:10:53,736 INFO L290 TraceCheckUtils]: 112: Hoare triple {132920#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132920#(< ~counter~0 47)} is VALID [2022-04-08 06:10:53,737 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132369#true} {132920#(< ~counter~0 47)} #96#return; {132920#(< ~counter~0 47)} is VALID [2022-04-08 06:10:53,737 INFO L290 TraceCheckUtils]: 110: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,737 INFO L290 TraceCheckUtils]: 109: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,737 INFO L290 TraceCheckUtils]: 108: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,737 INFO L272 TraceCheckUtils]: 107: Hoare triple {132920#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,737 INFO L290 TraceCheckUtils]: 106: Hoare triple {132920#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {132920#(< ~counter~0 47)} is VALID [2022-04-08 06:10:53,740 INFO L290 TraceCheckUtils]: 105: Hoare triple {132945#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132920#(< ~counter~0 47)} is VALID [2022-04-08 06:10:53,740 INFO L290 TraceCheckUtils]: 104: Hoare triple {132945#(< ~counter~0 46)} assume !!(0 != ~r~0); {132945#(< ~counter~0 46)} is VALID [2022-04-08 06:10:53,741 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132369#true} {132945#(< ~counter~0 46)} #94#return; {132945#(< ~counter~0 46)} is VALID [2022-04-08 06:10:53,741 INFO L290 TraceCheckUtils]: 102: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,741 INFO L290 TraceCheckUtils]: 101: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,741 INFO L290 TraceCheckUtils]: 100: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,741 INFO L272 TraceCheckUtils]: 99: Hoare triple {132945#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,742 INFO L290 TraceCheckUtils]: 98: Hoare triple {132945#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {132945#(< ~counter~0 46)} is VALID [2022-04-08 06:10:53,743 INFO L290 TraceCheckUtils]: 97: Hoare triple {132970#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132945#(< ~counter~0 46)} is VALID [2022-04-08 06:10:53,743 INFO L290 TraceCheckUtils]: 96: Hoare triple {132970#(< ~counter~0 45)} assume !(~r~0 < 0); {132970#(< ~counter~0 45)} is VALID [2022-04-08 06:10:53,744 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132369#true} {132970#(< ~counter~0 45)} #98#return; {132970#(< ~counter~0 45)} is VALID [2022-04-08 06:10:53,744 INFO L290 TraceCheckUtils]: 94: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,744 INFO L290 TraceCheckUtils]: 93: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,744 INFO L290 TraceCheckUtils]: 92: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,744 INFO L272 TraceCheckUtils]: 91: Hoare triple {132970#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,745 INFO L290 TraceCheckUtils]: 90: Hoare triple {132970#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {132970#(< ~counter~0 45)} is VALID [2022-04-08 06:10:53,747 INFO L290 TraceCheckUtils]: 89: Hoare triple {132995#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132970#(< ~counter~0 45)} is VALID [2022-04-08 06:10:53,747 INFO L290 TraceCheckUtils]: 88: Hoare triple {132995#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132995#(< ~counter~0 44)} is VALID [2022-04-08 06:10:53,748 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132369#true} {132995#(< ~counter~0 44)} #98#return; {132995#(< ~counter~0 44)} is VALID [2022-04-08 06:10:53,748 INFO L290 TraceCheckUtils]: 86: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,748 INFO L290 TraceCheckUtils]: 85: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,748 INFO L290 TraceCheckUtils]: 84: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,748 INFO L272 TraceCheckUtils]: 83: Hoare triple {132995#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,748 INFO L290 TraceCheckUtils]: 82: Hoare triple {132995#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {132995#(< ~counter~0 44)} is VALID [2022-04-08 06:10:53,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {133020#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132995#(< ~counter~0 44)} is VALID [2022-04-08 06:10:53,751 INFO L290 TraceCheckUtils]: 80: Hoare triple {133020#(< ~counter~0 43)} assume !(~r~0 > 0); {133020#(< ~counter~0 43)} is VALID [2022-04-08 06:10:53,751 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132369#true} {133020#(< ~counter~0 43)} #96#return; {133020#(< ~counter~0 43)} is VALID [2022-04-08 06:10:53,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,751 INFO L290 TraceCheckUtils]: 76: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,751 INFO L272 TraceCheckUtils]: 75: Hoare triple {133020#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {133020#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {133020#(< ~counter~0 43)} is VALID [2022-04-08 06:10:53,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {133045#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133020#(< ~counter~0 43)} is VALID [2022-04-08 06:10:53,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {133045#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133045#(< ~counter~0 42)} is VALID [2022-04-08 06:10:53,754 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132369#true} {133045#(< ~counter~0 42)} #96#return; {133045#(< ~counter~0 42)} is VALID [2022-04-08 06:10:53,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,755 INFO L272 TraceCheckUtils]: 67: Hoare triple {133045#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {133045#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {133045#(< ~counter~0 42)} is VALID [2022-04-08 06:10:53,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {133070#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133045#(< ~counter~0 42)} is VALID [2022-04-08 06:10:53,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {133070#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133070#(< ~counter~0 41)} is VALID [2022-04-08 06:10:53,758 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132369#true} {133070#(< ~counter~0 41)} #96#return; {133070#(< ~counter~0 41)} is VALID [2022-04-08 06:10:53,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,758 INFO L272 TraceCheckUtils]: 59: Hoare triple {133070#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {133070#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {133070#(< ~counter~0 41)} is VALID [2022-04-08 06:10:53,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {133095#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133070#(< ~counter~0 41)} is VALID [2022-04-08 06:10:53,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {133095#(< ~counter~0 40)} assume !!(0 != ~r~0); {133095#(< ~counter~0 40)} is VALID [2022-04-08 06:10:53,760 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132369#true} {133095#(< ~counter~0 40)} #94#return; {133095#(< ~counter~0 40)} is VALID [2022-04-08 06:10:53,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,761 INFO L272 TraceCheckUtils]: 51: Hoare triple {133095#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {133095#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {133095#(< ~counter~0 40)} is VALID [2022-04-08 06:10:53,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {133120#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133095#(< ~counter~0 40)} is VALID [2022-04-08 06:10:53,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {133120#(< ~counter~0 39)} assume !(~r~0 < 0); {133120#(< ~counter~0 39)} is VALID [2022-04-08 06:10:53,763 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132369#true} {133120#(< ~counter~0 39)} #98#return; {133120#(< ~counter~0 39)} is VALID [2022-04-08 06:10:53,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,763 INFO L272 TraceCheckUtils]: 43: Hoare triple {133120#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {133120#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {133120#(< ~counter~0 39)} is VALID [2022-04-08 06:10:53,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {133145#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133120#(< ~counter~0 39)} is VALID [2022-04-08 06:10:53,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {133145#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133145#(< ~counter~0 38)} is VALID [2022-04-08 06:10:53,767 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132369#true} {133145#(< ~counter~0 38)} #98#return; {133145#(< ~counter~0 38)} is VALID [2022-04-08 06:10:53,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,767 INFO L272 TraceCheckUtils]: 35: Hoare triple {133145#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {133145#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {133145#(< ~counter~0 38)} is VALID [2022-04-08 06:10:53,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {133170#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133145#(< ~counter~0 38)} is VALID [2022-04-08 06:10:53,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {133170#(< ~counter~0 37)} assume !(~r~0 > 0); {133170#(< ~counter~0 37)} is VALID [2022-04-08 06:10:53,770 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132369#true} {133170#(< ~counter~0 37)} #96#return; {133170#(< ~counter~0 37)} is VALID [2022-04-08 06:10:53,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,771 INFO L272 TraceCheckUtils]: 27: Hoare triple {133170#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {133170#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {133170#(< ~counter~0 37)} is VALID [2022-04-08 06:10:53,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {133195#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133170#(< ~counter~0 37)} is VALID [2022-04-08 06:10:53,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {133195#(< ~counter~0 36)} assume !!(0 != ~r~0); {133195#(< ~counter~0 36)} is VALID [2022-04-08 06:10:53,775 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132369#true} {133195#(< ~counter~0 36)} #94#return; {133195#(< ~counter~0 36)} is VALID [2022-04-08 06:10:53,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,776 INFO L272 TraceCheckUtils]: 19: Hoare triple {133195#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {133195#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {133195#(< ~counter~0 36)} is VALID [2022-04-08 06:10:53,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {133220#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133195#(< ~counter~0 36)} is VALID [2022-04-08 06:10:53,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {133220#(< ~counter~0 35)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {133220#(< ~counter~0 35)} is VALID [2022-04-08 06:10:53,779 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132369#true} {133220#(< ~counter~0 35)} #92#return; {133220#(< ~counter~0 35)} is VALID [2022-04-08 06:10:53,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,779 INFO L272 TraceCheckUtils]: 11: Hoare triple {133220#(< ~counter~0 35)} 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)); {132369#true} is VALID [2022-04-08 06:10:53,780 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132369#true} {133220#(< ~counter~0 35)} #90#return; {133220#(< ~counter~0 35)} is VALID [2022-04-08 06:10:53,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-08 06:10:53,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-08 06:10:53,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-08 06:10:53,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {133220#(< ~counter~0 35)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132369#true} is VALID [2022-04-08 06:10:53,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {133220#(< ~counter~0 35)} 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; {133220#(< ~counter~0 35)} is VALID [2022-04-08 06:10:53,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {133220#(< ~counter~0 35)} call #t~ret9 := main(); {133220#(< ~counter~0 35)} is VALID [2022-04-08 06:10:53,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133220#(< ~counter~0 35)} {132369#true} #102#return; {133220#(< ~counter~0 35)} is VALID [2022-04-08 06:10:53,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {133220#(< ~counter~0 35)} assume true; {133220#(< ~counter~0 35)} is VALID [2022-04-08 06:10:53,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {132369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {133220#(< ~counter~0 35)} is VALID [2022-04-08 06:10:53,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {132369#true} call ULTIMATE.init(); {132369#true} is VALID [2022-04-08 06:10:53,782 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-08 06:10:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:53,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108473504] [2022-04-08 06:10:53,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:53,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695947194] [2022-04-08 06:10:53,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695947194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:10:53,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:10:53,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 06:10:53,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:53,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [960629375] [2022-04-08 06:10:53,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [960629375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:53,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:53,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 06:10:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921492390] [2022-04-08 06:10:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:53,784 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-08 06:10:53,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:53,784 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-08 06:10:53,988 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-08 06:10:53,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 06:10:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 06:10:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 06:10:53,989 INFO L87 Difference]: Start difference. First operand 775 states and 1041 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-08 06:10:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:59,698 INFO L93 Difference]: Finished difference Result 981 states and 1345 transitions. [2022-04-08 06:10:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 06:10:59,698 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-08 06:10:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:59,698 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-08 06:10:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-08 06:10:59,700 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-08 06:10:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-08 06:10:59,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 337 transitions. [2022-04-08 06:11:00,111 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-08 06:11:00,137 INFO L225 Difference]: With dead ends: 981 [2022-04-08 06:11:00,137 INFO L226 Difference]: Without dead ends: 789 [2022-04-08 06:11:00,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=995, Invalid=1357, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 06:11:00,138 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 274 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:00,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 334 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 06:11:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-04-08 06:11:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 778. [2022-04-08 06:11:03,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:03,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:11:03,086 INFO L74 IsIncluded]: Start isIncluded. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:11:03,087 INFO L87 Difference]: Start difference. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:11:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:03,107 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-08 06:11:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-08 06:11:03,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:03,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:03,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-08 06:11:03,110 INFO L87 Difference]: Start difference. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-08 06:11:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:03,131 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-08 06:11:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-08 06:11:03,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:03,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:03,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:03,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:11:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1041 transitions. [2022-04-08 06:11:03,160 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1041 transitions. Word has length 145 [2022-04-08 06:11:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:03,160 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 1041 transitions. [2022-04-08 06:11:03,160 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-08 06:11:03,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 778 states and 1041 transitions. [2022-04-08 06:11:14,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1040 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1041 transitions. [2022-04-08 06:11:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-08 06:11:14,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:14,616 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-08 06:11:14,634 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-08 06:11:14,817 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-08 06:11:14,817 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 21 times [2022-04-08 06:11:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:14,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1375419063] [2022-04-08 06:11:14,818 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 22 times [2022-04-08 06:11:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:14,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884221587] [2022-04-08 06:11:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:14,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:14,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820563466] [2022-04-08 06:11:14,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:11:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:14,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:14,836 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-08 06:11:14,837 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-08 06:11:15,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:11:15,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:15,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 06:11:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:15,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:11:15,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {138396#true} call ULTIMATE.init(); {138396#true} is VALID [2022-04-08 06:11:15,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {138396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138404#(<= ~counter~0 0)} {138396#true} #102#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {138404#(<= ~counter~0 0)} call #t~ret9 := main(); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {138404#(<= ~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; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {138404#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {138404#(<= ~counter~0 0)} ~cond := #in~cond; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {138404#(<= ~counter~0 0)} assume !(0 == ~cond); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138404#(<= ~counter~0 0)} {138404#(<= ~counter~0 0)} #90#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,877 INFO L272 TraceCheckUtils]: 11: Hoare triple {138404#(<= ~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)); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {138404#(<= ~counter~0 0)} ~cond := #in~cond; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {138404#(<= ~counter~0 0)} assume !(0 == ~cond); {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138404#(<= ~counter~0 0)} {138404#(<= ~counter~0 0)} #92#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {138404#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {138404#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:15,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {138404#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:15,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {138453#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:15,883 INFO L272 TraceCheckUtils]: 19: Hoare triple {138453#(<= ~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)); {138453#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:15,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {138453#(<= ~counter~0 1)} ~cond := #in~cond; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:15,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {138453#(<= ~counter~0 1)} assume !(0 == ~cond); {138453#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:15,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {138453#(<= ~counter~0 1)} assume true; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:15,885 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138453#(<= ~counter~0 1)} {138453#(<= ~counter~0 1)} #94#return; {138453#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:15,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {138453#(<= ~counter~0 1)} assume !!(0 != ~r~0); {138453#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:15,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {138453#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:15,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {138478#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:15,889 INFO L272 TraceCheckUtils]: 27: Hoare triple {138478#(<= ~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)); {138478#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:15,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {138478#(<= ~counter~0 2)} ~cond := #in~cond; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:15,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {138478#(<= ~counter~0 2)} assume !(0 == ~cond); {138478#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:15,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {138478#(<= ~counter~0 2)} assume true; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:15,891 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138478#(<= ~counter~0 2)} {138478#(<= ~counter~0 2)} #96#return; {138478#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:15,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {138478#(<= ~counter~0 2)} assume !(~r~0 > 0); {138478#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:15,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {138478#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:15,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {138503#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:15,894 INFO L272 TraceCheckUtils]: 35: Hoare triple {138503#(<= ~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)); {138503#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:15,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {138503#(<= ~counter~0 3)} ~cond := #in~cond; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:15,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {138503#(<= ~counter~0 3)} assume !(0 == ~cond); {138503#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:15,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {138503#(<= ~counter~0 3)} assume true; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:15,896 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138503#(<= ~counter~0 3)} {138503#(<= ~counter~0 3)} #98#return; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:15,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {138503#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138503#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:15,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {138503#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:15,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {138528#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:15,899 INFO L272 TraceCheckUtils]: 43: Hoare triple {138528#(<= ~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)); {138528#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:15,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {138528#(<= ~counter~0 4)} ~cond := #in~cond; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:15,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {138528#(<= ~counter~0 4)} assume !(0 == ~cond); {138528#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:15,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {138528#(<= ~counter~0 4)} assume true; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:15,900 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138528#(<= ~counter~0 4)} {138528#(<= ~counter~0 4)} #98#return; {138528#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:15,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {138528#(<= ~counter~0 4)} assume !(~r~0 < 0); {138528#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:15,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {138528#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:15,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {138553#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:15,905 INFO L272 TraceCheckUtils]: 51: Hoare triple {138553#(<= ~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)); {138553#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:15,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {138553#(<= ~counter~0 5)} ~cond := #in~cond; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:15,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {138553#(<= ~counter~0 5)} assume !(0 == ~cond); {138553#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:15,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {138553#(<= ~counter~0 5)} assume true; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:15,906 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138553#(<= ~counter~0 5)} {138553#(<= ~counter~0 5)} #94#return; {138553#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:15,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {138553#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138553#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:15,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {138553#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:15,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {138578#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:15,910 INFO L272 TraceCheckUtils]: 59: Hoare triple {138578#(<= ~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)); {138578#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:15,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {138578#(<= ~counter~0 6)} ~cond := #in~cond; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:15,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {138578#(<= ~counter~0 6)} assume !(0 == ~cond); {138578#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:15,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {138578#(<= ~counter~0 6)} assume true; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:15,912 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138578#(<= ~counter~0 6)} {138578#(<= ~counter~0 6)} #96#return; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:15,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {138578#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138578#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:15,915 INFO L290 TraceCheckUtils]: 65: Hoare triple {138578#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:15,916 INFO L290 TraceCheckUtils]: 66: Hoare triple {138603#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:15,916 INFO L272 TraceCheckUtils]: 67: Hoare triple {138603#(<= ~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)); {138603#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:15,916 INFO L290 TraceCheckUtils]: 68: Hoare triple {138603#(<= ~counter~0 7)} ~cond := #in~cond; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:15,917 INFO L290 TraceCheckUtils]: 69: Hoare triple {138603#(<= ~counter~0 7)} assume !(0 == ~cond); {138603#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:15,917 INFO L290 TraceCheckUtils]: 70: Hoare triple {138603#(<= ~counter~0 7)} assume true; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:15,917 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138603#(<= ~counter~0 7)} {138603#(<= ~counter~0 7)} #96#return; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:15,918 INFO L290 TraceCheckUtils]: 72: Hoare triple {138603#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138603#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:15,921 INFO L290 TraceCheckUtils]: 73: Hoare triple {138603#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:15,921 INFO L290 TraceCheckUtils]: 74: Hoare triple {138628#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:15,922 INFO L272 TraceCheckUtils]: 75: Hoare triple {138628#(<= ~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)); {138628#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:15,922 INFO L290 TraceCheckUtils]: 76: Hoare triple {138628#(<= ~counter~0 8)} ~cond := #in~cond; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:15,923 INFO L290 TraceCheckUtils]: 77: Hoare triple {138628#(<= ~counter~0 8)} assume !(0 == ~cond); {138628#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:15,923 INFO L290 TraceCheckUtils]: 78: Hoare triple {138628#(<= ~counter~0 8)} assume true; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:15,923 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138628#(<= ~counter~0 8)} {138628#(<= ~counter~0 8)} #96#return; {138628#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:15,924 INFO L290 TraceCheckUtils]: 80: Hoare triple {138628#(<= ~counter~0 8)} assume !(~r~0 > 0); {138628#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:15,928 INFO L290 TraceCheckUtils]: 81: Hoare triple {138628#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:15,928 INFO L290 TraceCheckUtils]: 82: Hoare triple {138653#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:15,929 INFO L272 TraceCheckUtils]: 83: Hoare triple {138653#(<= ~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)); {138653#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:15,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {138653#(<= ~counter~0 9)} ~cond := #in~cond; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:15,930 INFO L290 TraceCheckUtils]: 85: Hoare triple {138653#(<= ~counter~0 9)} assume !(0 == ~cond); {138653#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:15,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {138653#(<= ~counter~0 9)} assume true; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:15,930 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138653#(<= ~counter~0 9)} {138653#(<= ~counter~0 9)} #98#return; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:15,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {138653#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138653#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:15,934 INFO L290 TraceCheckUtils]: 89: Hoare triple {138653#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:15,934 INFO L290 TraceCheckUtils]: 90: Hoare triple {138678#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:15,935 INFO L272 TraceCheckUtils]: 91: Hoare triple {138678#(<= ~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)); {138678#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:15,935 INFO L290 TraceCheckUtils]: 92: Hoare triple {138678#(<= ~counter~0 10)} ~cond := #in~cond; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:15,935 INFO L290 TraceCheckUtils]: 93: Hoare triple {138678#(<= ~counter~0 10)} assume !(0 == ~cond); {138678#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:15,936 INFO L290 TraceCheckUtils]: 94: Hoare triple {138678#(<= ~counter~0 10)} assume true; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:15,936 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138678#(<= ~counter~0 10)} {138678#(<= ~counter~0 10)} #98#return; {138678#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:15,936 INFO L290 TraceCheckUtils]: 96: Hoare triple {138678#(<= ~counter~0 10)} assume !(~r~0 < 0); {138678#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:15,939 INFO L290 TraceCheckUtils]: 97: Hoare triple {138678#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:15,939 INFO L290 TraceCheckUtils]: 98: Hoare triple {138703#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:15,939 INFO L272 TraceCheckUtils]: 99: Hoare triple {138703#(<= ~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)); {138703#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:15,940 INFO L290 TraceCheckUtils]: 100: Hoare triple {138703#(<= ~counter~0 11)} ~cond := #in~cond; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:15,940 INFO L290 TraceCheckUtils]: 101: Hoare triple {138703#(<= ~counter~0 11)} assume !(0 == ~cond); {138703#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:15,940 INFO L290 TraceCheckUtils]: 102: Hoare triple {138703#(<= ~counter~0 11)} assume true; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:15,941 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138703#(<= ~counter~0 11)} {138703#(<= ~counter~0 11)} #94#return; {138703#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:15,941 INFO L290 TraceCheckUtils]: 104: Hoare triple {138703#(<= ~counter~0 11)} assume !!(0 != ~r~0); {138703#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:15,945 INFO L290 TraceCheckUtils]: 105: Hoare triple {138703#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:15,945 INFO L290 TraceCheckUtils]: 106: Hoare triple {138728#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:15,946 INFO L272 TraceCheckUtils]: 107: Hoare triple {138728#(<= ~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)); {138728#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:15,946 INFO L290 TraceCheckUtils]: 108: Hoare triple {138728#(<= ~counter~0 12)} ~cond := #in~cond; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:15,946 INFO L290 TraceCheckUtils]: 109: Hoare triple {138728#(<= ~counter~0 12)} assume !(0 == ~cond); {138728#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:15,947 INFO L290 TraceCheckUtils]: 110: Hoare triple {138728#(<= ~counter~0 12)} assume true; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:15,947 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138728#(<= ~counter~0 12)} {138728#(<= ~counter~0 12)} #96#return; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:15,947 INFO L290 TraceCheckUtils]: 112: Hoare triple {138728#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138728#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:15,952 INFO L290 TraceCheckUtils]: 113: Hoare triple {138728#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:15,953 INFO L290 TraceCheckUtils]: 114: Hoare triple {138753#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:15,953 INFO L272 TraceCheckUtils]: 115: Hoare triple {138753#(<= ~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)); {138753#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:15,954 INFO L290 TraceCheckUtils]: 116: Hoare triple {138753#(<= ~counter~0 13)} ~cond := #in~cond; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:15,954 INFO L290 TraceCheckUtils]: 117: Hoare triple {138753#(<= ~counter~0 13)} assume !(0 == ~cond); {138753#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:15,954 INFO L290 TraceCheckUtils]: 118: Hoare triple {138753#(<= ~counter~0 13)} assume true; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:15,955 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138753#(<= ~counter~0 13)} {138753#(<= ~counter~0 13)} #96#return; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:15,955 INFO L290 TraceCheckUtils]: 120: Hoare triple {138753#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138753#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:15,959 INFO L290 TraceCheckUtils]: 121: Hoare triple {138753#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:15,960 INFO L290 TraceCheckUtils]: 122: Hoare triple {138778#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:15,960 INFO L272 TraceCheckUtils]: 123: Hoare triple {138778#(<= ~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)); {138778#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:15,961 INFO L290 TraceCheckUtils]: 124: Hoare triple {138778#(<= ~counter~0 14)} ~cond := #in~cond; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:15,961 INFO L290 TraceCheckUtils]: 125: Hoare triple {138778#(<= ~counter~0 14)} assume !(0 == ~cond); {138778#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:15,961 INFO L290 TraceCheckUtils]: 126: Hoare triple {138778#(<= ~counter~0 14)} assume true; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:15,962 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138778#(<= ~counter~0 14)} {138778#(<= ~counter~0 14)} #96#return; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:15,962 INFO L290 TraceCheckUtils]: 128: Hoare triple {138778#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138778#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:15,965 INFO L290 TraceCheckUtils]: 129: Hoare triple {138778#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:15,966 INFO L290 TraceCheckUtils]: 130: Hoare triple {138803#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:15,966 INFO L272 TraceCheckUtils]: 131: Hoare triple {138803#(<= ~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)); {138803#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:15,966 INFO L290 TraceCheckUtils]: 132: Hoare triple {138803#(<= ~counter~0 15)} ~cond := #in~cond; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:15,967 INFO L290 TraceCheckUtils]: 133: Hoare triple {138803#(<= ~counter~0 15)} assume !(0 == ~cond); {138803#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:15,967 INFO L290 TraceCheckUtils]: 134: Hoare triple {138803#(<= ~counter~0 15)} assume true; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:15,968 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138803#(<= ~counter~0 15)} {138803#(<= ~counter~0 15)} #96#return; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:15,968 INFO L290 TraceCheckUtils]: 136: Hoare triple {138803#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138803#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:15,968 INFO L290 TraceCheckUtils]: 137: Hoare triple {138803#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138828#(<= |main_#t~post7| 15)} is VALID [2022-04-08 06:11:15,969 INFO L290 TraceCheckUtils]: 138: Hoare triple {138828#(<= |main_#t~post7| 15)} assume !(#t~post7 < 50);havoc #t~post7; {138397#false} is VALID [2022-04-08 06:11:15,969 INFO L290 TraceCheckUtils]: 139: Hoare triple {138397#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138397#false} is VALID [2022-04-08 06:11:15,969 INFO L290 TraceCheckUtils]: 140: Hoare triple {138397#false} assume !(#t~post8 < 50);havoc #t~post8; {138397#false} is VALID [2022-04-08 06:11:15,969 INFO L290 TraceCheckUtils]: 141: Hoare triple {138397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138397#false} is VALID [2022-04-08 06:11:15,969 INFO L290 TraceCheckUtils]: 142: Hoare triple {138397#false} assume !(#t~post6 < 50);havoc #t~post6; {138397#false} is VALID [2022-04-08 06:11:15,969 INFO L272 TraceCheckUtils]: 143: Hoare triple {138397#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)); {138397#false} is VALID [2022-04-08 06:11:15,969 INFO L290 TraceCheckUtils]: 144: Hoare triple {138397#false} ~cond := #in~cond; {138397#false} is VALID [2022-04-08 06:11:15,969 INFO L290 TraceCheckUtils]: 145: Hoare triple {138397#false} assume 0 == ~cond; {138397#false} is VALID [2022-04-08 06:11:15,969 INFO L290 TraceCheckUtils]: 146: Hoare triple {138397#false} assume !false; {138397#false} is VALID [2022-04-08 06:11:15,970 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-08 06:11:15,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:17,078 INFO L290 TraceCheckUtils]: 146: Hoare triple {138397#false} assume !false; {138397#false} is VALID [2022-04-08 06:11:17,078 INFO L290 TraceCheckUtils]: 145: Hoare triple {138397#false} assume 0 == ~cond; {138397#false} is VALID [2022-04-08 06:11:17,078 INFO L290 TraceCheckUtils]: 144: Hoare triple {138397#false} ~cond := #in~cond; {138397#false} is VALID [2022-04-08 06:11:17,078 INFO L272 TraceCheckUtils]: 143: Hoare triple {138397#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)); {138397#false} is VALID [2022-04-08 06:11:17,078 INFO L290 TraceCheckUtils]: 142: Hoare triple {138397#false} assume !(#t~post6 < 50);havoc #t~post6; {138397#false} is VALID [2022-04-08 06:11:17,078 INFO L290 TraceCheckUtils]: 141: Hoare triple {138397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138397#false} is VALID [2022-04-08 06:11:17,078 INFO L290 TraceCheckUtils]: 140: Hoare triple {138397#false} assume !(#t~post8 < 50);havoc #t~post8; {138397#false} is VALID [2022-04-08 06:11:17,078 INFO L290 TraceCheckUtils]: 139: Hoare triple {138397#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138397#false} is VALID [2022-04-08 06:11:17,079 INFO L290 TraceCheckUtils]: 138: Hoare triple {138880#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {138397#false} is VALID [2022-04-08 06:11:17,079 INFO L290 TraceCheckUtils]: 137: Hoare triple {138884#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138880#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:11:17,079 INFO L290 TraceCheckUtils]: 136: Hoare triple {138884#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138884#(< ~counter~0 50)} is VALID [2022-04-08 06:11:17,080 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138396#true} {138884#(< ~counter~0 50)} #96#return; {138884#(< ~counter~0 50)} is VALID [2022-04-08 06:11:17,080 INFO L290 TraceCheckUtils]: 134: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,080 INFO L290 TraceCheckUtils]: 133: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,080 INFO L290 TraceCheckUtils]: 132: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,080 INFO L272 TraceCheckUtils]: 131: Hoare triple {138884#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,080 INFO L290 TraceCheckUtils]: 130: Hoare triple {138884#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {138884#(< ~counter~0 50)} is VALID [2022-04-08 06:11:17,084 INFO L290 TraceCheckUtils]: 129: Hoare triple {138909#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138884#(< ~counter~0 50)} is VALID [2022-04-08 06:11:17,084 INFO L290 TraceCheckUtils]: 128: Hoare triple {138909#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138909#(< ~counter~0 49)} is VALID [2022-04-08 06:11:17,084 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138396#true} {138909#(< ~counter~0 49)} #96#return; {138909#(< ~counter~0 49)} is VALID [2022-04-08 06:11:17,085 INFO L290 TraceCheckUtils]: 126: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,085 INFO L290 TraceCheckUtils]: 125: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,085 INFO L290 TraceCheckUtils]: 124: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,085 INFO L272 TraceCheckUtils]: 123: Hoare triple {138909#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,085 INFO L290 TraceCheckUtils]: 122: Hoare triple {138909#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {138909#(< ~counter~0 49)} is VALID [2022-04-08 06:11:17,086 INFO L290 TraceCheckUtils]: 121: Hoare triple {138934#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138909#(< ~counter~0 49)} is VALID [2022-04-08 06:11:17,087 INFO L290 TraceCheckUtils]: 120: Hoare triple {138934#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138934#(< ~counter~0 48)} is VALID [2022-04-08 06:11:17,087 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138396#true} {138934#(< ~counter~0 48)} #96#return; {138934#(< ~counter~0 48)} is VALID [2022-04-08 06:11:17,087 INFO L290 TraceCheckUtils]: 118: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,087 INFO L290 TraceCheckUtils]: 117: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,087 INFO L290 TraceCheckUtils]: 116: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,087 INFO L272 TraceCheckUtils]: 115: Hoare triple {138934#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,088 INFO L290 TraceCheckUtils]: 114: Hoare triple {138934#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {138934#(< ~counter~0 48)} is VALID [2022-04-08 06:11:17,090 INFO L290 TraceCheckUtils]: 113: Hoare triple {138959#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138934#(< ~counter~0 48)} is VALID [2022-04-08 06:11:17,090 INFO L290 TraceCheckUtils]: 112: Hoare triple {138959#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138959#(< ~counter~0 47)} is VALID [2022-04-08 06:11:17,091 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138396#true} {138959#(< ~counter~0 47)} #96#return; {138959#(< ~counter~0 47)} is VALID [2022-04-08 06:11:17,091 INFO L290 TraceCheckUtils]: 110: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,091 INFO L290 TraceCheckUtils]: 109: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,091 INFO L290 TraceCheckUtils]: 108: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,091 INFO L272 TraceCheckUtils]: 107: Hoare triple {138959#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,091 INFO L290 TraceCheckUtils]: 106: Hoare triple {138959#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {138959#(< ~counter~0 47)} is VALID [2022-04-08 06:11:17,093 INFO L290 TraceCheckUtils]: 105: Hoare triple {138984#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138959#(< ~counter~0 47)} is VALID [2022-04-08 06:11:17,093 INFO L290 TraceCheckUtils]: 104: Hoare triple {138984#(< ~counter~0 46)} assume !!(0 != ~r~0); {138984#(< ~counter~0 46)} is VALID [2022-04-08 06:11:17,094 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138396#true} {138984#(< ~counter~0 46)} #94#return; {138984#(< ~counter~0 46)} is VALID [2022-04-08 06:11:17,094 INFO L290 TraceCheckUtils]: 102: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,094 INFO L290 TraceCheckUtils]: 101: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,094 INFO L290 TraceCheckUtils]: 100: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,094 INFO L272 TraceCheckUtils]: 99: Hoare triple {138984#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,094 INFO L290 TraceCheckUtils]: 98: Hoare triple {138984#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {138984#(< ~counter~0 46)} is VALID [2022-04-08 06:11:17,096 INFO L290 TraceCheckUtils]: 97: Hoare triple {139009#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138984#(< ~counter~0 46)} is VALID [2022-04-08 06:11:17,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {139009#(< ~counter~0 45)} assume !(~r~0 < 0); {139009#(< ~counter~0 45)} is VALID [2022-04-08 06:11:17,096 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138396#true} {139009#(< ~counter~0 45)} #98#return; {139009#(< ~counter~0 45)} is VALID [2022-04-08 06:11:17,097 INFO L290 TraceCheckUtils]: 94: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,097 INFO L290 TraceCheckUtils]: 92: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,097 INFO L272 TraceCheckUtils]: 91: Hoare triple {139009#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,097 INFO L290 TraceCheckUtils]: 90: Hoare triple {139009#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {139009#(< ~counter~0 45)} is VALID [2022-04-08 06:11:17,099 INFO L290 TraceCheckUtils]: 89: Hoare triple {139034#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139009#(< ~counter~0 45)} is VALID [2022-04-08 06:11:17,099 INFO L290 TraceCheckUtils]: 88: Hoare triple {139034#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139034#(< ~counter~0 44)} is VALID [2022-04-08 06:11:17,099 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138396#true} {139034#(< ~counter~0 44)} #98#return; {139034#(< ~counter~0 44)} is VALID [2022-04-08 06:11:17,100 INFO L290 TraceCheckUtils]: 86: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,100 INFO L290 TraceCheckUtils]: 85: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,100 INFO L290 TraceCheckUtils]: 84: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,100 INFO L272 TraceCheckUtils]: 83: Hoare triple {139034#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {139034#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {139034#(< ~counter~0 44)} is VALID [2022-04-08 06:11:17,101 INFO L290 TraceCheckUtils]: 81: Hoare triple {139059#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139034#(< ~counter~0 44)} is VALID [2022-04-08 06:11:17,102 INFO L290 TraceCheckUtils]: 80: Hoare triple {139059#(< ~counter~0 43)} assume !(~r~0 > 0); {139059#(< ~counter~0 43)} is VALID [2022-04-08 06:11:17,102 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138396#true} {139059#(< ~counter~0 43)} #96#return; {139059#(< ~counter~0 43)} is VALID [2022-04-08 06:11:17,102 INFO L290 TraceCheckUtils]: 78: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,102 INFO L290 TraceCheckUtils]: 77: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,102 INFO L290 TraceCheckUtils]: 76: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,102 INFO L272 TraceCheckUtils]: 75: Hoare triple {139059#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {139059#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {139059#(< ~counter~0 43)} is VALID [2022-04-08 06:11:17,104 INFO L290 TraceCheckUtils]: 73: Hoare triple {139084#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139059#(< ~counter~0 43)} is VALID [2022-04-08 06:11:17,104 INFO L290 TraceCheckUtils]: 72: Hoare triple {139084#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139084#(< ~counter~0 42)} is VALID [2022-04-08 06:11:17,105 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138396#true} {139084#(< ~counter~0 42)} #96#return; {139084#(< ~counter~0 42)} is VALID [2022-04-08 06:11:17,105 INFO L290 TraceCheckUtils]: 70: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,105 INFO L290 TraceCheckUtils]: 69: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,105 INFO L272 TraceCheckUtils]: 67: Hoare triple {139084#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,105 INFO L290 TraceCheckUtils]: 66: Hoare triple {139084#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {139084#(< ~counter~0 42)} is VALID [2022-04-08 06:11:17,107 INFO L290 TraceCheckUtils]: 65: Hoare triple {139109#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139084#(< ~counter~0 42)} is VALID [2022-04-08 06:11:17,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {139109#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139109#(< ~counter~0 41)} is VALID [2022-04-08 06:11:17,108 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138396#true} {139109#(< ~counter~0 41)} #96#return; {139109#(< ~counter~0 41)} is VALID [2022-04-08 06:11:17,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,108 INFO L272 TraceCheckUtils]: 59: Hoare triple {139109#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {139109#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {139109#(< ~counter~0 41)} is VALID [2022-04-08 06:11:17,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {139134#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139109#(< ~counter~0 41)} is VALID [2022-04-08 06:11:17,110 INFO L290 TraceCheckUtils]: 56: Hoare triple {139134#(< ~counter~0 40)} assume !!(0 != ~r~0); {139134#(< ~counter~0 40)} is VALID [2022-04-08 06:11:17,110 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138396#true} {139134#(< ~counter~0 40)} #94#return; {139134#(< ~counter~0 40)} is VALID [2022-04-08 06:11:17,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,111 INFO L272 TraceCheckUtils]: 51: Hoare triple {139134#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {139134#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {139134#(< ~counter~0 40)} is VALID [2022-04-08 06:11:17,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {139159#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139134#(< ~counter~0 40)} is VALID [2022-04-08 06:11:17,113 INFO L290 TraceCheckUtils]: 48: Hoare triple {139159#(< ~counter~0 39)} assume !(~r~0 < 0); {139159#(< ~counter~0 39)} is VALID [2022-04-08 06:11:17,113 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138396#true} {139159#(< ~counter~0 39)} #98#return; {139159#(< ~counter~0 39)} is VALID [2022-04-08 06:11:17,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,113 INFO L272 TraceCheckUtils]: 43: Hoare triple {139159#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {139159#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {139159#(< ~counter~0 39)} is VALID [2022-04-08 06:11:17,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {139184#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139159#(< ~counter~0 39)} is VALID [2022-04-08 06:11:17,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {139184#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139184#(< ~counter~0 38)} is VALID [2022-04-08 06:11:17,116 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138396#true} {139184#(< ~counter~0 38)} #98#return; {139184#(< ~counter~0 38)} is VALID [2022-04-08 06:11:17,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,116 INFO L272 TraceCheckUtils]: 35: Hoare triple {139184#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {139184#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {139184#(< ~counter~0 38)} is VALID [2022-04-08 06:11:17,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {139209#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139184#(< ~counter~0 38)} is VALID [2022-04-08 06:11:17,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {139209#(< ~counter~0 37)} assume !(~r~0 > 0); {139209#(< ~counter~0 37)} is VALID [2022-04-08 06:11:17,119 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138396#true} {139209#(< ~counter~0 37)} #96#return; {139209#(< ~counter~0 37)} is VALID [2022-04-08 06:11:17,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,120 INFO L272 TraceCheckUtils]: 27: Hoare triple {139209#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {139209#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {139209#(< ~counter~0 37)} is VALID [2022-04-08 06:11:17,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {139234#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139209#(< ~counter~0 37)} is VALID [2022-04-08 06:11:17,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {139234#(< ~counter~0 36)} assume !!(0 != ~r~0); {139234#(< ~counter~0 36)} is VALID [2022-04-08 06:11:17,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138396#true} {139234#(< ~counter~0 36)} #94#return; {139234#(< ~counter~0 36)} is VALID [2022-04-08 06:11:17,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,122 INFO L272 TraceCheckUtils]: 19: Hoare triple {139234#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {139234#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {139234#(< ~counter~0 36)} is VALID [2022-04-08 06:11:17,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {139259#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139234#(< ~counter~0 36)} is VALID [2022-04-08 06:11:17,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {139259#(< ~counter~0 35)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {139259#(< ~counter~0 35)} is VALID [2022-04-08 06:11:17,125 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138396#true} {139259#(< ~counter~0 35)} #92#return; {139259#(< ~counter~0 35)} is VALID [2022-04-08 06:11:17,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {139259#(< ~counter~0 35)} 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)); {138396#true} is VALID [2022-04-08 06:11:17,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138396#true} {139259#(< ~counter~0 35)} #90#return; {139259#(< ~counter~0 35)} is VALID [2022-04-08 06:11:17,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-08 06:11:17,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-08 06:11:17,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-08 06:11:17,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {139259#(< ~counter~0 35)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138396#true} is VALID [2022-04-08 06:11:17,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {139259#(< ~counter~0 35)} 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; {139259#(< ~counter~0 35)} is VALID [2022-04-08 06:11:17,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {139259#(< ~counter~0 35)} call #t~ret9 := main(); {139259#(< ~counter~0 35)} is VALID [2022-04-08 06:11:17,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139259#(< ~counter~0 35)} {138396#true} #102#return; {139259#(< ~counter~0 35)} is VALID [2022-04-08 06:11:17,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {139259#(< ~counter~0 35)} assume true; {139259#(< ~counter~0 35)} is VALID [2022-04-08 06:11:17,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {138396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {139259#(< ~counter~0 35)} is VALID [2022-04-08 06:11:17,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {138396#true} call ULTIMATE.init(); {138396#true} is VALID [2022-04-08 06:11:17,128 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-08 06:11:17,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884221587] [2022-04-08 06:11:17,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820563466] [2022-04-08 06:11:17,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820563466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:11:17,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:11:17,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 06:11:17,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1375419063] [2022-04-08 06:11:17,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1375419063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:17,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:17,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 06:11:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147480082] [2022-04-08 06:11:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:17,129 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-08 06:11:17,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:17,130 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-08 06:11:17,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:17,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 06:11:17,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:17,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 06:11:17,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 06:11:17,316 INFO L87 Difference]: Start difference. First operand 778 states and 1041 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-08 06:11:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:23,228 INFO L93 Difference]: Finished difference Result 965 states and 1319 transitions. [2022-04-08 06:11:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 06:11:23,228 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-08 06:11:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:23,229 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-08 06:11:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-08 06:11:23,232 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-08 06:11:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-08 06:11:23,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 336 transitions. [2022-04-08 06:11:23,657 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-08 06:11:23,683 INFO L225 Difference]: With dead ends: 965 [2022-04-08 06:11:23,684 INFO L226 Difference]: Without dead ends: 795 [2022-04-08 06:11:23,684 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1042, Invalid=1408, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 06:11:23,685 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 219 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:23,685 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 344 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 06:11:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-08 06:11:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-04-08 06:11:26,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:26,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:11:26,758 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:11:26,758 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:11:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:26,780 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-08 06:11:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 06:11:26,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:26,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:26,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-08 06:11:26,782 INFO L87 Difference]: Start difference. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-08 06:11:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:26,804 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-08 06:11:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 06:11:26,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:26,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:26,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:26,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:11:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1058 transitions. [2022-04-08 06:11:26,834 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1058 transitions. Word has length 147 [2022-04-08 06:11:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:26,834 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 1058 transitions. [2022-04-08 06:11:26,834 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-08 06:11:26,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 795 states and 1058 transitions. [2022-04-08 06:11:38,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1058 edges. 1056 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 06:11:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-08 06:11:38,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:38,232 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-08 06:11:38,249 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-08 06:11:38,432 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-08 06:11:38,432 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 15 times [2022-04-08 06:11:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:38,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225341114] [2022-04-08 06:11:38,433 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 16 times [2022-04-08 06:11:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:38,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590202940] [2022-04-08 06:11:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:38,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:38,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428061671] [2022-04-08 06:11:38,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:11:38,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:38,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:38,448 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-08 06:11:38,450 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-08 06:11:38,569 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:11:38,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:38,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 06:11:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:38,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:11:39,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {144451#true} call ULTIMATE.init(); {144451#true} is VALID [2022-04-08 06:11:39,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {144451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144459#(<= ~counter~0 0)} {144451#true} #102#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {144459#(<= ~counter~0 0)} call #t~ret9 := main(); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {144459#(<= ~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; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {144459#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {144459#(<= ~counter~0 0)} ~cond := #in~cond; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {144459#(<= ~counter~0 0)} assume !(0 == ~cond); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144459#(<= ~counter~0 0)} {144459#(<= ~counter~0 0)} #90#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,447 INFO L272 TraceCheckUtils]: 11: Hoare triple {144459#(<= ~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)); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {144459#(<= ~counter~0 0)} ~cond := #in~cond; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {144459#(<= ~counter~0 0)} assume !(0 == ~cond); {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,448 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144459#(<= ~counter~0 0)} {144459#(<= ~counter~0 0)} #92#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {144459#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {144459#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:39,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {144459#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:39,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {144508#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:39,452 INFO L272 TraceCheckUtils]: 19: Hoare triple {144508#(<= ~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)); {144508#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:39,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {144508#(<= ~counter~0 1)} ~cond := #in~cond; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:39,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {144508#(<= ~counter~0 1)} assume !(0 == ~cond); {144508#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:39,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {144508#(<= ~counter~0 1)} assume true; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:39,453 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144508#(<= ~counter~0 1)} {144508#(<= ~counter~0 1)} #94#return; {144508#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:39,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {144508#(<= ~counter~0 1)} assume !!(0 != ~r~0); {144508#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:39,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {144508#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:39,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {144533#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:39,455 INFO L272 TraceCheckUtils]: 27: Hoare triple {144533#(<= ~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)); {144533#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:39,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {144533#(<= ~counter~0 2)} ~cond := #in~cond; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:39,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {144533#(<= ~counter~0 2)} assume !(0 == ~cond); {144533#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:39,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {144533#(<= ~counter~0 2)} assume true; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:39,457 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144533#(<= ~counter~0 2)} {144533#(<= ~counter~0 2)} #96#return; {144533#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:39,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {144533#(<= ~counter~0 2)} assume !(~r~0 > 0); {144533#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:39,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {144533#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:39,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {144558#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:39,459 INFO L272 TraceCheckUtils]: 35: Hoare triple {144558#(<= ~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)); {144558#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:39,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {144558#(<= ~counter~0 3)} ~cond := #in~cond; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:39,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {144558#(<= ~counter~0 3)} assume !(0 == ~cond); {144558#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:39,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {144558#(<= ~counter~0 3)} assume true; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:39,460 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144558#(<= ~counter~0 3)} {144558#(<= ~counter~0 3)} #98#return; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:39,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {144558#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144558#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:39,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {144558#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:39,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {144583#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:39,463 INFO L272 TraceCheckUtils]: 43: Hoare triple {144583#(<= ~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)); {144583#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:39,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {144583#(<= ~counter~0 4)} ~cond := #in~cond; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:39,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {144583#(<= ~counter~0 4)} assume !(0 == ~cond); {144583#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:39,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {144583#(<= ~counter~0 4)} assume true; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:39,464 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144583#(<= ~counter~0 4)} {144583#(<= ~counter~0 4)} #98#return; {144583#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:39,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {144583#(<= ~counter~0 4)} assume !(~r~0 < 0); {144583#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:39,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {144583#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:39,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {144608#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:39,467 INFO L272 TraceCheckUtils]: 51: Hoare triple {144608#(<= ~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)); {144608#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:39,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {144608#(<= ~counter~0 5)} ~cond := #in~cond; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:39,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {144608#(<= ~counter~0 5)} assume !(0 == ~cond); {144608#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:39,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {144608#(<= ~counter~0 5)} assume true; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:39,468 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144608#(<= ~counter~0 5)} {144608#(<= ~counter~0 5)} #94#return; {144608#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:39,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {144608#(<= ~counter~0 5)} assume !!(0 != ~r~0); {144608#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:39,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {144608#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:39,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {144633#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:39,471 INFO L272 TraceCheckUtils]: 59: Hoare triple {144633#(<= ~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)); {144633#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:39,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {144633#(<= ~counter~0 6)} ~cond := #in~cond; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:39,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {144633#(<= ~counter~0 6)} assume !(0 == ~cond); {144633#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:39,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {144633#(<= ~counter~0 6)} assume true; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:39,472 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144633#(<= ~counter~0 6)} {144633#(<= ~counter~0 6)} #96#return; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:39,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {144633#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144633#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:39,474 INFO L290 TraceCheckUtils]: 65: Hoare triple {144633#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:39,474 INFO L290 TraceCheckUtils]: 66: Hoare triple {144658#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:39,475 INFO L272 TraceCheckUtils]: 67: Hoare triple {144658#(<= ~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)); {144658#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:39,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {144658#(<= ~counter~0 7)} ~cond := #in~cond; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:39,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {144658#(<= ~counter~0 7)} assume !(0 == ~cond); {144658#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:39,476 INFO L290 TraceCheckUtils]: 70: Hoare triple {144658#(<= ~counter~0 7)} assume true; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:39,476 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144658#(<= ~counter~0 7)} {144658#(<= ~counter~0 7)} #96#return; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:39,476 INFO L290 TraceCheckUtils]: 72: Hoare triple {144658#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144658#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:39,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {144658#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:39,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {144683#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:39,479 INFO L272 TraceCheckUtils]: 75: Hoare triple {144683#(<= ~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)); {144683#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:39,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {144683#(<= ~counter~0 8)} ~cond := #in~cond; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:39,480 INFO L290 TraceCheckUtils]: 77: Hoare triple {144683#(<= ~counter~0 8)} assume !(0 == ~cond); {144683#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:39,480 INFO L290 TraceCheckUtils]: 78: Hoare triple {144683#(<= ~counter~0 8)} assume true; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:39,480 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144683#(<= ~counter~0 8)} {144683#(<= ~counter~0 8)} #96#return; {144683#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:39,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {144683#(<= ~counter~0 8)} assume !(~r~0 > 0); {144683#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:39,482 INFO L290 TraceCheckUtils]: 81: Hoare triple {144683#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:39,482 INFO L290 TraceCheckUtils]: 82: Hoare triple {144708#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:39,483 INFO L272 TraceCheckUtils]: 83: Hoare triple {144708#(<= ~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)); {144708#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:39,483 INFO L290 TraceCheckUtils]: 84: Hoare triple {144708#(<= ~counter~0 9)} ~cond := #in~cond; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:39,483 INFO L290 TraceCheckUtils]: 85: Hoare triple {144708#(<= ~counter~0 9)} assume !(0 == ~cond); {144708#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:39,484 INFO L290 TraceCheckUtils]: 86: Hoare triple {144708#(<= ~counter~0 9)} assume true; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:39,484 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144708#(<= ~counter~0 9)} {144708#(<= ~counter~0 9)} #98#return; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:39,484 INFO L290 TraceCheckUtils]: 88: Hoare triple {144708#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144708#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:39,486 INFO L290 TraceCheckUtils]: 89: Hoare triple {144708#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:39,486 INFO L290 TraceCheckUtils]: 90: Hoare triple {144733#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:39,486 INFO L272 TraceCheckUtils]: 91: Hoare triple {144733#(<= ~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)); {144733#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:39,487 INFO L290 TraceCheckUtils]: 92: Hoare triple {144733#(<= ~counter~0 10)} ~cond := #in~cond; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:39,487 INFO L290 TraceCheckUtils]: 93: Hoare triple {144733#(<= ~counter~0 10)} assume !(0 == ~cond); {144733#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:39,487 INFO L290 TraceCheckUtils]: 94: Hoare triple {144733#(<= ~counter~0 10)} assume true; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:39,488 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144733#(<= ~counter~0 10)} {144733#(<= ~counter~0 10)} #98#return; {144733#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:39,488 INFO L290 TraceCheckUtils]: 96: Hoare triple {144733#(<= ~counter~0 10)} assume !(~r~0 < 0); {144733#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:39,489 INFO L290 TraceCheckUtils]: 97: Hoare triple {144733#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:39,490 INFO L290 TraceCheckUtils]: 98: Hoare triple {144758#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:39,490 INFO L272 TraceCheckUtils]: 99: Hoare triple {144758#(<= ~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)); {144758#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:39,490 INFO L290 TraceCheckUtils]: 100: Hoare triple {144758#(<= ~counter~0 11)} ~cond := #in~cond; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:39,491 INFO L290 TraceCheckUtils]: 101: Hoare triple {144758#(<= ~counter~0 11)} assume !(0 == ~cond); {144758#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:39,491 INFO L290 TraceCheckUtils]: 102: Hoare triple {144758#(<= ~counter~0 11)} assume true; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:39,491 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144758#(<= ~counter~0 11)} {144758#(<= ~counter~0 11)} #94#return; {144758#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:39,492 INFO L290 TraceCheckUtils]: 104: Hoare triple {144758#(<= ~counter~0 11)} assume !!(0 != ~r~0); {144758#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:39,493 INFO L290 TraceCheckUtils]: 105: Hoare triple {144758#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:39,493 INFO L290 TraceCheckUtils]: 106: Hoare triple {144783#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:39,494 INFO L272 TraceCheckUtils]: 107: Hoare triple {144783#(<= ~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)); {144783#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:39,494 INFO L290 TraceCheckUtils]: 108: Hoare triple {144783#(<= ~counter~0 12)} ~cond := #in~cond; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:39,494 INFO L290 TraceCheckUtils]: 109: Hoare triple {144783#(<= ~counter~0 12)} assume !(0 == ~cond); {144783#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:39,495 INFO L290 TraceCheckUtils]: 110: Hoare triple {144783#(<= ~counter~0 12)} assume true; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:39,495 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144783#(<= ~counter~0 12)} {144783#(<= ~counter~0 12)} #96#return; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:39,495 INFO L290 TraceCheckUtils]: 112: Hoare triple {144783#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144783#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:39,497 INFO L290 TraceCheckUtils]: 113: Hoare triple {144783#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:39,497 INFO L290 TraceCheckUtils]: 114: Hoare triple {144808#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:39,497 INFO L272 TraceCheckUtils]: 115: Hoare triple {144808#(<= ~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)); {144808#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:39,498 INFO L290 TraceCheckUtils]: 116: Hoare triple {144808#(<= ~counter~0 13)} ~cond := #in~cond; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:39,498 INFO L290 TraceCheckUtils]: 117: Hoare triple {144808#(<= ~counter~0 13)} assume !(0 == ~cond); {144808#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:39,498 INFO L290 TraceCheckUtils]: 118: Hoare triple {144808#(<= ~counter~0 13)} assume true; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:39,499 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144808#(<= ~counter~0 13)} {144808#(<= ~counter~0 13)} #96#return; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:39,499 INFO L290 TraceCheckUtils]: 120: Hoare triple {144808#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144808#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:39,500 INFO L290 TraceCheckUtils]: 121: Hoare triple {144808#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:39,501 INFO L290 TraceCheckUtils]: 122: Hoare triple {144833#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:39,501 INFO L272 TraceCheckUtils]: 123: Hoare triple {144833#(<= ~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)); {144833#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:39,501 INFO L290 TraceCheckUtils]: 124: Hoare triple {144833#(<= ~counter~0 14)} ~cond := #in~cond; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:39,502 INFO L290 TraceCheckUtils]: 125: Hoare triple {144833#(<= ~counter~0 14)} assume !(0 == ~cond); {144833#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:39,502 INFO L290 TraceCheckUtils]: 126: Hoare triple {144833#(<= ~counter~0 14)} assume true; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:39,502 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144833#(<= ~counter~0 14)} {144833#(<= ~counter~0 14)} #96#return; {144833#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:39,503 INFO L290 TraceCheckUtils]: 128: Hoare triple {144833#(<= ~counter~0 14)} assume !(~r~0 > 0); {144833#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:39,504 INFO L290 TraceCheckUtils]: 129: Hoare triple {144833#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:39,504 INFO L290 TraceCheckUtils]: 130: Hoare triple {144858#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:39,505 INFO L272 TraceCheckUtils]: 131: Hoare triple {144858#(<= ~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)); {144858#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:39,505 INFO L290 TraceCheckUtils]: 132: Hoare triple {144858#(<= ~counter~0 15)} ~cond := #in~cond; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:39,505 INFO L290 TraceCheckUtils]: 133: Hoare triple {144858#(<= ~counter~0 15)} assume !(0 == ~cond); {144858#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:39,505 INFO L290 TraceCheckUtils]: 134: Hoare triple {144858#(<= ~counter~0 15)} assume true; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:39,506 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144858#(<= ~counter~0 15)} {144858#(<= ~counter~0 15)} #98#return; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:39,506 INFO L290 TraceCheckUtils]: 136: Hoare triple {144858#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144858#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:39,508 INFO L290 TraceCheckUtils]: 137: Hoare triple {144858#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:39,508 INFO L290 TraceCheckUtils]: 138: Hoare triple {144883#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:39,508 INFO L272 TraceCheckUtils]: 139: Hoare triple {144883#(<= ~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)); {144883#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:39,509 INFO L290 TraceCheckUtils]: 140: Hoare triple {144883#(<= ~counter~0 16)} ~cond := #in~cond; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:39,509 INFO L290 TraceCheckUtils]: 141: Hoare triple {144883#(<= ~counter~0 16)} assume !(0 == ~cond); {144883#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:39,509 INFO L290 TraceCheckUtils]: 142: Hoare triple {144883#(<= ~counter~0 16)} assume true; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:39,510 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144883#(<= ~counter~0 16)} {144883#(<= ~counter~0 16)} #98#return; {144883#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:39,510 INFO L290 TraceCheckUtils]: 144: Hoare triple {144883#(<= ~counter~0 16)} assume !(~r~0 < 0); {144883#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:39,510 INFO L290 TraceCheckUtils]: 145: Hoare triple {144883#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144908#(<= |main_#t~post6| 16)} is VALID [2022-04-08 06:11:39,511 INFO L290 TraceCheckUtils]: 146: Hoare triple {144908#(<= |main_#t~post6| 16)} assume !(#t~post6 < 50);havoc #t~post6; {144452#false} is VALID [2022-04-08 06:11:39,511 INFO L272 TraceCheckUtils]: 147: Hoare triple {144452#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)); {144452#false} is VALID [2022-04-08 06:11:39,511 INFO L290 TraceCheckUtils]: 148: Hoare triple {144452#false} ~cond := #in~cond; {144452#false} is VALID [2022-04-08 06:11:39,511 INFO L290 TraceCheckUtils]: 149: Hoare triple {144452#false} assume 0 == ~cond; {144452#false} is VALID [2022-04-08 06:11:39,511 INFO L290 TraceCheckUtils]: 150: Hoare triple {144452#false} assume !false; {144452#false} is VALID [2022-04-08 06:11:39,511 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-08 06:11:39,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:40,638 INFO L290 TraceCheckUtils]: 150: Hoare triple {144452#false} assume !false; {144452#false} is VALID [2022-04-08 06:11:40,638 INFO L290 TraceCheckUtils]: 149: Hoare triple {144452#false} assume 0 == ~cond; {144452#false} is VALID [2022-04-08 06:11:40,638 INFO L290 TraceCheckUtils]: 148: Hoare triple {144452#false} ~cond := #in~cond; {144452#false} is VALID [2022-04-08 06:11:40,639 INFO L272 TraceCheckUtils]: 147: Hoare triple {144452#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)); {144452#false} is VALID [2022-04-08 06:11:40,639 INFO L290 TraceCheckUtils]: 146: Hoare triple {144936#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {144452#false} is VALID [2022-04-08 06:11:40,639 INFO L290 TraceCheckUtils]: 145: Hoare triple {144940#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144936#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:11:40,639 INFO L290 TraceCheckUtils]: 144: Hoare triple {144940#(< ~counter~0 50)} assume !(~r~0 < 0); {144940#(< ~counter~0 50)} is VALID [2022-04-08 06:11:40,640 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144451#true} {144940#(< ~counter~0 50)} #98#return; {144940#(< ~counter~0 50)} is VALID [2022-04-08 06:11:40,640 INFO L290 TraceCheckUtils]: 142: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,640 INFO L290 TraceCheckUtils]: 141: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,640 INFO L290 TraceCheckUtils]: 140: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,640 INFO L272 TraceCheckUtils]: 139: Hoare triple {144940#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,641 INFO L290 TraceCheckUtils]: 138: Hoare triple {144940#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {144940#(< ~counter~0 50)} is VALID [2022-04-08 06:11:40,644 INFO L290 TraceCheckUtils]: 137: Hoare triple {144965#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144940#(< ~counter~0 50)} is VALID [2022-04-08 06:11:40,644 INFO L290 TraceCheckUtils]: 136: Hoare triple {144965#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144965#(< ~counter~0 49)} is VALID [2022-04-08 06:11:40,644 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144451#true} {144965#(< ~counter~0 49)} #98#return; {144965#(< ~counter~0 49)} is VALID [2022-04-08 06:11:40,645 INFO L290 TraceCheckUtils]: 134: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,645 INFO L290 TraceCheckUtils]: 133: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,645 INFO L290 TraceCheckUtils]: 132: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,645 INFO L272 TraceCheckUtils]: 131: Hoare triple {144965#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,645 INFO L290 TraceCheckUtils]: 130: Hoare triple {144965#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {144965#(< ~counter~0 49)} is VALID [2022-04-08 06:11:40,646 INFO L290 TraceCheckUtils]: 129: Hoare triple {144990#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144965#(< ~counter~0 49)} is VALID [2022-04-08 06:11:40,647 INFO L290 TraceCheckUtils]: 128: Hoare triple {144990#(< ~counter~0 48)} assume !(~r~0 > 0); {144990#(< ~counter~0 48)} is VALID [2022-04-08 06:11:40,647 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144451#true} {144990#(< ~counter~0 48)} #96#return; {144990#(< ~counter~0 48)} is VALID [2022-04-08 06:11:40,647 INFO L290 TraceCheckUtils]: 126: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,647 INFO L290 TraceCheckUtils]: 125: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,647 INFO L290 TraceCheckUtils]: 124: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,647 INFO L272 TraceCheckUtils]: 123: Hoare triple {144990#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,648 INFO L290 TraceCheckUtils]: 122: Hoare triple {144990#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {144990#(< ~counter~0 48)} is VALID [2022-04-08 06:11:40,649 INFO L290 TraceCheckUtils]: 121: Hoare triple {145015#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144990#(< ~counter~0 48)} is VALID [2022-04-08 06:11:40,649 INFO L290 TraceCheckUtils]: 120: Hoare triple {145015#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145015#(< ~counter~0 47)} is VALID [2022-04-08 06:11:40,650 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144451#true} {145015#(< ~counter~0 47)} #96#return; {145015#(< ~counter~0 47)} is VALID [2022-04-08 06:11:40,650 INFO L290 TraceCheckUtils]: 118: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,650 INFO L290 TraceCheckUtils]: 117: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,650 INFO L290 TraceCheckUtils]: 116: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,650 INFO L272 TraceCheckUtils]: 115: Hoare triple {145015#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,650 INFO L290 TraceCheckUtils]: 114: Hoare triple {145015#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {145015#(< ~counter~0 47)} is VALID [2022-04-08 06:11:40,658 INFO L290 TraceCheckUtils]: 113: Hoare triple {145040#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145015#(< ~counter~0 47)} is VALID [2022-04-08 06:11:40,658 INFO L290 TraceCheckUtils]: 112: Hoare triple {145040#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145040#(< ~counter~0 46)} is VALID [2022-04-08 06:11:40,659 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144451#true} {145040#(< ~counter~0 46)} #96#return; {145040#(< ~counter~0 46)} is VALID [2022-04-08 06:11:40,659 INFO L290 TraceCheckUtils]: 110: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,659 INFO L290 TraceCheckUtils]: 109: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,659 INFO L290 TraceCheckUtils]: 108: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,659 INFO L272 TraceCheckUtils]: 107: Hoare triple {145040#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,660 INFO L290 TraceCheckUtils]: 106: Hoare triple {145040#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {145040#(< ~counter~0 46)} is VALID [2022-04-08 06:11:40,661 INFO L290 TraceCheckUtils]: 105: Hoare triple {145065#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145040#(< ~counter~0 46)} is VALID [2022-04-08 06:11:40,661 INFO L290 TraceCheckUtils]: 104: Hoare triple {145065#(< ~counter~0 45)} assume !!(0 != ~r~0); {145065#(< ~counter~0 45)} is VALID [2022-04-08 06:11:40,662 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144451#true} {145065#(< ~counter~0 45)} #94#return; {145065#(< ~counter~0 45)} is VALID [2022-04-08 06:11:40,662 INFO L290 TraceCheckUtils]: 102: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,662 INFO L290 TraceCheckUtils]: 101: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,662 INFO L290 TraceCheckUtils]: 100: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,662 INFO L272 TraceCheckUtils]: 99: Hoare triple {145065#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,662 INFO L290 TraceCheckUtils]: 98: Hoare triple {145065#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {145065#(< ~counter~0 45)} is VALID [2022-04-08 06:11:40,664 INFO L290 TraceCheckUtils]: 97: Hoare triple {145090#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145065#(< ~counter~0 45)} is VALID [2022-04-08 06:11:40,664 INFO L290 TraceCheckUtils]: 96: Hoare triple {145090#(< ~counter~0 44)} assume !(~r~0 < 0); {145090#(< ~counter~0 44)} is VALID [2022-04-08 06:11:40,665 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144451#true} {145090#(< ~counter~0 44)} #98#return; {145090#(< ~counter~0 44)} is VALID [2022-04-08 06:11:40,665 INFO L290 TraceCheckUtils]: 94: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,665 INFO L290 TraceCheckUtils]: 93: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,665 INFO L290 TraceCheckUtils]: 92: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,665 INFO L272 TraceCheckUtils]: 91: Hoare triple {145090#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,665 INFO L290 TraceCheckUtils]: 90: Hoare triple {145090#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {145090#(< ~counter~0 44)} is VALID [2022-04-08 06:11:40,666 INFO L290 TraceCheckUtils]: 89: Hoare triple {145115#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145090#(< ~counter~0 44)} is VALID [2022-04-08 06:11:40,667 INFO L290 TraceCheckUtils]: 88: Hoare triple {145115#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145115#(< ~counter~0 43)} is VALID [2022-04-08 06:11:40,667 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144451#true} {145115#(< ~counter~0 43)} #98#return; {145115#(< ~counter~0 43)} is VALID [2022-04-08 06:11:40,667 INFO L290 TraceCheckUtils]: 86: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,667 INFO L290 TraceCheckUtils]: 85: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,667 INFO L290 TraceCheckUtils]: 84: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,668 INFO L272 TraceCheckUtils]: 83: Hoare triple {145115#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,668 INFO L290 TraceCheckUtils]: 82: Hoare triple {145115#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {145115#(< ~counter~0 43)} is VALID [2022-04-08 06:11:40,669 INFO L290 TraceCheckUtils]: 81: Hoare triple {145140#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145115#(< ~counter~0 43)} is VALID [2022-04-08 06:11:40,669 INFO L290 TraceCheckUtils]: 80: Hoare triple {145140#(< ~counter~0 42)} assume !(~r~0 > 0); {145140#(< ~counter~0 42)} is VALID [2022-04-08 06:11:40,670 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144451#true} {145140#(< ~counter~0 42)} #96#return; {145140#(< ~counter~0 42)} is VALID [2022-04-08 06:11:40,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,670 INFO L290 TraceCheckUtils]: 77: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,670 INFO L290 TraceCheckUtils]: 76: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,670 INFO L272 TraceCheckUtils]: 75: Hoare triple {145140#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {145140#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {145140#(< ~counter~0 42)} is VALID [2022-04-08 06:11:40,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {145165#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145140#(< ~counter~0 42)} is VALID [2022-04-08 06:11:40,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {145165#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145165#(< ~counter~0 41)} is VALID [2022-04-08 06:11:40,672 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144451#true} {145165#(< ~counter~0 41)} #96#return; {145165#(< ~counter~0 41)} is VALID [2022-04-08 06:11:40,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,673 INFO L290 TraceCheckUtils]: 68: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,673 INFO L272 TraceCheckUtils]: 67: Hoare triple {145165#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,673 INFO L290 TraceCheckUtils]: 66: Hoare triple {145165#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {145165#(< ~counter~0 41)} is VALID [2022-04-08 06:11:40,674 INFO L290 TraceCheckUtils]: 65: Hoare triple {145190#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145165#(< ~counter~0 41)} is VALID [2022-04-08 06:11:40,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {145190#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145190#(< ~counter~0 40)} is VALID [2022-04-08 06:11:40,675 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144451#true} {145190#(< ~counter~0 40)} #96#return; {145190#(< ~counter~0 40)} is VALID [2022-04-08 06:11:40,675 INFO L290 TraceCheckUtils]: 62: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,675 INFO L290 TraceCheckUtils]: 61: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,676 INFO L272 TraceCheckUtils]: 59: Hoare triple {145190#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {145190#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {145190#(< ~counter~0 40)} is VALID [2022-04-08 06:11:40,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {145215#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145190#(< ~counter~0 40)} is VALID [2022-04-08 06:11:40,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {145215#(< ~counter~0 39)} assume !!(0 != ~r~0); {145215#(< ~counter~0 39)} is VALID [2022-04-08 06:11:40,678 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144451#true} {145215#(< ~counter~0 39)} #94#return; {145215#(< ~counter~0 39)} is VALID [2022-04-08 06:11:40,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,678 INFO L272 TraceCheckUtils]: 51: Hoare triple {145215#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,678 INFO L290 TraceCheckUtils]: 50: Hoare triple {145215#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {145215#(< ~counter~0 39)} is VALID [2022-04-08 06:11:40,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {145240#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145215#(< ~counter~0 39)} is VALID [2022-04-08 06:11:40,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {145240#(< ~counter~0 38)} assume !(~r~0 < 0); {145240#(< ~counter~0 38)} is VALID [2022-04-08 06:11:40,681 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144451#true} {145240#(< ~counter~0 38)} #98#return; {145240#(< ~counter~0 38)} is VALID [2022-04-08 06:11:40,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,681 INFO L272 TraceCheckUtils]: 43: Hoare triple {145240#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {145240#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {145240#(< ~counter~0 38)} is VALID [2022-04-08 06:11:40,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {145265#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145240#(< ~counter~0 38)} is VALID [2022-04-08 06:11:40,683 INFO L290 TraceCheckUtils]: 40: Hoare triple {145265#(< ~counter~0 37)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145265#(< ~counter~0 37)} is VALID [2022-04-08 06:11:40,684 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144451#true} {145265#(< ~counter~0 37)} #98#return; {145265#(< ~counter~0 37)} is VALID [2022-04-08 06:11:40,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,684 INFO L272 TraceCheckUtils]: 35: Hoare triple {145265#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {145265#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {145265#(< ~counter~0 37)} is VALID [2022-04-08 06:11:40,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {145290#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145265#(< ~counter~0 37)} is VALID [2022-04-08 06:11:40,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {145290#(< ~counter~0 36)} assume !(~r~0 > 0); {145290#(< ~counter~0 36)} is VALID [2022-04-08 06:11:40,687 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144451#true} {145290#(< ~counter~0 36)} #96#return; {145290#(< ~counter~0 36)} is VALID [2022-04-08 06:11:40,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,687 INFO L272 TraceCheckUtils]: 27: Hoare triple {145290#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {145290#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {145290#(< ~counter~0 36)} is VALID [2022-04-08 06:11:40,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {145315#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145290#(< ~counter~0 36)} is VALID [2022-04-08 06:11:40,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {145315#(< ~counter~0 35)} assume !!(0 != ~r~0); {145315#(< ~counter~0 35)} is VALID [2022-04-08 06:11:40,690 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144451#true} {145315#(< ~counter~0 35)} #94#return; {145315#(< ~counter~0 35)} is VALID [2022-04-08 06:11:40,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,690 INFO L272 TraceCheckUtils]: 19: Hoare triple {145315#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {145315#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {145315#(< ~counter~0 35)} is VALID [2022-04-08 06:11:40,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {145340#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145315#(< ~counter~0 35)} is VALID [2022-04-08 06:11:40,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {145340#(< ~counter~0 34)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {145340#(< ~counter~0 34)} is VALID [2022-04-08 06:11:40,692 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144451#true} {145340#(< ~counter~0 34)} #92#return; {145340#(< ~counter~0 34)} is VALID [2022-04-08 06:11:40,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,692 INFO L272 TraceCheckUtils]: 11: Hoare triple {145340#(< ~counter~0 34)} 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)); {144451#true} is VALID [2022-04-08 06:11:40,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144451#true} {145340#(< ~counter~0 34)} #90#return; {145340#(< ~counter~0 34)} is VALID [2022-04-08 06:11:40,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-08 06:11:40,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-08 06:11:40,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-08 06:11:40,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {145340#(< ~counter~0 34)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144451#true} is VALID [2022-04-08 06:11:40,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {145340#(< ~counter~0 34)} 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; {145340#(< ~counter~0 34)} is VALID [2022-04-08 06:11:40,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {145340#(< ~counter~0 34)} call #t~ret9 := main(); {145340#(< ~counter~0 34)} is VALID [2022-04-08 06:11:40,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145340#(< ~counter~0 34)} {144451#true} #102#return; {145340#(< ~counter~0 34)} is VALID [2022-04-08 06:11:40,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {145340#(< ~counter~0 34)} assume true; {145340#(< ~counter~0 34)} is VALID [2022-04-08 06:11:40,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {144451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {145340#(< ~counter~0 34)} is VALID [2022-04-08 06:11:40,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {144451#true} call ULTIMATE.init(); {144451#true} is VALID [2022-04-08 06:11:40,695 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-08 06:11:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:40,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590202940] [2022-04-08 06:11:40,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:40,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428061671] [2022-04-08 06:11:40,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428061671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:11:40,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:11:40,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 06:11:40,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:40,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225341114] [2022-04-08 06:11:40,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225341114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:40,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:40,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 06:11:40,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122386045] [2022-04-08 06:11:40,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:40,697 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-08 06:11:40,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:40,697 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-08 06:11:40,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:40,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 06:11:40,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:40,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 06:11:40,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 06:11:40,892 INFO L87 Difference]: Start difference. First operand 795 states and 1058 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-08 06:11:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:47,057 INFO L93 Difference]: Finished difference Result 846 states and 1128 transitions. [2022-04-08 06:11:47,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 06:11:47,058 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-08 06:11:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:47,058 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-08 06:11:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-08 06:11:47,061 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-08 06:11:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-08 06:11:47,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 334 transitions. [2022-04-08 06:11:47,566 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-08 06:11:47,602 INFO L225 Difference]: With dead ends: 846 [2022-04-08 06:11:47,602 INFO L226 Difference]: Without dead ends: 841 [2022-04-08 06:11:47,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1080, Invalid=1470, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 06:11:47,603 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 251 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:47,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 384 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 06:11:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-08 06:11:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 819. [2022-04-08 06:11:50,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:50,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:11:50,789 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:11:50,790 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:11:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:50,813 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-08 06:11:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-08 06:11:50,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:50,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:50,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-08 06:11:50,815 INFO L87 Difference]: Start difference. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-08 06:11:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:50,839 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-08 06:11:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-08 06:11:50,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:50,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:50,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:50,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:11:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1096 transitions. [2022-04-08 06:11:50,871 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1096 transitions. Word has length 151 [2022-04-08 06:11:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:50,871 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1096 transitions. [2022-04-08 06:11:50,872 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-08 06:11:50,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 819 states and 1096 transitions. [2022-04-08 06:12:04,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1095 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1096 transitions. [2022-04-08 06:12:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 06:12:04,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:12:04,015 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-08 06:12:04,033 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-08 06:12:04,216 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-08 06:12:04,216 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:12:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:12:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 27 times [2022-04-08 06:12:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:04,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811658927] [2022-04-08 06:12:04,217 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:12:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 28 times [2022-04-08 06:12:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:12:04,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665062251] [2022-04-08 06:12:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:12:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:12:04,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:12:04,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648939685] [2022-04-08 06:12:04,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:12:04,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:12:04,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:12:04,233 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-08 06:12:04,233 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-08 06:12:04,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:12:04,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:12:04,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 06:12:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:04,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:12:05,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {150432#true} call ULTIMATE.init(); {150432#true} is VALID [2022-04-08 06:12:05,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {150432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150440#(<= ~counter~0 0)} {150432#true} #102#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {150440#(<= ~counter~0 0)} call #t~ret9 := main(); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {150440#(<= ~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; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {150440#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {150440#(<= ~counter~0 0)} ~cond := #in~cond; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {150440#(<= ~counter~0 0)} assume !(0 == ~cond); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150440#(<= ~counter~0 0)} {150440#(<= ~counter~0 0)} #90#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,251 INFO L272 TraceCheckUtils]: 11: Hoare triple {150440#(<= ~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)); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {150440#(<= ~counter~0 0)} ~cond := #in~cond; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {150440#(<= ~counter~0 0)} assume !(0 == ~cond); {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,252 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150440#(<= ~counter~0 0)} {150440#(<= ~counter~0 0)} #92#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {150440#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {150440#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:05,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {150440#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:05,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {150489#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:05,258 INFO L272 TraceCheckUtils]: 19: Hoare triple {150489#(<= ~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)); {150489#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:05,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {150489#(<= ~counter~0 1)} ~cond := #in~cond; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:05,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {150489#(<= ~counter~0 1)} assume !(0 == ~cond); {150489#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:05,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {150489#(<= ~counter~0 1)} assume true; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:05,259 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150489#(<= ~counter~0 1)} {150489#(<= ~counter~0 1)} #94#return; {150489#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:05,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {150489#(<= ~counter~0 1)} assume !!(0 != ~r~0); {150489#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:05,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {150489#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:05,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {150514#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:05,263 INFO L272 TraceCheckUtils]: 27: Hoare triple {150514#(<= ~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)); {150514#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:05,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {150514#(<= ~counter~0 2)} ~cond := #in~cond; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:05,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {150514#(<= ~counter~0 2)} assume !(0 == ~cond); {150514#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:05,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {150514#(<= ~counter~0 2)} assume true; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:05,264 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150514#(<= ~counter~0 2)} {150514#(<= ~counter~0 2)} #96#return; {150514#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:05,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {150514#(<= ~counter~0 2)} assume !(~r~0 > 0); {150514#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:05,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {150514#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:05,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {150539#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:05,268 INFO L272 TraceCheckUtils]: 35: Hoare triple {150539#(<= ~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)); {150539#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:05,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {150539#(<= ~counter~0 3)} ~cond := #in~cond; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:05,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {150539#(<= ~counter~0 3)} assume !(0 == ~cond); {150539#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:05,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {150539#(<= ~counter~0 3)} assume true; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:05,269 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150539#(<= ~counter~0 3)} {150539#(<= ~counter~0 3)} #98#return; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:05,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {150539#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150539#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:05,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {150539#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:05,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {150564#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:05,272 INFO L272 TraceCheckUtils]: 43: Hoare triple {150564#(<= ~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)); {150564#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:05,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {150564#(<= ~counter~0 4)} ~cond := #in~cond; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:05,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {150564#(<= ~counter~0 4)} assume !(0 == ~cond); {150564#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:05,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {150564#(<= ~counter~0 4)} assume true; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:05,274 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150564#(<= ~counter~0 4)} {150564#(<= ~counter~0 4)} #98#return; {150564#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:05,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {150564#(<= ~counter~0 4)} assume !(~r~0 < 0); {150564#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:05,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {150564#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:05,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {150589#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:05,277 INFO L272 TraceCheckUtils]: 51: Hoare triple {150589#(<= ~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)); {150589#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:05,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {150589#(<= ~counter~0 5)} ~cond := #in~cond; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:05,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {150589#(<= ~counter~0 5)} assume !(0 == ~cond); {150589#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:05,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {150589#(<= ~counter~0 5)} assume true; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:05,278 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150589#(<= ~counter~0 5)} {150589#(<= ~counter~0 5)} #94#return; {150589#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:05,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {150589#(<= ~counter~0 5)} assume !!(0 != ~r~0); {150589#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:05,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {150589#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:05,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {150614#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:05,282 INFO L272 TraceCheckUtils]: 59: Hoare triple {150614#(<= ~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)); {150614#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:05,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {150614#(<= ~counter~0 6)} ~cond := #in~cond; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:05,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {150614#(<= ~counter~0 6)} assume !(0 == ~cond); {150614#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:05,283 INFO L290 TraceCheckUtils]: 62: Hoare triple {150614#(<= ~counter~0 6)} assume true; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:05,283 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150614#(<= ~counter~0 6)} {150614#(<= ~counter~0 6)} #96#return; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:05,284 INFO L290 TraceCheckUtils]: 64: Hoare triple {150614#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150614#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:05,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {150614#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:05,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {150639#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:05,287 INFO L272 TraceCheckUtils]: 67: Hoare triple {150639#(<= ~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)); {150639#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:05,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {150639#(<= ~counter~0 7)} ~cond := #in~cond; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:05,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {150639#(<= ~counter~0 7)} assume !(0 == ~cond); {150639#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:05,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {150639#(<= ~counter~0 7)} assume true; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:05,289 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150639#(<= ~counter~0 7)} {150639#(<= ~counter~0 7)} #96#return; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:05,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {150639#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150639#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:05,292 INFO L290 TraceCheckUtils]: 73: Hoare triple {150639#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:05,292 INFO L290 TraceCheckUtils]: 74: Hoare triple {150664#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:05,293 INFO L272 TraceCheckUtils]: 75: Hoare triple {150664#(<= ~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)); {150664#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:05,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {150664#(<= ~counter~0 8)} ~cond := #in~cond; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:05,294 INFO L290 TraceCheckUtils]: 77: Hoare triple {150664#(<= ~counter~0 8)} assume !(0 == ~cond); {150664#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:05,294 INFO L290 TraceCheckUtils]: 78: Hoare triple {150664#(<= ~counter~0 8)} assume true; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:05,294 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150664#(<= ~counter~0 8)} {150664#(<= ~counter~0 8)} #96#return; {150664#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:05,295 INFO L290 TraceCheckUtils]: 80: Hoare triple {150664#(<= ~counter~0 8)} assume !(~r~0 > 0); {150664#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:05,299 INFO L290 TraceCheckUtils]: 81: Hoare triple {150664#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:05,299 INFO L290 TraceCheckUtils]: 82: Hoare triple {150689#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:05,300 INFO L272 TraceCheckUtils]: 83: Hoare triple {150689#(<= ~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)); {150689#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:05,300 INFO L290 TraceCheckUtils]: 84: Hoare triple {150689#(<= ~counter~0 9)} ~cond := #in~cond; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:05,300 INFO L290 TraceCheckUtils]: 85: Hoare triple {150689#(<= ~counter~0 9)} assume !(0 == ~cond); {150689#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:05,301 INFO L290 TraceCheckUtils]: 86: Hoare triple {150689#(<= ~counter~0 9)} assume true; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:05,301 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150689#(<= ~counter~0 9)} {150689#(<= ~counter~0 9)} #98#return; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:05,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {150689#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150689#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:05,304 INFO L290 TraceCheckUtils]: 89: Hoare triple {150689#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:05,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {150714#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:05,305 INFO L272 TraceCheckUtils]: 91: Hoare triple {150714#(<= ~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)); {150714#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:05,306 INFO L290 TraceCheckUtils]: 92: Hoare triple {150714#(<= ~counter~0 10)} ~cond := #in~cond; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:05,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {150714#(<= ~counter~0 10)} assume !(0 == ~cond); {150714#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:05,306 INFO L290 TraceCheckUtils]: 94: Hoare triple {150714#(<= ~counter~0 10)} assume true; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:05,307 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150714#(<= ~counter~0 10)} {150714#(<= ~counter~0 10)} #98#return; {150714#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:05,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {150714#(<= ~counter~0 10)} assume !(~r~0 < 0); {150714#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:05,310 INFO L290 TraceCheckUtils]: 97: Hoare triple {150714#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:05,311 INFO L290 TraceCheckUtils]: 98: Hoare triple {150739#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:05,311 INFO L272 TraceCheckUtils]: 99: Hoare triple {150739#(<= ~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)); {150739#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:05,311 INFO L290 TraceCheckUtils]: 100: Hoare triple {150739#(<= ~counter~0 11)} ~cond := #in~cond; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:05,312 INFO L290 TraceCheckUtils]: 101: Hoare triple {150739#(<= ~counter~0 11)} assume !(0 == ~cond); {150739#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:05,312 INFO L290 TraceCheckUtils]: 102: Hoare triple {150739#(<= ~counter~0 11)} assume true; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:05,312 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150739#(<= ~counter~0 11)} {150739#(<= ~counter~0 11)} #94#return; {150739#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:05,313 INFO L290 TraceCheckUtils]: 104: Hoare triple {150739#(<= ~counter~0 11)} assume !!(0 != ~r~0); {150739#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:05,315 INFO L290 TraceCheckUtils]: 105: Hoare triple {150739#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:05,316 INFO L290 TraceCheckUtils]: 106: Hoare triple {150764#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:05,316 INFO L272 TraceCheckUtils]: 107: Hoare triple {150764#(<= ~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)); {150764#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:05,317 INFO L290 TraceCheckUtils]: 108: Hoare triple {150764#(<= ~counter~0 12)} ~cond := #in~cond; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:05,317 INFO L290 TraceCheckUtils]: 109: Hoare triple {150764#(<= ~counter~0 12)} assume !(0 == ~cond); {150764#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:05,317 INFO L290 TraceCheckUtils]: 110: Hoare triple {150764#(<= ~counter~0 12)} assume true; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:05,318 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150764#(<= ~counter~0 12)} {150764#(<= ~counter~0 12)} #96#return; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:05,318 INFO L290 TraceCheckUtils]: 112: Hoare triple {150764#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150764#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:05,320 INFO L290 TraceCheckUtils]: 113: Hoare triple {150764#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:05,321 INFO L290 TraceCheckUtils]: 114: Hoare triple {150789#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:05,321 INFO L272 TraceCheckUtils]: 115: Hoare triple {150789#(<= ~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)); {150789#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:05,322 INFO L290 TraceCheckUtils]: 116: Hoare triple {150789#(<= ~counter~0 13)} ~cond := #in~cond; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:05,322 INFO L290 TraceCheckUtils]: 117: Hoare triple {150789#(<= ~counter~0 13)} assume !(0 == ~cond); {150789#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:05,322 INFO L290 TraceCheckUtils]: 118: Hoare triple {150789#(<= ~counter~0 13)} assume true; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:05,323 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150789#(<= ~counter~0 13)} {150789#(<= ~counter~0 13)} #96#return; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:05,323 INFO L290 TraceCheckUtils]: 120: Hoare triple {150789#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150789#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:05,326 INFO L290 TraceCheckUtils]: 121: Hoare triple {150789#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:05,326 INFO L290 TraceCheckUtils]: 122: Hoare triple {150814#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:05,327 INFO L272 TraceCheckUtils]: 123: Hoare triple {150814#(<= ~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)); {150814#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:05,327 INFO L290 TraceCheckUtils]: 124: Hoare triple {150814#(<= ~counter~0 14)} ~cond := #in~cond; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:05,327 INFO L290 TraceCheckUtils]: 125: Hoare triple {150814#(<= ~counter~0 14)} assume !(0 == ~cond); {150814#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:05,328 INFO L290 TraceCheckUtils]: 126: Hoare triple {150814#(<= ~counter~0 14)} assume true; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:05,328 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150814#(<= ~counter~0 14)} {150814#(<= ~counter~0 14)} #96#return; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:05,328 INFO L290 TraceCheckUtils]: 128: Hoare triple {150814#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150814#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:05,331 INFO L290 TraceCheckUtils]: 129: Hoare triple {150814#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:05,331 INFO L290 TraceCheckUtils]: 130: Hoare triple {150839#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:05,332 INFO L272 TraceCheckUtils]: 131: Hoare triple {150839#(<= ~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)); {150839#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:05,332 INFO L290 TraceCheckUtils]: 132: Hoare triple {150839#(<= ~counter~0 15)} ~cond := #in~cond; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:05,332 INFO L290 TraceCheckUtils]: 133: Hoare triple {150839#(<= ~counter~0 15)} assume !(0 == ~cond); {150839#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:05,333 INFO L290 TraceCheckUtils]: 134: Hoare triple {150839#(<= ~counter~0 15)} assume true; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:05,333 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150839#(<= ~counter~0 15)} {150839#(<= ~counter~0 15)} #96#return; {150839#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:05,333 INFO L290 TraceCheckUtils]: 136: Hoare triple {150839#(<= ~counter~0 15)} assume !(~r~0 > 0); {150839#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:05,337 INFO L290 TraceCheckUtils]: 137: Hoare triple {150839#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:05,337 INFO L290 TraceCheckUtils]: 138: Hoare triple {150864#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:05,338 INFO L272 TraceCheckUtils]: 139: Hoare triple {150864#(<= ~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)); {150864#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:05,338 INFO L290 TraceCheckUtils]: 140: Hoare triple {150864#(<= ~counter~0 16)} ~cond := #in~cond; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:05,338 INFO L290 TraceCheckUtils]: 141: Hoare triple {150864#(<= ~counter~0 16)} assume !(0 == ~cond); {150864#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:05,339 INFO L290 TraceCheckUtils]: 142: Hoare triple {150864#(<= ~counter~0 16)} assume true; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:05,339 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150864#(<= ~counter~0 16)} {150864#(<= ~counter~0 16)} #98#return; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:05,339 INFO L290 TraceCheckUtils]: 144: Hoare triple {150864#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150864#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:05,340 INFO L290 TraceCheckUtils]: 145: Hoare triple {150864#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150889#(<= |main_#t~post8| 16)} is VALID [2022-04-08 06:12:05,340 INFO L290 TraceCheckUtils]: 146: Hoare triple {150889#(<= |main_#t~post8| 16)} assume !(#t~post8 < 50);havoc #t~post8; {150433#false} is VALID [2022-04-08 06:12:05,340 INFO L290 TraceCheckUtils]: 147: Hoare triple {150433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150433#false} is VALID [2022-04-08 06:12:05,340 INFO L290 TraceCheckUtils]: 148: Hoare triple {150433#false} assume !(#t~post6 < 50);havoc #t~post6; {150433#false} is VALID [2022-04-08 06:12:05,340 INFO L272 TraceCheckUtils]: 149: Hoare triple {150433#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)); {150433#false} is VALID [2022-04-08 06:12:05,341 INFO L290 TraceCheckUtils]: 150: Hoare triple {150433#false} ~cond := #in~cond; {150433#false} is VALID [2022-04-08 06:12:05,341 INFO L290 TraceCheckUtils]: 151: Hoare triple {150433#false} assume 0 == ~cond; {150433#false} is VALID [2022-04-08 06:12:05,341 INFO L290 TraceCheckUtils]: 152: Hoare triple {150433#false} assume !false; {150433#false} is VALID [2022-04-08 06:12:05,341 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-08 06:12:05,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:12:06,479 INFO L290 TraceCheckUtils]: 152: Hoare triple {150433#false} assume !false; {150433#false} is VALID [2022-04-08 06:12:06,480 INFO L290 TraceCheckUtils]: 151: Hoare triple {150433#false} assume 0 == ~cond; {150433#false} is VALID [2022-04-08 06:12:06,480 INFO L290 TraceCheckUtils]: 150: Hoare triple {150433#false} ~cond := #in~cond; {150433#false} is VALID [2022-04-08 06:12:06,480 INFO L272 TraceCheckUtils]: 149: Hoare triple {150433#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)); {150433#false} is VALID [2022-04-08 06:12:06,480 INFO L290 TraceCheckUtils]: 148: Hoare triple {150433#false} assume !(#t~post6 < 50);havoc #t~post6; {150433#false} is VALID [2022-04-08 06:12:06,480 INFO L290 TraceCheckUtils]: 147: Hoare triple {150433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150433#false} is VALID [2022-04-08 06:12:06,480 INFO L290 TraceCheckUtils]: 146: Hoare triple {150929#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {150433#false} is VALID [2022-04-08 06:12:06,481 INFO L290 TraceCheckUtils]: 145: Hoare triple {150933#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150929#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:12:06,481 INFO L290 TraceCheckUtils]: 144: Hoare triple {150933#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150933#(< ~counter~0 50)} is VALID [2022-04-08 06:12:06,482 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150432#true} {150933#(< ~counter~0 50)} #98#return; {150933#(< ~counter~0 50)} is VALID [2022-04-08 06:12:06,482 INFO L290 TraceCheckUtils]: 142: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,482 INFO L290 TraceCheckUtils]: 141: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,482 INFO L290 TraceCheckUtils]: 140: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,482 INFO L272 TraceCheckUtils]: 139: Hoare triple {150933#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,483 INFO L290 TraceCheckUtils]: 138: Hoare triple {150933#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {150933#(< ~counter~0 50)} is VALID [2022-04-08 06:12:06,489 INFO L290 TraceCheckUtils]: 137: Hoare triple {150958#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150933#(< ~counter~0 50)} is VALID [2022-04-08 06:12:06,489 INFO L290 TraceCheckUtils]: 136: Hoare triple {150958#(< ~counter~0 49)} assume !(~r~0 > 0); {150958#(< ~counter~0 49)} is VALID [2022-04-08 06:12:06,490 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150432#true} {150958#(< ~counter~0 49)} #96#return; {150958#(< ~counter~0 49)} is VALID [2022-04-08 06:12:06,490 INFO L290 TraceCheckUtils]: 134: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,490 INFO L290 TraceCheckUtils]: 133: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,490 INFO L290 TraceCheckUtils]: 132: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,490 INFO L272 TraceCheckUtils]: 131: Hoare triple {150958#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,491 INFO L290 TraceCheckUtils]: 130: Hoare triple {150958#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {150958#(< ~counter~0 49)} is VALID [2022-04-08 06:12:06,494 INFO L290 TraceCheckUtils]: 129: Hoare triple {150983#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150958#(< ~counter~0 49)} is VALID [2022-04-08 06:12:06,494 INFO L290 TraceCheckUtils]: 128: Hoare triple {150983#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150983#(< ~counter~0 48)} is VALID [2022-04-08 06:12:06,495 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150432#true} {150983#(< ~counter~0 48)} #96#return; {150983#(< ~counter~0 48)} is VALID [2022-04-08 06:12:06,495 INFO L290 TraceCheckUtils]: 126: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,495 INFO L290 TraceCheckUtils]: 125: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,495 INFO L290 TraceCheckUtils]: 124: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,495 INFO L272 TraceCheckUtils]: 123: Hoare triple {150983#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,496 INFO L290 TraceCheckUtils]: 122: Hoare triple {150983#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {150983#(< ~counter~0 48)} is VALID [2022-04-08 06:12:06,499 INFO L290 TraceCheckUtils]: 121: Hoare triple {151008#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150983#(< ~counter~0 48)} is VALID [2022-04-08 06:12:06,499 INFO L290 TraceCheckUtils]: 120: Hoare triple {151008#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151008#(< ~counter~0 47)} is VALID [2022-04-08 06:12:06,500 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150432#true} {151008#(< ~counter~0 47)} #96#return; {151008#(< ~counter~0 47)} is VALID [2022-04-08 06:12:06,500 INFO L290 TraceCheckUtils]: 118: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,500 INFO L290 TraceCheckUtils]: 117: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,500 INFO L290 TraceCheckUtils]: 116: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,500 INFO L272 TraceCheckUtils]: 115: Hoare triple {151008#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,501 INFO L290 TraceCheckUtils]: 114: Hoare triple {151008#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {151008#(< ~counter~0 47)} is VALID [2022-04-08 06:12:06,504 INFO L290 TraceCheckUtils]: 113: Hoare triple {151033#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151008#(< ~counter~0 47)} is VALID [2022-04-08 06:12:06,504 INFO L290 TraceCheckUtils]: 112: Hoare triple {151033#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151033#(< ~counter~0 46)} is VALID [2022-04-08 06:12:06,505 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150432#true} {151033#(< ~counter~0 46)} #96#return; {151033#(< ~counter~0 46)} is VALID [2022-04-08 06:12:06,505 INFO L290 TraceCheckUtils]: 110: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,505 INFO L290 TraceCheckUtils]: 109: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,505 INFO L290 TraceCheckUtils]: 108: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,505 INFO L272 TraceCheckUtils]: 107: Hoare triple {151033#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,505 INFO L290 TraceCheckUtils]: 106: Hoare triple {151033#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {151033#(< ~counter~0 46)} is VALID [2022-04-08 06:12:06,508 INFO L290 TraceCheckUtils]: 105: Hoare triple {151058#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151033#(< ~counter~0 46)} is VALID [2022-04-08 06:12:06,508 INFO L290 TraceCheckUtils]: 104: Hoare triple {151058#(< ~counter~0 45)} assume !!(0 != ~r~0); {151058#(< ~counter~0 45)} is VALID [2022-04-08 06:12:06,509 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150432#true} {151058#(< ~counter~0 45)} #94#return; {151058#(< ~counter~0 45)} is VALID [2022-04-08 06:12:06,509 INFO L290 TraceCheckUtils]: 102: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,509 INFO L290 TraceCheckUtils]: 101: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,509 INFO L290 TraceCheckUtils]: 100: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,509 INFO L272 TraceCheckUtils]: 99: Hoare triple {151058#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,509 INFO L290 TraceCheckUtils]: 98: Hoare triple {151058#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {151058#(< ~counter~0 45)} is VALID [2022-04-08 06:12:06,511 INFO L290 TraceCheckUtils]: 97: Hoare triple {151083#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151058#(< ~counter~0 45)} is VALID [2022-04-08 06:12:06,511 INFO L290 TraceCheckUtils]: 96: Hoare triple {151083#(< ~counter~0 44)} assume !(~r~0 < 0); {151083#(< ~counter~0 44)} is VALID [2022-04-08 06:12:06,512 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150432#true} {151083#(< ~counter~0 44)} #98#return; {151083#(< ~counter~0 44)} is VALID [2022-04-08 06:12:06,512 INFO L290 TraceCheckUtils]: 94: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,512 INFO L290 TraceCheckUtils]: 92: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,512 INFO L272 TraceCheckUtils]: 91: Hoare triple {151083#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {151083#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {151083#(< ~counter~0 44)} is VALID [2022-04-08 06:12:06,515 INFO L290 TraceCheckUtils]: 89: Hoare triple {151108#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151083#(< ~counter~0 44)} is VALID [2022-04-08 06:12:06,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {151108#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151108#(< ~counter~0 43)} is VALID [2022-04-08 06:12:06,516 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150432#true} {151108#(< ~counter~0 43)} #98#return; {151108#(< ~counter~0 43)} is VALID [2022-04-08 06:12:06,516 INFO L290 TraceCheckUtils]: 86: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,516 INFO L290 TraceCheckUtils]: 85: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,516 INFO L290 TraceCheckUtils]: 84: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,516 INFO L272 TraceCheckUtils]: 83: Hoare triple {151108#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {151108#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {151108#(< ~counter~0 43)} is VALID [2022-04-08 06:12:06,518 INFO L290 TraceCheckUtils]: 81: Hoare triple {151133#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151108#(< ~counter~0 43)} is VALID [2022-04-08 06:12:06,518 INFO L290 TraceCheckUtils]: 80: Hoare triple {151133#(< ~counter~0 42)} assume !(~r~0 > 0); {151133#(< ~counter~0 42)} is VALID [2022-04-08 06:12:06,519 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150432#true} {151133#(< ~counter~0 42)} #96#return; {151133#(< ~counter~0 42)} is VALID [2022-04-08 06:12:06,519 INFO L290 TraceCheckUtils]: 78: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,519 INFO L290 TraceCheckUtils]: 77: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,519 INFO L290 TraceCheckUtils]: 76: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,519 INFO L272 TraceCheckUtils]: 75: Hoare triple {151133#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,519 INFO L290 TraceCheckUtils]: 74: Hoare triple {151133#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {151133#(< ~counter~0 42)} is VALID [2022-04-08 06:12:06,521 INFO L290 TraceCheckUtils]: 73: Hoare triple {151158#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151133#(< ~counter~0 42)} is VALID [2022-04-08 06:12:06,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {151158#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151158#(< ~counter~0 41)} is VALID [2022-04-08 06:12:06,522 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150432#true} {151158#(< ~counter~0 41)} #96#return; {151158#(< ~counter~0 41)} is VALID [2022-04-08 06:12:06,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,522 INFO L290 TraceCheckUtils]: 68: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,522 INFO L272 TraceCheckUtils]: 67: Hoare triple {151158#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {151158#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {151158#(< ~counter~0 41)} is VALID [2022-04-08 06:12:06,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {151183#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151158#(< ~counter~0 41)} is VALID [2022-04-08 06:12:06,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {151183#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151183#(< ~counter~0 40)} is VALID [2022-04-08 06:12:06,525 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150432#true} {151183#(< ~counter~0 40)} #96#return; {151183#(< ~counter~0 40)} is VALID [2022-04-08 06:12:06,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,525 INFO L272 TraceCheckUtils]: 59: Hoare triple {151183#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {151183#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {151183#(< ~counter~0 40)} is VALID [2022-04-08 06:12:06,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {151208#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151183#(< ~counter~0 40)} is VALID [2022-04-08 06:12:06,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {151208#(< ~counter~0 39)} assume !!(0 != ~r~0); {151208#(< ~counter~0 39)} is VALID [2022-04-08 06:12:06,529 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150432#true} {151208#(< ~counter~0 39)} #94#return; {151208#(< ~counter~0 39)} is VALID [2022-04-08 06:12:06,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,529 INFO L272 TraceCheckUtils]: 51: Hoare triple {151208#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {151208#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {151208#(< ~counter~0 39)} is VALID [2022-04-08 06:12:06,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {151233#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151208#(< ~counter~0 39)} is VALID [2022-04-08 06:12:06,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {151233#(< ~counter~0 38)} assume !(~r~0 < 0); {151233#(< ~counter~0 38)} is VALID [2022-04-08 06:12:06,532 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150432#true} {151233#(< ~counter~0 38)} #98#return; {151233#(< ~counter~0 38)} is VALID [2022-04-08 06:12:06,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,533 INFO L290 TraceCheckUtils]: 45: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,533 INFO L272 TraceCheckUtils]: 43: Hoare triple {151233#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {151233#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {151233#(< ~counter~0 38)} is VALID [2022-04-08 06:12:06,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {151258#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151233#(< ~counter~0 38)} is VALID [2022-04-08 06:12:06,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {151258#(< ~counter~0 37)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151258#(< ~counter~0 37)} is VALID [2022-04-08 06:12:06,536 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150432#true} {151258#(< ~counter~0 37)} #98#return; {151258#(< ~counter~0 37)} is VALID [2022-04-08 06:12:06,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,536 INFO L272 TraceCheckUtils]: 35: Hoare triple {151258#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {151258#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {151258#(< ~counter~0 37)} is VALID [2022-04-08 06:12:06,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {151283#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151258#(< ~counter~0 37)} is VALID [2022-04-08 06:12:06,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {151283#(< ~counter~0 36)} assume !(~r~0 > 0); {151283#(< ~counter~0 36)} is VALID [2022-04-08 06:12:06,539 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150432#true} {151283#(< ~counter~0 36)} #96#return; {151283#(< ~counter~0 36)} is VALID [2022-04-08 06:12:06,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,540 INFO L272 TraceCheckUtils]: 27: Hoare triple {151283#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {151283#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {151283#(< ~counter~0 36)} is VALID [2022-04-08 06:12:06,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {151308#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151283#(< ~counter~0 36)} is VALID [2022-04-08 06:12:06,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {151308#(< ~counter~0 35)} assume !!(0 != ~r~0); {151308#(< ~counter~0 35)} is VALID [2022-04-08 06:12:06,543 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150432#true} {151308#(< ~counter~0 35)} #94#return; {151308#(< ~counter~0 35)} is VALID [2022-04-08 06:12:06,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,543 INFO L272 TraceCheckUtils]: 19: Hoare triple {151308#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {151308#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {151308#(< ~counter~0 35)} is VALID [2022-04-08 06:12:06,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {151333#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151308#(< ~counter~0 35)} is VALID [2022-04-08 06:12:06,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {151333#(< ~counter~0 34)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {151333#(< ~counter~0 34)} is VALID [2022-04-08 06:12:06,547 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150432#true} {151333#(< ~counter~0 34)} #92#return; {151333#(< ~counter~0 34)} is VALID [2022-04-08 06:12:06,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,547 INFO L272 TraceCheckUtils]: 11: Hoare triple {151333#(< ~counter~0 34)} 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)); {150432#true} is VALID [2022-04-08 06:12:06,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150432#true} {151333#(< ~counter~0 34)} #90#return; {151333#(< ~counter~0 34)} is VALID [2022-04-08 06:12:06,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-08 06:12:06,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-08 06:12:06,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-08 06:12:06,548 INFO L272 TraceCheckUtils]: 6: Hoare triple {151333#(< ~counter~0 34)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150432#true} is VALID [2022-04-08 06:12:06,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {151333#(< ~counter~0 34)} 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; {151333#(< ~counter~0 34)} is VALID [2022-04-08 06:12:06,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {151333#(< ~counter~0 34)} call #t~ret9 := main(); {151333#(< ~counter~0 34)} is VALID [2022-04-08 06:12:06,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151333#(< ~counter~0 34)} {150432#true} #102#return; {151333#(< ~counter~0 34)} is VALID [2022-04-08 06:12:06,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {151333#(< ~counter~0 34)} assume true; {151333#(< ~counter~0 34)} is VALID [2022-04-08 06:12:06,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {150432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {151333#(< ~counter~0 34)} is VALID [2022-04-08 06:12:06,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {150432#true} call ULTIMATE.init(); {150432#true} is VALID [2022-04-08 06:12:06,550 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-08 06:12:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:12:06,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665062251] [2022-04-08 06:12:06,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:12:06,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648939685] [2022-04-08 06:12:06,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648939685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:12:06,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:12:06,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 06:12:06,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:12:06,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811658927] [2022-04-08 06:12:06,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811658927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:12:06,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:12:06,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 06:12:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922705135] [2022-04-08 06:12:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:12:06,551 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-08 06:12:06,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:12:06,552 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-08 06:12:06,805 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-08 06:12:06,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 06:12:06,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 06:12:06,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 06:12:06,806 INFO L87 Difference]: Start difference. First operand 819 states and 1096 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-08 06:12:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:13,376 INFO L93 Difference]: Finished difference Result 1023 states and 1398 transitions. [2022-04-08 06:12:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 06:12:13,376 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-08 06:12:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:12:13,376 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-08 06:12:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-08 06:12:13,378 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-08 06:12:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-08 06:12:13,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 356 transitions. [2022-04-08 06:12:14,005 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-08 06:12:14,041 INFO L225 Difference]: With dead ends: 1023 [2022-04-08 06:12:14,041 INFO L226 Difference]: Without dead ends: 845 [2022-04-08 06:12:14,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1125, Invalid=1527, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 06:12:14,042 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 287 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:12:14,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 359 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 06:12:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-08 06:12:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 834. [2022-04-08 06:12:17,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:12:17,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:12:17,329 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:12:17,329 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:12:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:17,352 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-08 06:12:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-08 06:12:17,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:17,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:17,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-08 06:12:17,355 INFO L87 Difference]: Start difference. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-08 06:12:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:17,378 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-08 06:12:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-08 06:12:17,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:17,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:17,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:12:17,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:12:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:12:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1114 transitions. [2022-04-08 06:12:17,412 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1114 transitions. Word has length 153 [2022-04-08 06:12:17,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:12:17,412 INFO L478 AbstractCegarLoop]: Abstraction has 834 states and 1114 transitions. [2022-04-08 06:12:17,412 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-08 06:12:17,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 834 states and 1114 transitions. [2022-04-08 06:12:34,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1114 edges. 1110 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1114 transitions. [2022-04-08 06:12:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-08 06:12:34,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:12:34,706 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-08 06:12:34,723 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-08 06:12:34,906 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-08 06:12:34,907 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:12:34,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:12:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 23 times [2022-04-08 06:12:34,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:34,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [572082595] [2022-04-08 06:12:34,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:12:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 24 times [2022-04-08 06:12:34,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:12:34,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597681396] [2022-04-08 06:12:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:12:34,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:12:34,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:12:34,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47105412] [2022-04-08 06:12:34,922 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:12:34,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:12:34,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:12:34,923 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-08 06:12:34,933 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-08 06:12:35,174 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:12:35,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:12:35,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 06:12:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:35,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:12:36,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {156819#true} call ULTIMATE.init(); {156819#true} is VALID [2022-04-08 06:12:36,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {156819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156827#(<= ~counter~0 0)} {156819#true} #102#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {156827#(<= ~counter~0 0)} call #t~ret9 := main(); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {156827#(<= ~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; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {156827#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {156827#(<= ~counter~0 0)} ~cond := #in~cond; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {156827#(<= ~counter~0 0)} assume !(0 == ~cond); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156827#(<= ~counter~0 0)} {156827#(<= ~counter~0 0)} #90#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,060 INFO L272 TraceCheckUtils]: 11: Hoare triple {156827#(<= ~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)); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {156827#(<= ~counter~0 0)} ~cond := #in~cond; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {156827#(<= ~counter~0 0)} assume !(0 == ~cond); {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,061 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156827#(<= ~counter~0 0)} {156827#(<= ~counter~0 0)} #92#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {156827#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {156827#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:36,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {156827#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:36,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {156876#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:36,066 INFO L272 TraceCheckUtils]: 19: Hoare triple {156876#(<= ~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)); {156876#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:36,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {156876#(<= ~counter~0 1)} ~cond := #in~cond; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:36,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {156876#(<= ~counter~0 1)} assume !(0 == ~cond); {156876#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:36,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {156876#(<= ~counter~0 1)} assume true; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:36,067 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156876#(<= ~counter~0 1)} {156876#(<= ~counter~0 1)} #94#return; {156876#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:36,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {156876#(<= ~counter~0 1)} assume !!(0 != ~r~0); {156876#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:36,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {156876#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:36,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {156901#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:36,069 INFO L272 TraceCheckUtils]: 27: Hoare triple {156901#(<= ~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)); {156901#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:36,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {156901#(<= ~counter~0 2)} ~cond := #in~cond; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:36,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {156901#(<= ~counter~0 2)} assume !(0 == ~cond); {156901#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:36,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {156901#(<= ~counter~0 2)} assume true; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:36,071 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156901#(<= ~counter~0 2)} {156901#(<= ~counter~0 2)} #96#return; {156901#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:36,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {156901#(<= ~counter~0 2)} assume !(~r~0 > 0); {156901#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:36,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {156901#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:36,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {156926#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:36,073 INFO L272 TraceCheckUtils]: 35: Hoare triple {156926#(<= ~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)); {156926#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:36,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {156926#(<= ~counter~0 3)} ~cond := #in~cond; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:36,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {156926#(<= ~counter~0 3)} assume !(0 == ~cond); {156926#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:36,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {156926#(<= ~counter~0 3)} assume true; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:36,074 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156926#(<= ~counter~0 3)} {156926#(<= ~counter~0 3)} #98#return; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:36,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {156926#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {156926#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:36,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {156926#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:36,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {156951#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:36,076 INFO L272 TraceCheckUtils]: 43: Hoare triple {156951#(<= ~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)); {156951#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:36,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {156951#(<= ~counter~0 4)} ~cond := #in~cond; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:36,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {156951#(<= ~counter~0 4)} assume !(0 == ~cond); {156951#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:36,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {156951#(<= ~counter~0 4)} assume true; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:36,078 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156951#(<= ~counter~0 4)} {156951#(<= ~counter~0 4)} #98#return; {156951#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:36,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {156951#(<= ~counter~0 4)} assume !(~r~0 < 0); {156951#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:36,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {156951#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:36,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {156976#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:36,080 INFO L272 TraceCheckUtils]: 51: Hoare triple {156976#(<= ~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)); {156976#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:36,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {156976#(<= ~counter~0 5)} ~cond := #in~cond; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:36,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {156976#(<= ~counter~0 5)} assume !(0 == ~cond); {156976#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:36,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {156976#(<= ~counter~0 5)} assume true; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:36,081 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156976#(<= ~counter~0 5)} {156976#(<= ~counter~0 5)} #94#return; {156976#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:36,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {156976#(<= ~counter~0 5)} assume !!(0 != ~r~0); {156976#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:36,083 INFO L290 TraceCheckUtils]: 57: Hoare triple {156976#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:36,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {157001#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:36,084 INFO L272 TraceCheckUtils]: 59: Hoare triple {157001#(<= ~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)); {157001#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:36,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {157001#(<= ~counter~0 6)} ~cond := #in~cond; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:36,084 INFO L290 TraceCheckUtils]: 61: Hoare triple {157001#(<= ~counter~0 6)} assume !(0 == ~cond); {157001#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:36,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {157001#(<= ~counter~0 6)} assume true; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:36,085 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {157001#(<= ~counter~0 6)} {157001#(<= ~counter~0 6)} #96#return; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:36,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {157001#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157001#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:36,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {157001#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:36,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {157026#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:36,087 INFO L272 TraceCheckUtils]: 67: Hoare triple {157026#(<= ~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)); {157026#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:36,088 INFO L290 TraceCheckUtils]: 68: Hoare triple {157026#(<= ~counter~0 7)} ~cond := #in~cond; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:36,088 INFO L290 TraceCheckUtils]: 69: Hoare triple {157026#(<= ~counter~0 7)} assume !(0 == ~cond); {157026#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:36,088 INFO L290 TraceCheckUtils]: 70: Hoare triple {157026#(<= ~counter~0 7)} assume true; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:36,089 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {157026#(<= ~counter~0 7)} {157026#(<= ~counter~0 7)} #96#return; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:36,089 INFO L290 TraceCheckUtils]: 72: Hoare triple {157026#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157026#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:36,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {157026#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:36,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {157051#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:36,091 INFO L272 TraceCheckUtils]: 75: Hoare triple {157051#(<= ~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)); {157051#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:36,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {157051#(<= ~counter~0 8)} ~cond := #in~cond; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:36,092 INFO L290 TraceCheckUtils]: 77: Hoare triple {157051#(<= ~counter~0 8)} assume !(0 == ~cond); {157051#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:36,092 INFO L290 TraceCheckUtils]: 78: Hoare triple {157051#(<= ~counter~0 8)} assume true; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:36,092 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {157051#(<= ~counter~0 8)} {157051#(<= ~counter~0 8)} #96#return; {157051#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:36,093 INFO L290 TraceCheckUtils]: 80: Hoare triple {157051#(<= ~counter~0 8)} assume !(~r~0 > 0); {157051#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:36,094 INFO L290 TraceCheckUtils]: 81: Hoare triple {157051#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:36,094 INFO L290 TraceCheckUtils]: 82: Hoare triple {157076#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:36,095 INFO L272 TraceCheckUtils]: 83: Hoare triple {157076#(<= ~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)); {157076#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:36,095 INFO L290 TraceCheckUtils]: 84: Hoare triple {157076#(<= ~counter~0 9)} ~cond := #in~cond; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:36,095 INFO L290 TraceCheckUtils]: 85: Hoare triple {157076#(<= ~counter~0 9)} assume !(0 == ~cond); {157076#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:36,096 INFO L290 TraceCheckUtils]: 86: Hoare triple {157076#(<= ~counter~0 9)} assume true; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:36,096 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {157076#(<= ~counter~0 9)} {157076#(<= ~counter~0 9)} #98#return; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:36,096 INFO L290 TraceCheckUtils]: 88: Hoare triple {157076#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157076#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:36,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {157076#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:36,098 INFO L290 TraceCheckUtils]: 90: Hoare triple {157101#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:36,098 INFO L272 TraceCheckUtils]: 91: Hoare triple {157101#(<= ~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)); {157101#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:36,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {157101#(<= ~counter~0 10)} ~cond := #in~cond; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:36,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {157101#(<= ~counter~0 10)} assume !(0 == ~cond); {157101#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:36,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {157101#(<= ~counter~0 10)} assume true; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:36,100 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {157101#(<= ~counter~0 10)} {157101#(<= ~counter~0 10)} #98#return; {157101#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:36,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {157101#(<= ~counter~0 10)} assume !(~r~0 < 0); {157101#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:36,101 INFO L290 TraceCheckUtils]: 97: Hoare triple {157101#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:36,102 INFO L290 TraceCheckUtils]: 98: Hoare triple {157126#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:36,102 INFO L272 TraceCheckUtils]: 99: Hoare triple {157126#(<= ~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)); {157126#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:36,102 INFO L290 TraceCheckUtils]: 100: Hoare triple {157126#(<= ~counter~0 11)} ~cond := #in~cond; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:36,103 INFO L290 TraceCheckUtils]: 101: Hoare triple {157126#(<= ~counter~0 11)} assume !(0 == ~cond); {157126#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:36,103 INFO L290 TraceCheckUtils]: 102: Hoare triple {157126#(<= ~counter~0 11)} assume true; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:36,103 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {157126#(<= ~counter~0 11)} {157126#(<= ~counter~0 11)} #94#return; {157126#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:36,104 INFO L290 TraceCheckUtils]: 104: Hoare triple {157126#(<= ~counter~0 11)} assume !!(0 != ~r~0); {157126#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:36,105 INFO L290 TraceCheckUtils]: 105: Hoare triple {157126#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:36,105 INFO L290 TraceCheckUtils]: 106: Hoare triple {157151#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:36,106 INFO L272 TraceCheckUtils]: 107: Hoare triple {157151#(<= ~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)); {157151#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:36,106 INFO L290 TraceCheckUtils]: 108: Hoare triple {157151#(<= ~counter~0 12)} ~cond := #in~cond; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:36,106 INFO L290 TraceCheckUtils]: 109: Hoare triple {157151#(<= ~counter~0 12)} assume !(0 == ~cond); {157151#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:36,106 INFO L290 TraceCheckUtils]: 110: Hoare triple {157151#(<= ~counter~0 12)} assume true; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:36,107 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157151#(<= ~counter~0 12)} {157151#(<= ~counter~0 12)} #96#return; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:36,107 INFO L290 TraceCheckUtils]: 112: Hoare triple {157151#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157151#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:36,109 INFO L290 TraceCheckUtils]: 113: Hoare triple {157151#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:36,109 INFO L290 TraceCheckUtils]: 114: Hoare triple {157176#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:36,109 INFO L272 TraceCheckUtils]: 115: Hoare triple {157176#(<= ~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)); {157176#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:36,110 INFO L290 TraceCheckUtils]: 116: Hoare triple {157176#(<= ~counter~0 13)} ~cond := #in~cond; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:36,110 INFO L290 TraceCheckUtils]: 117: Hoare triple {157176#(<= ~counter~0 13)} assume !(0 == ~cond); {157176#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:36,110 INFO L290 TraceCheckUtils]: 118: Hoare triple {157176#(<= ~counter~0 13)} assume true; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:36,111 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157176#(<= ~counter~0 13)} {157176#(<= ~counter~0 13)} #96#return; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:36,111 INFO L290 TraceCheckUtils]: 120: Hoare triple {157176#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157176#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:36,112 INFO L290 TraceCheckUtils]: 121: Hoare triple {157176#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:36,112 INFO L290 TraceCheckUtils]: 122: Hoare triple {157201#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:36,113 INFO L272 TraceCheckUtils]: 123: Hoare triple {157201#(<= ~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)); {157201#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:36,113 INFO L290 TraceCheckUtils]: 124: Hoare triple {157201#(<= ~counter~0 14)} ~cond := #in~cond; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:36,113 INFO L290 TraceCheckUtils]: 125: Hoare triple {157201#(<= ~counter~0 14)} assume !(0 == ~cond); {157201#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:36,114 INFO L290 TraceCheckUtils]: 126: Hoare triple {157201#(<= ~counter~0 14)} assume true; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:36,114 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157201#(<= ~counter~0 14)} {157201#(<= ~counter~0 14)} #96#return; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:36,115 INFO L290 TraceCheckUtils]: 128: Hoare triple {157201#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157201#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:36,116 INFO L290 TraceCheckUtils]: 129: Hoare triple {157201#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:36,116 INFO L290 TraceCheckUtils]: 130: Hoare triple {157226#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:36,117 INFO L272 TraceCheckUtils]: 131: Hoare triple {157226#(<= ~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)); {157226#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:36,117 INFO L290 TraceCheckUtils]: 132: Hoare triple {157226#(<= ~counter~0 15)} ~cond := #in~cond; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:36,117 INFO L290 TraceCheckUtils]: 133: Hoare triple {157226#(<= ~counter~0 15)} assume !(0 == ~cond); {157226#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:36,117 INFO L290 TraceCheckUtils]: 134: Hoare triple {157226#(<= ~counter~0 15)} assume true; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:36,118 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157226#(<= ~counter~0 15)} {157226#(<= ~counter~0 15)} #96#return; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:36,118 INFO L290 TraceCheckUtils]: 136: Hoare triple {157226#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157226#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:36,120 INFO L290 TraceCheckUtils]: 137: Hoare triple {157226#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:36,120 INFO L290 TraceCheckUtils]: 138: Hoare triple {157251#(<= ~counter~0 16)} assume !!(#t~post7 < 50);havoc #t~post7; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:36,120 INFO L272 TraceCheckUtils]: 139: Hoare triple {157251#(<= ~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)); {157251#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:36,121 INFO L290 TraceCheckUtils]: 140: Hoare triple {157251#(<= ~counter~0 16)} ~cond := #in~cond; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:36,121 INFO L290 TraceCheckUtils]: 141: Hoare triple {157251#(<= ~counter~0 16)} assume !(0 == ~cond); {157251#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:36,121 INFO L290 TraceCheckUtils]: 142: Hoare triple {157251#(<= ~counter~0 16)} assume true; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:36,122 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157251#(<= ~counter~0 16)} {157251#(<= ~counter~0 16)} #96#return; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:36,122 INFO L290 TraceCheckUtils]: 144: Hoare triple {157251#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157251#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:36,122 INFO L290 TraceCheckUtils]: 145: Hoare triple {157251#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157276#(<= |main_#t~post7| 16)} is VALID [2022-04-08 06:12:36,123 INFO L290 TraceCheckUtils]: 146: Hoare triple {157276#(<= |main_#t~post7| 16)} assume !(#t~post7 < 50);havoc #t~post7; {156820#false} is VALID [2022-04-08 06:12:36,123 INFO L290 TraceCheckUtils]: 147: Hoare triple {156820#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156820#false} is VALID [2022-04-08 06:12:36,123 INFO L290 TraceCheckUtils]: 148: Hoare triple {156820#false} assume !(#t~post8 < 50);havoc #t~post8; {156820#false} is VALID [2022-04-08 06:12:36,123 INFO L290 TraceCheckUtils]: 149: Hoare triple {156820#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156820#false} is VALID [2022-04-08 06:12:36,123 INFO L290 TraceCheckUtils]: 150: Hoare triple {156820#false} assume !(#t~post6 < 50);havoc #t~post6; {156820#false} is VALID [2022-04-08 06:12:36,123 INFO L272 TraceCheckUtils]: 151: Hoare triple {156820#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)); {156820#false} is VALID [2022-04-08 06:12:36,123 INFO L290 TraceCheckUtils]: 152: Hoare triple {156820#false} ~cond := #in~cond; {156820#false} is VALID [2022-04-08 06:12:36,123 INFO L290 TraceCheckUtils]: 153: Hoare triple {156820#false} assume 0 == ~cond; {156820#false} is VALID [2022-04-08 06:12:36,123 INFO L290 TraceCheckUtils]: 154: Hoare triple {156820#false} assume !false; {156820#false} is VALID [2022-04-08 06:12:36,124 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-08 06:12:36,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:12:37,169 INFO L290 TraceCheckUtils]: 154: Hoare triple {156820#false} assume !false; {156820#false} is VALID [2022-04-08 06:12:37,169 INFO L290 TraceCheckUtils]: 153: Hoare triple {156820#false} assume 0 == ~cond; {156820#false} is VALID [2022-04-08 06:12:37,169 INFO L290 TraceCheckUtils]: 152: Hoare triple {156820#false} ~cond := #in~cond; {156820#false} is VALID [2022-04-08 06:12:37,169 INFO L272 TraceCheckUtils]: 151: Hoare triple {156820#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)); {156820#false} is VALID [2022-04-08 06:12:37,169 INFO L290 TraceCheckUtils]: 150: Hoare triple {156820#false} assume !(#t~post6 < 50);havoc #t~post6; {156820#false} is VALID [2022-04-08 06:12:37,169 INFO L290 TraceCheckUtils]: 149: Hoare triple {156820#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156820#false} is VALID [2022-04-08 06:12:37,170 INFO L290 TraceCheckUtils]: 148: Hoare triple {156820#false} assume !(#t~post8 < 50);havoc #t~post8; {156820#false} is VALID [2022-04-08 06:12:37,170 INFO L290 TraceCheckUtils]: 147: Hoare triple {156820#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156820#false} is VALID [2022-04-08 06:12:37,170 INFO L290 TraceCheckUtils]: 146: Hoare triple {157328#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {156820#false} is VALID [2022-04-08 06:12:37,170 INFO L290 TraceCheckUtils]: 145: Hoare triple {157332#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157328#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:12:37,171 INFO L290 TraceCheckUtils]: 144: Hoare triple {157332#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157332#(< ~counter~0 50)} is VALID [2022-04-08 06:12:37,171 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {156819#true} {157332#(< ~counter~0 50)} #96#return; {157332#(< ~counter~0 50)} is VALID [2022-04-08 06:12:37,171 INFO L290 TraceCheckUtils]: 142: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,171 INFO L290 TraceCheckUtils]: 141: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,171 INFO L290 TraceCheckUtils]: 140: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,171 INFO L272 TraceCheckUtils]: 139: Hoare triple {157332#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,172 INFO L290 TraceCheckUtils]: 138: Hoare triple {157332#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {157332#(< ~counter~0 50)} is VALID [2022-04-08 06:12:37,175 INFO L290 TraceCheckUtils]: 137: Hoare triple {157357#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157332#(< ~counter~0 50)} is VALID [2022-04-08 06:12:37,175 INFO L290 TraceCheckUtils]: 136: Hoare triple {157357#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157357#(< ~counter~0 49)} is VALID [2022-04-08 06:12:37,176 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {156819#true} {157357#(< ~counter~0 49)} #96#return; {157357#(< ~counter~0 49)} is VALID [2022-04-08 06:12:37,176 INFO L290 TraceCheckUtils]: 134: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,176 INFO L290 TraceCheckUtils]: 133: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,176 INFO L290 TraceCheckUtils]: 132: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,176 INFO L272 TraceCheckUtils]: 131: Hoare triple {157357#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,176 INFO L290 TraceCheckUtils]: 130: Hoare triple {157357#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {157357#(< ~counter~0 49)} is VALID [2022-04-08 06:12:37,178 INFO L290 TraceCheckUtils]: 129: Hoare triple {157382#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157357#(< ~counter~0 49)} is VALID [2022-04-08 06:12:37,178 INFO L290 TraceCheckUtils]: 128: Hoare triple {157382#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157382#(< ~counter~0 48)} is VALID [2022-04-08 06:12:37,178 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {156819#true} {157382#(< ~counter~0 48)} #96#return; {157382#(< ~counter~0 48)} is VALID [2022-04-08 06:12:37,179 INFO L290 TraceCheckUtils]: 126: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,179 INFO L290 TraceCheckUtils]: 125: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,179 INFO L290 TraceCheckUtils]: 124: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,179 INFO L272 TraceCheckUtils]: 123: Hoare triple {157382#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,179 INFO L290 TraceCheckUtils]: 122: Hoare triple {157382#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {157382#(< ~counter~0 48)} is VALID [2022-04-08 06:12:37,180 INFO L290 TraceCheckUtils]: 121: Hoare triple {157407#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157382#(< ~counter~0 48)} is VALID [2022-04-08 06:12:37,181 INFO L290 TraceCheckUtils]: 120: Hoare triple {157407#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157407#(< ~counter~0 47)} is VALID [2022-04-08 06:12:37,181 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {156819#true} {157407#(< ~counter~0 47)} #96#return; {157407#(< ~counter~0 47)} is VALID [2022-04-08 06:12:37,181 INFO L290 TraceCheckUtils]: 118: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,181 INFO L290 TraceCheckUtils]: 117: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,181 INFO L290 TraceCheckUtils]: 116: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,181 INFO L272 TraceCheckUtils]: 115: Hoare triple {157407#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,182 INFO L290 TraceCheckUtils]: 114: Hoare triple {157407#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {157407#(< ~counter~0 47)} is VALID [2022-04-08 06:12:37,183 INFO L290 TraceCheckUtils]: 113: Hoare triple {157432#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157407#(< ~counter~0 47)} is VALID [2022-04-08 06:12:37,183 INFO L290 TraceCheckUtils]: 112: Hoare triple {157432#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157432#(< ~counter~0 46)} is VALID [2022-04-08 06:12:37,184 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {156819#true} {157432#(< ~counter~0 46)} #96#return; {157432#(< ~counter~0 46)} is VALID [2022-04-08 06:12:37,184 INFO L290 TraceCheckUtils]: 110: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,184 INFO L290 TraceCheckUtils]: 109: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,184 INFO L290 TraceCheckUtils]: 108: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,184 INFO L272 TraceCheckUtils]: 107: Hoare triple {157432#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,184 INFO L290 TraceCheckUtils]: 106: Hoare triple {157432#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {157432#(< ~counter~0 46)} is VALID [2022-04-08 06:12:37,186 INFO L290 TraceCheckUtils]: 105: Hoare triple {157457#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157432#(< ~counter~0 46)} is VALID [2022-04-08 06:12:37,186 INFO L290 TraceCheckUtils]: 104: Hoare triple {157457#(< ~counter~0 45)} assume !!(0 != ~r~0); {157457#(< ~counter~0 45)} is VALID [2022-04-08 06:12:37,186 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {156819#true} {157457#(< ~counter~0 45)} #94#return; {157457#(< ~counter~0 45)} is VALID [2022-04-08 06:12:37,187 INFO L290 TraceCheckUtils]: 102: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,187 INFO L290 TraceCheckUtils]: 101: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,187 INFO L290 TraceCheckUtils]: 100: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,187 INFO L272 TraceCheckUtils]: 99: Hoare triple {157457#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,187 INFO L290 TraceCheckUtils]: 98: Hoare triple {157457#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {157457#(< ~counter~0 45)} is VALID [2022-04-08 06:12:37,188 INFO L290 TraceCheckUtils]: 97: Hoare triple {157482#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157457#(< ~counter~0 45)} is VALID [2022-04-08 06:12:37,189 INFO L290 TraceCheckUtils]: 96: Hoare triple {157482#(< ~counter~0 44)} assume !(~r~0 < 0); {157482#(< ~counter~0 44)} is VALID [2022-04-08 06:12:37,189 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {156819#true} {157482#(< ~counter~0 44)} #98#return; {157482#(< ~counter~0 44)} is VALID [2022-04-08 06:12:37,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,189 INFO L272 TraceCheckUtils]: 91: Hoare triple {157482#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,190 INFO L290 TraceCheckUtils]: 90: Hoare triple {157482#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {157482#(< ~counter~0 44)} is VALID [2022-04-08 06:12:37,191 INFO L290 TraceCheckUtils]: 89: Hoare triple {157507#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157482#(< ~counter~0 44)} is VALID [2022-04-08 06:12:37,191 INFO L290 TraceCheckUtils]: 88: Hoare triple {157507#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157507#(< ~counter~0 43)} is VALID [2022-04-08 06:12:37,192 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {156819#true} {157507#(< ~counter~0 43)} #98#return; {157507#(< ~counter~0 43)} is VALID [2022-04-08 06:12:37,192 INFO L290 TraceCheckUtils]: 86: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,192 INFO L290 TraceCheckUtils]: 84: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,192 INFO L272 TraceCheckUtils]: 83: Hoare triple {157507#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,192 INFO L290 TraceCheckUtils]: 82: Hoare triple {157507#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {157507#(< ~counter~0 43)} is VALID [2022-04-08 06:12:37,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {157532#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157507#(< ~counter~0 43)} is VALID [2022-04-08 06:12:37,194 INFO L290 TraceCheckUtils]: 80: Hoare triple {157532#(< ~counter~0 42)} assume !(~r~0 > 0); {157532#(< ~counter~0 42)} is VALID [2022-04-08 06:12:37,195 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {156819#true} {157532#(< ~counter~0 42)} #96#return; {157532#(< ~counter~0 42)} is VALID [2022-04-08 06:12:37,195 INFO L290 TraceCheckUtils]: 78: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,195 INFO L290 TraceCheckUtils]: 77: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,195 INFO L272 TraceCheckUtils]: 75: Hoare triple {157532#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,195 INFO L290 TraceCheckUtils]: 74: Hoare triple {157532#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {157532#(< ~counter~0 42)} is VALID [2022-04-08 06:12:37,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {157557#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157532#(< ~counter~0 42)} is VALID [2022-04-08 06:12:37,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {157557#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157557#(< ~counter~0 41)} is VALID [2022-04-08 06:12:37,198 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {156819#true} {157557#(< ~counter~0 41)} #96#return; {157557#(< ~counter~0 41)} is VALID [2022-04-08 06:12:37,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,198 INFO L290 TraceCheckUtils]: 69: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,198 INFO L272 TraceCheckUtils]: 67: Hoare triple {157557#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {157557#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {157557#(< ~counter~0 41)} is VALID [2022-04-08 06:12:37,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {157582#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157557#(< ~counter~0 41)} is VALID [2022-04-08 06:12:37,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {157582#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157582#(< ~counter~0 40)} is VALID [2022-04-08 06:12:37,200 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {156819#true} {157582#(< ~counter~0 40)} #96#return; {157582#(< ~counter~0 40)} is VALID [2022-04-08 06:12:37,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,201 INFO L272 TraceCheckUtils]: 59: Hoare triple {157582#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {157582#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {157582#(< ~counter~0 40)} is VALID [2022-04-08 06:12:37,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {157607#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157582#(< ~counter~0 40)} is VALID [2022-04-08 06:12:37,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {157607#(< ~counter~0 39)} assume !!(0 != ~r~0); {157607#(< ~counter~0 39)} is VALID [2022-04-08 06:12:37,204 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156819#true} {157607#(< ~counter~0 39)} #94#return; {157607#(< ~counter~0 39)} is VALID [2022-04-08 06:12:37,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,204 INFO L272 TraceCheckUtils]: 51: Hoare triple {157607#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {157607#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {157607#(< ~counter~0 39)} is VALID [2022-04-08 06:12:37,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {157632#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157607#(< ~counter~0 39)} is VALID [2022-04-08 06:12:37,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {157632#(< ~counter~0 38)} assume !(~r~0 < 0); {157632#(< ~counter~0 38)} is VALID [2022-04-08 06:12:37,206 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156819#true} {157632#(< ~counter~0 38)} #98#return; {157632#(< ~counter~0 38)} is VALID [2022-04-08 06:12:37,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,207 INFO L272 TraceCheckUtils]: 43: Hoare triple {157632#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {157632#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {157632#(< ~counter~0 38)} is VALID [2022-04-08 06:12:37,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {157657#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157632#(< ~counter~0 38)} is VALID [2022-04-08 06:12:37,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {157657#(< ~counter~0 37)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157657#(< ~counter~0 37)} is VALID [2022-04-08 06:12:37,209 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156819#true} {157657#(< ~counter~0 37)} #98#return; {157657#(< ~counter~0 37)} is VALID [2022-04-08 06:12:37,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,209 INFO L272 TraceCheckUtils]: 35: Hoare triple {157657#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {157657#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {157657#(< ~counter~0 37)} is VALID [2022-04-08 06:12:37,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {157682#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157657#(< ~counter~0 37)} is VALID [2022-04-08 06:12:37,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {157682#(< ~counter~0 36)} assume !(~r~0 > 0); {157682#(< ~counter~0 36)} is VALID [2022-04-08 06:12:37,212 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156819#true} {157682#(< ~counter~0 36)} #96#return; {157682#(< ~counter~0 36)} is VALID [2022-04-08 06:12:37,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,212 INFO L272 TraceCheckUtils]: 27: Hoare triple {157682#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {157682#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {157682#(< ~counter~0 36)} is VALID [2022-04-08 06:12:37,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {157707#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157682#(< ~counter~0 36)} is VALID [2022-04-08 06:12:37,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {157707#(< ~counter~0 35)} assume !!(0 != ~r~0); {157707#(< ~counter~0 35)} is VALID [2022-04-08 06:12:37,215 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156819#true} {157707#(< ~counter~0 35)} #94#return; {157707#(< ~counter~0 35)} is VALID [2022-04-08 06:12:37,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,215 INFO L272 TraceCheckUtils]: 19: Hoare triple {157707#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {157707#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {157707#(< ~counter~0 35)} is VALID [2022-04-08 06:12:37,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {157732#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157707#(< ~counter~0 35)} is VALID [2022-04-08 06:12:37,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {157732#(< ~counter~0 34)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {157732#(< ~counter~0 34)} is VALID [2022-04-08 06:12:37,217 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156819#true} {157732#(< ~counter~0 34)} #92#return; {157732#(< ~counter~0 34)} is VALID [2022-04-08 06:12:37,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,218 INFO L272 TraceCheckUtils]: 11: Hoare triple {157732#(< ~counter~0 34)} 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)); {156819#true} is VALID [2022-04-08 06:12:37,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156819#true} {157732#(< ~counter~0 34)} #90#return; {157732#(< ~counter~0 34)} is VALID [2022-04-08 06:12:37,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-08 06:12:37,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-08 06:12:37,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-08 06:12:37,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {157732#(< ~counter~0 34)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {156819#true} is VALID [2022-04-08 06:12:37,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {157732#(< ~counter~0 34)} 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; {157732#(< ~counter~0 34)} is VALID [2022-04-08 06:12:37,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {157732#(< ~counter~0 34)} call #t~ret9 := main(); {157732#(< ~counter~0 34)} is VALID [2022-04-08 06:12:37,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157732#(< ~counter~0 34)} {156819#true} #102#return; {157732#(< ~counter~0 34)} is VALID [2022-04-08 06:12:37,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {157732#(< ~counter~0 34)} assume true; {157732#(< ~counter~0 34)} is VALID [2022-04-08 06:12:37,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {156819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {157732#(< ~counter~0 34)} is VALID [2022-04-08 06:12:37,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {156819#true} call ULTIMATE.init(); {156819#true} is VALID [2022-04-08 06:12:37,221 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-08 06:12:37,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:12:37,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597681396] [2022-04-08 06:12:37,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:12:37,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47105412] [2022-04-08 06:12:37,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47105412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:12:37,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:12:37,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 06:12:37,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:12:37,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [572082595] [2022-04-08 06:12:37,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [572082595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:12:37,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:12:37,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 06:12:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979777025] [2022-04-08 06:12:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:12:37,222 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-08 06:12:37,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:12:37,222 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-08 06:12:37,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:37,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 06:12:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 06:12:37,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 06:12:37,440 INFO L87 Difference]: Start difference. First operand 834 states and 1114 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-08 06:12:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:43,702 INFO L93 Difference]: Finished difference Result 1021 states and 1392 transitions. [2022-04-08 06:12:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 06:12:43,702 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-08 06:12:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:12:43,702 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-08 06:12:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-08 06:12:43,705 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-08 06:12:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-08 06:12:43,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 356 transitions. [2022-04-08 06:12:44,449 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-08 06:12:44,478 INFO L225 Difference]: With dead ends: 1021 [2022-04-08 06:12:44,478 INFO L226 Difference]: Without dead ends: 851 [2022-04-08 06:12:44,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1175, Invalid=1581, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 06:12:44,480 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:12:44,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 357 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 06:12:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-08 06:12:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-04-08 06:12:48,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:12:48,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:12:48,041 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:12:48,042 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:12:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:48,065 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-08 06:12:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 06:12:48,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:48,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:48,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-08 06:12:48,068 INFO L87 Difference]: Start difference. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-08 06:12:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:48,090 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-08 06:12:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 06:12:48,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:48,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:48,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:12:48,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:12:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:12:48,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1131 transitions. [2022-04-08 06:12:48,131 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1131 transitions. Word has length 155 [2022-04-08 06:12:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:12:48,131 INFO L478 AbstractCegarLoop]: Abstraction has 851 states and 1131 transitions. [2022-04-08 06:12:48,131 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-08 06:12:48,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 851 states and 1131 transitions. [2022-04-08 06:13:01,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1131 edges. 1129 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 06:13:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 06:13:01,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:01,776 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-08 06:13:01,783 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-08 06:13:01,977 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-08 06:13:01,977 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:01,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 17 times [2022-04-08 06:13:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:01,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [959987076] [2022-04-08 06:13:01,978 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 18 times [2022-04-08 06:13:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:01,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771261256] [2022-04-08 06:13:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:01,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:13:01,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942677137] [2022-04-08 06:13:01,992 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:13:01,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:01,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:01,994 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-08 06:13:01,995 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-08 06:13:02,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:13:02,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:13:02,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 06:13:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:13:03,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:13:03,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {163262#true} call ULTIMATE.init(); {163262#true} is VALID [2022-04-08 06:13:03,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {163262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163270#(<= ~counter~0 0)} {163262#true} #102#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {163270#(<= ~counter~0 0)} call #t~ret9 := main(); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {163270#(<= ~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; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {163270#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {163270#(<= ~counter~0 0)} ~cond := #in~cond; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {163270#(<= ~counter~0 0)} assume !(0 == ~cond); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163270#(<= ~counter~0 0)} {163270#(<= ~counter~0 0)} #90#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,975 INFO L272 TraceCheckUtils]: 11: Hoare triple {163270#(<= ~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)); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {163270#(<= ~counter~0 0)} ~cond := #in~cond; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {163270#(<= ~counter~0 0)} assume !(0 == ~cond); {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,976 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163270#(<= ~counter~0 0)} {163270#(<= ~counter~0 0)} #92#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {163270#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {163270#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:03,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {163270#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:03,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {163319#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:03,982 INFO L272 TraceCheckUtils]: 19: Hoare triple {163319#(<= ~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)); {163319#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:03,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {163319#(<= ~counter~0 1)} ~cond := #in~cond; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:03,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {163319#(<= ~counter~0 1)} assume !(0 == ~cond); {163319#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:03,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {163319#(<= ~counter~0 1)} assume true; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:03,983 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163319#(<= ~counter~0 1)} {163319#(<= ~counter~0 1)} #94#return; {163319#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:03,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {163319#(<= ~counter~0 1)} assume !!(0 != ~r~0); {163319#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:03,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {163319#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:03,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {163344#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:03,988 INFO L272 TraceCheckUtils]: 27: Hoare triple {163344#(<= ~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)); {163344#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:03,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {163344#(<= ~counter~0 2)} ~cond := #in~cond; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:03,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {163344#(<= ~counter~0 2)} assume !(0 == ~cond); {163344#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:03,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {163344#(<= ~counter~0 2)} assume true; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:03,989 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163344#(<= ~counter~0 2)} {163344#(<= ~counter~0 2)} #96#return; {163344#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:03,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {163344#(<= ~counter~0 2)} assume !(~r~0 > 0); {163344#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:03,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {163344#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:03,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {163369#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:03,994 INFO L272 TraceCheckUtils]: 35: Hoare triple {163369#(<= ~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)); {163369#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:03,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {163369#(<= ~counter~0 3)} ~cond := #in~cond; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:03,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {163369#(<= ~counter~0 3)} assume !(0 == ~cond); {163369#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:03,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {163369#(<= ~counter~0 3)} assume true; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:03,995 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163369#(<= ~counter~0 3)} {163369#(<= ~counter~0 3)} #98#return; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:03,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {163369#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163369#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:03,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {163369#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:04,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {163394#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:04,000 INFO L272 TraceCheckUtils]: 43: Hoare triple {163394#(<= ~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)); {163394#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:04,001 INFO L290 TraceCheckUtils]: 44: Hoare triple {163394#(<= ~counter~0 4)} ~cond := #in~cond; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:04,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {163394#(<= ~counter~0 4)} assume !(0 == ~cond); {163394#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:04,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {163394#(<= ~counter~0 4)} assume true; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:04,002 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163394#(<= ~counter~0 4)} {163394#(<= ~counter~0 4)} #98#return; {163394#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:04,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {163394#(<= ~counter~0 4)} assume !(~r~0 < 0); {163394#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:04,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {163394#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:04,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {163419#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:04,005 INFO L272 TraceCheckUtils]: 51: Hoare triple {163419#(<= ~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)); {163419#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:04,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {163419#(<= ~counter~0 5)} ~cond := #in~cond; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:04,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {163419#(<= ~counter~0 5)} assume !(0 == ~cond); {163419#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:04,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {163419#(<= ~counter~0 5)} assume true; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:04,006 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163419#(<= ~counter~0 5)} {163419#(<= ~counter~0 5)} #94#return; {163419#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:04,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {163419#(<= ~counter~0 5)} assume !!(0 != ~r~0); {163419#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:04,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {163419#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:04,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {163444#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:04,011 INFO L272 TraceCheckUtils]: 59: Hoare triple {163444#(<= ~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)); {163444#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:04,011 INFO L290 TraceCheckUtils]: 60: Hoare triple {163444#(<= ~counter~0 6)} ~cond := #in~cond; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:04,012 INFO L290 TraceCheckUtils]: 61: Hoare triple {163444#(<= ~counter~0 6)} assume !(0 == ~cond); {163444#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:04,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {163444#(<= ~counter~0 6)} assume true; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:04,012 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163444#(<= ~counter~0 6)} {163444#(<= ~counter~0 6)} #96#return; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:04,013 INFO L290 TraceCheckUtils]: 64: Hoare triple {163444#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163444#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:04,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {163444#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:04,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {163469#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:04,017 INFO L272 TraceCheckUtils]: 67: Hoare triple {163469#(<= ~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)); {163469#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:04,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {163469#(<= ~counter~0 7)} ~cond := #in~cond; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:04,018 INFO L290 TraceCheckUtils]: 69: Hoare triple {163469#(<= ~counter~0 7)} assume !(0 == ~cond); {163469#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:04,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {163469#(<= ~counter~0 7)} assume true; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:04,018 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163469#(<= ~counter~0 7)} {163469#(<= ~counter~0 7)} #96#return; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:04,019 INFO L290 TraceCheckUtils]: 72: Hoare triple {163469#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163469#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:04,022 INFO L290 TraceCheckUtils]: 73: Hoare triple {163469#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:04,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {163494#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:04,023 INFO L272 TraceCheckUtils]: 75: Hoare triple {163494#(<= ~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)); {163494#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:04,023 INFO L290 TraceCheckUtils]: 76: Hoare triple {163494#(<= ~counter~0 8)} ~cond := #in~cond; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:04,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {163494#(<= ~counter~0 8)} assume !(0 == ~cond); {163494#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:04,023 INFO L290 TraceCheckUtils]: 78: Hoare triple {163494#(<= ~counter~0 8)} assume true; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:04,024 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163494#(<= ~counter~0 8)} {163494#(<= ~counter~0 8)} #96#return; {163494#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:04,024 INFO L290 TraceCheckUtils]: 80: Hoare triple {163494#(<= ~counter~0 8)} assume !(~r~0 > 0); {163494#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:04,026 INFO L290 TraceCheckUtils]: 81: Hoare triple {163494#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:04,027 INFO L290 TraceCheckUtils]: 82: Hoare triple {163519#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:04,027 INFO L272 TraceCheckUtils]: 83: Hoare triple {163519#(<= ~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)); {163519#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:04,027 INFO L290 TraceCheckUtils]: 84: Hoare triple {163519#(<= ~counter~0 9)} ~cond := #in~cond; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:04,028 INFO L290 TraceCheckUtils]: 85: Hoare triple {163519#(<= ~counter~0 9)} assume !(0 == ~cond); {163519#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:04,028 INFO L290 TraceCheckUtils]: 86: Hoare triple {163519#(<= ~counter~0 9)} assume true; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:04,028 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163519#(<= ~counter~0 9)} {163519#(<= ~counter~0 9)} #98#return; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:04,029 INFO L290 TraceCheckUtils]: 88: Hoare triple {163519#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163519#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:04,031 INFO L290 TraceCheckUtils]: 89: Hoare triple {163519#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:04,031 INFO L290 TraceCheckUtils]: 90: Hoare triple {163544#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:04,032 INFO L272 TraceCheckUtils]: 91: Hoare triple {163544#(<= ~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)); {163544#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:04,032 INFO L290 TraceCheckUtils]: 92: Hoare triple {163544#(<= ~counter~0 10)} ~cond := #in~cond; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:04,032 INFO L290 TraceCheckUtils]: 93: Hoare triple {163544#(<= ~counter~0 10)} assume !(0 == ~cond); {163544#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:04,032 INFO L290 TraceCheckUtils]: 94: Hoare triple {163544#(<= ~counter~0 10)} assume true; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:04,033 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163544#(<= ~counter~0 10)} {163544#(<= ~counter~0 10)} #98#return; {163544#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:04,033 INFO L290 TraceCheckUtils]: 96: Hoare triple {163544#(<= ~counter~0 10)} assume !(~r~0 < 0); {163544#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:04,036 INFO L290 TraceCheckUtils]: 97: Hoare triple {163544#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:04,036 INFO L290 TraceCheckUtils]: 98: Hoare triple {163569#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:04,037 INFO L272 TraceCheckUtils]: 99: Hoare triple {163569#(<= ~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)); {163569#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:04,037 INFO L290 TraceCheckUtils]: 100: Hoare triple {163569#(<= ~counter~0 11)} ~cond := #in~cond; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:04,037 INFO L290 TraceCheckUtils]: 101: Hoare triple {163569#(<= ~counter~0 11)} assume !(0 == ~cond); {163569#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:04,038 INFO L290 TraceCheckUtils]: 102: Hoare triple {163569#(<= ~counter~0 11)} assume true; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:04,038 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163569#(<= ~counter~0 11)} {163569#(<= ~counter~0 11)} #94#return; {163569#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:04,038 INFO L290 TraceCheckUtils]: 104: Hoare triple {163569#(<= ~counter~0 11)} assume !!(0 != ~r~0); {163569#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:04,040 INFO L290 TraceCheckUtils]: 105: Hoare triple {163569#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:04,041 INFO L290 TraceCheckUtils]: 106: Hoare triple {163594#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:04,041 INFO L272 TraceCheckUtils]: 107: Hoare triple {163594#(<= ~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)); {163594#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:04,041 INFO L290 TraceCheckUtils]: 108: Hoare triple {163594#(<= ~counter~0 12)} ~cond := #in~cond; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:04,042 INFO L290 TraceCheckUtils]: 109: Hoare triple {163594#(<= ~counter~0 12)} assume !(0 == ~cond); {163594#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:04,042 INFO L290 TraceCheckUtils]: 110: Hoare triple {163594#(<= ~counter~0 12)} assume true; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:04,042 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163594#(<= ~counter~0 12)} {163594#(<= ~counter~0 12)} #96#return; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:04,043 INFO L290 TraceCheckUtils]: 112: Hoare triple {163594#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163594#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:04,045 INFO L290 TraceCheckUtils]: 113: Hoare triple {163594#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:04,045 INFO L290 TraceCheckUtils]: 114: Hoare triple {163619#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:04,046 INFO L272 TraceCheckUtils]: 115: Hoare triple {163619#(<= ~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)); {163619#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:04,046 INFO L290 TraceCheckUtils]: 116: Hoare triple {163619#(<= ~counter~0 13)} ~cond := #in~cond; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:04,046 INFO L290 TraceCheckUtils]: 117: Hoare triple {163619#(<= ~counter~0 13)} assume !(0 == ~cond); {163619#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:04,047 INFO L290 TraceCheckUtils]: 118: Hoare triple {163619#(<= ~counter~0 13)} assume true; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:04,047 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163619#(<= ~counter~0 13)} {163619#(<= ~counter~0 13)} #96#return; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:04,047 INFO L290 TraceCheckUtils]: 120: Hoare triple {163619#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163619#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:04,049 INFO L290 TraceCheckUtils]: 121: Hoare triple {163619#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:04,049 INFO L290 TraceCheckUtils]: 122: Hoare triple {163644#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:04,050 INFO L272 TraceCheckUtils]: 123: Hoare triple {163644#(<= ~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)); {163644#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:04,050 INFO L290 TraceCheckUtils]: 124: Hoare triple {163644#(<= ~counter~0 14)} ~cond := #in~cond; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:04,050 INFO L290 TraceCheckUtils]: 125: Hoare triple {163644#(<= ~counter~0 14)} assume !(0 == ~cond); {163644#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:04,050 INFO L290 TraceCheckUtils]: 126: Hoare triple {163644#(<= ~counter~0 14)} assume true; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:04,051 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163644#(<= ~counter~0 14)} {163644#(<= ~counter~0 14)} #96#return; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:04,051 INFO L290 TraceCheckUtils]: 128: Hoare triple {163644#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163644#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:04,053 INFO L290 TraceCheckUtils]: 129: Hoare triple {163644#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:04,053 INFO L290 TraceCheckUtils]: 130: Hoare triple {163669#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:04,053 INFO L272 TraceCheckUtils]: 131: Hoare triple {163669#(<= ~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)); {163669#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:04,054 INFO L290 TraceCheckUtils]: 132: Hoare triple {163669#(<= ~counter~0 15)} ~cond := #in~cond; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:04,054 INFO L290 TraceCheckUtils]: 133: Hoare triple {163669#(<= ~counter~0 15)} assume !(0 == ~cond); {163669#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:04,054 INFO L290 TraceCheckUtils]: 134: Hoare triple {163669#(<= ~counter~0 15)} assume true; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:04,055 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163669#(<= ~counter~0 15)} {163669#(<= ~counter~0 15)} #96#return; {163669#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:04,055 INFO L290 TraceCheckUtils]: 136: Hoare triple {163669#(<= ~counter~0 15)} assume !(~r~0 > 0); {163669#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:04,056 INFO L290 TraceCheckUtils]: 137: Hoare triple {163669#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:04,057 INFO L290 TraceCheckUtils]: 138: Hoare triple {163694#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:04,057 INFO L272 TraceCheckUtils]: 139: Hoare triple {163694#(<= ~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)); {163694#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:04,057 INFO L290 TraceCheckUtils]: 140: Hoare triple {163694#(<= ~counter~0 16)} ~cond := #in~cond; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:04,058 INFO L290 TraceCheckUtils]: 141: Hoare triple {163694#(<= ~counter~0 16)} assume !(0 == ~cond); {163694#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:04,058 INFO L290 TraceCheckUtils]: 142: Hoare triple {163694#(<= ~counter~0 16)} assume true; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:04,058 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163694#(<= ~counter~0 16)} {163694#(<= ~counter~0 16)} #98#return; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:04,059 INFO L290 TraceCheckUtils]: 144: Hoare triple {163694#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163694#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:04,060 INFO L290 TraceCheckUtils]: 145: Hoare triple {163694#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:04,060 INFO L290 TraceCheckUtils]: 146: Hoare triple {163719#(<= ~counter~0 17)} assume !!(#t~post8 < 50);havoc #t~post8; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:04,061 INFO L272 TraceCheckUtils]: 147: Hoare triple {163719#(<= ~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)); {163719#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:04,061 INFO L290 TraceCheckUtils]: 148: Hoare triple {163719#(<= ~counter~0 17)} ~cond := #in~cond; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:04,061 INFO L290 TraceCheckUtils]: 149: Hoare triple {163719#(<= ~counter~0 17)} assume !(0 == ~cond); {163719#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:04,062 INFO L290 TraceCheckUtils]: 150: Hoare triple {163719#(<= ~counter~0 17)} assume true; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:04,062 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163719#(<= ~counter~0 17)} {163719#(<= ~counter~0 17)} #98#return; {163719#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:04,062 INFO L290 TraceCheckUtils]: 152: Hoare triple {163719#(<= ~counter~0 17)} assume !(~r~0 < 0); {163719#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:04,063 INFO L290 TraceCheckUtils]: 153: Hoare triple {163719#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163744#(<= |main_#t~post6| 17)} is VALID [2022-04-08 06:13:04,063 INFO L290 TraceCheckUtils]: 154: Hoare triple {163744#(<= |main_#t~post6| 17)} assume !(#t~post6 < 50);havoc #t~post6; {163263#false} is VALID [2022-04-08 06:13:04,063 INFO L272 TraceCheckUtils]: 155: Hoare triple {163263#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)); {163263#false} is VALID [2022-04-08 06:13:04,063 INFO L290 TraceCheckUtils]: 156: Hoare triple {163263#false} ~cond := #in~cond; {163263#false} is VALID [2022-04-08 06:13:04,063 INFO L290 TraceCheckUtils]: 157: Hoare triple {163263#false} assume 0 == ~cond; {163263#false} is VALID [2022-04-08 06:13:04,064 INFO L290 TraceCheckUtils]: 158: Hoare triple {163263#false} assume !false; {163263#false} is VALID [2022-04-08 06:13:04,064 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-08 06:13:04,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:13:05,165 INFO L290 TraceCheckUtils]: 158: Hoare triple {163263#false} assume !false; {163263#false} is VALID [2022-04-08 06:13:05,165 INFO L290 TraceCheckUtils]: 157: Hoare triple {163263#false} assume 0 == ~cond; {163263#false} is VALID [2022-04-08 06:13:05,165 INFO L290 TraceCheckUtils]: 156: Hoare triple {163263#false} ~cond := #in~cond; {163263#false} is VALID [2022-04-08 06:13:05,165 INFO L272 TraceCheckUtils]: 155: Hoare triple {163263#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)); {163263#false} is VALID [2022-04-08 06:13:05,166 INFO L290 TraceCheckUtils]: 154: Hoare triple {163772#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {163263#false} is VALID [2022-04-08 06:13:05,166 INFO L290 TraceCheckUtils]: 153: Hoare triple {163776#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163772#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:13:05,166 INFO L290 TraceCheckUtils]: 152: Hoare triple {163776#(< ~counter~0 50)} assume !(~r~0 < 0); {163776#(< ~counter~0 50)} is VALID [2022-04-08 06:13:05,167 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163262#true} {163776#(< ~counter~0 50)} #98#return; {163776#(< ~counter~0 50)} is VALID [2022-04-08 06:13:05,167 INFO L290 TraceCheckUtils]: 150: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,167 INFO L290 TraceCheckUtils]: 149: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,167 INFO L290 TraceCheckUtils]: 148: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,167 INFO L272 TraceCheckUtils]: 147: Hoare triple {163776#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,167 INFO L290 TraceCheckUtils]: 146: Hoare triple {163776#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {163776#(< ~counter~0 50)} is VALID [2022-04-08 06:13:05,171 INFO L290 TraceCheckUtils]: 145: Hoare triple {163801#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163776#(< ~counter~0 50)} is VALID [2022-04-08 06:13:05,171 INFO L290 TraceCheckUtils]: 144: Hoare triple {163801#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163801#(< ~counter~0 49)} is VALID [2022-04-08 06:13:05,171 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163262#true} {163801#(< ~counter~0 49)} #98#return; {163801#(< ~counter~0 49)} is VALID [2022-04-08 06:13:05,172 INFO L290 TraceCheckUtils]: 142: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,172 INFO L290 TraceCheckUtils]: 141: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,172 INFO L290 TraceCheckUtils]: 140: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,172 INFO L272 TraceCheckUtils]: 139: Hoare triple {163801#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,172 INFO L290 TraceCheckUtils]: 138: Hoare triple {163801#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {163801#(< ~counter~0 49)} is VALID [2022-04-08 06:13:05,173 INFO L290 TraceCheckUtils]: 137: Hoare triple {163826#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163801#(< ~counter~0 49)} is VALID [2022-04-08 06:13:05,174 INFO L290 TraceCheckUtils]: 136: Hoare triple {163826#(< ~counter~0 48)} assume !(~r~0 > 0); {163826#(< ~counter~0 48)} is VALID [2022-04-08 06:13:05,174 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163262#true} {163826#(< ~counter~0 48)} #96#return; {163826#(< ~counter~0 48)} is VALID [2022-04-08 06:13:05,174 INFO L290 TraceCheckUtils]: 134: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,174 INFO L290 TraceCheckUtils]: 133: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,174 INFO L290 TraceCheckUtils]: 132: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,174 INFO L272 TraceCheckUtils]: 131: Hoare triple {163826#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,175 INFO L290 TraceCheckUtils]: 130: Hoare triple {163826#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {163826#(< ~counter~0 48)} is VALID [2022-04-08 06:13:05,176 INFO L290 TraceCheckUtils]: 129: Hoare triple {163851#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163826#(< ~counter~0 48)} is VALID [2022-04-08 06:13:05,176 INFO L290 TraceCheckUtils]: 128: Hoare triple {163851#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163851#(< ~counter~0 47)} is VALID [2022-04-08 06:13:05,177 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163262#true} {163851#(< ~counter~0 47)} #96#return; {163851#(< ~counter~0 47)} is VALID [2022-04-08 06:13:05,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,177 INFO L290 TraceCheckUtils]: 125: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,177 INFO L290 TraceCheckUtils]: 124: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,177 INFO L272 TraceCheckUtils]: 123: Hoare triple {163851#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,177 INFO L290 TraceCheckUtils]: 122: Hoare triple {163851#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {163851#(< ~counter~0 47)} is VALID [2022-04-08 06:13:05,179 INFO L290 TraceCheckUtils]: 121: Hoare triple {163876#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163851#(< ~counter~0 47)} is VALID [2022-04-08 06:13:05,179 INFO L290 TraceCheckUtils]: 120: Hoare triple {163876#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163876#(< ~counter~0 46)} is VALID [2022-04-08 06:13:05,179 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163262#true} {163876#(< ~counter~0 46)} #96#return; {163876#(< ~counter~0 46)} is VALID [2022-04-08 06:13:05,180 INFO L290 TraceCheckUtils]: 118: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,180 INFO L290 TraceCheckUtils]: 117: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,180 INFO L290 TraceCheckUtils]: 116: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,180 INFO L272 TraceCheckUtils]: 115: Hoare triple {163876#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,180 INFO L290 TraceCheckUtils]: 114: Hoare triple {163876#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {163876#(< ~counter~0 46)} is VALID [2022-04-08 06:13:05,181 INFO L290 TraceCheckUtils]: 113: Hoare triple {163901#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163876#(< ~counter~0 46)} is VALID [2022-04-08 06:13:05,182 INFO L290 TraceCheckUtils]: 112: Hoare triple {163901#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163901#(< ~counter~0 45)} is VALID [2022-04-08 06:13:05,182 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163262#true} {163901#(< ~counter~0 45)} #96#return; {163901#(< ~counter~0 45)} is VALID [2022-04-08 06:13:05,182 INFO L290 TraceCheckUtils]: 110: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,182 INFO L290 TraceCheckUtils]: 109: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,182 INFO L290 TraceCheckUtils]: 108: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,182 INFO L272 TraceCheckUtils]: 107: Hoare triple {163901#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,183 INFO L290 TraceCheckUtils]: 106: Hoare triple {163901#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {163901#(< ~counter~0 45)} is VALID [2022-04-08 06:13:05,184 INFO L290 TraceCheckUtils]: 105: Hoare triple {163926#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163901#(< ~counter~0 45)} is VALID [2022-04-08 06:13:05,184 INFO L290 TraceCheckUtils]: 104: Hoare triple {163926#(< ~counter~0 44)} assume !!(0 != ~r~0); {163926#(< ~counter~0 44)} is VALID [2022-04-08 06:13:05,185 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163262#true} {163926#(< ~counter~0 44)} #94#return; {163926#(< ~counter~0 44)} is VALID [2022-04-08 06:13:05,185 INFO L290 TraceCheckUtils]: 102: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,185 INFO L290 TraceCheckUtils]: 101: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,185 INFO L290 TraceCheckUtils]: 100: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,185 INFO L272 TraceCheckUtils]: 99: Hoare triple {163926#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,185 INFO L290 TraceCheckUtils]: 98: Hoare triple {163926#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {163926#(< ~counter~0 44)} is VALID [2022-04-08 06:13:05,187 INFO L290 TraceCheckUtils]: 97: Hoare triple {163951#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163926#(< ~counter~0 44)} is VALID [2022-04-08 06:13:05,187 INFO L290 TraceCheckUtils]: 96: Hoare triple {163951#(< ~counter~0 43)} assume !(~r~0 < 0); {163951#(< ~counter~0 43)} is VALID [2022-04-08 06:13:05,188 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163262#true} {163951#(< ~counter~0 43)} #98#return; {163951#(< ~counter~0 43)} is VALID [2022-04-08 06:13:05,188 INFO L290 TraceCheckUtils]: 94: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,188 INFO L290 TraceCheckUtils]: 93: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,188 INFO L290 TraceCheckUtils]: 92: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,188 INFO L272 TraceCheckUtils]: 91: Hoare triple {163951#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,189 INFO L290 TraceCheckUtils]: 90: Hoare triple {163951#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {163951#(< ~counter~0 43)} is VALID [2022-04-08 06:13:05,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {163976#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163951#(< ~counter~0 43)} is VALID [2022-04-08 06:13:05,191 INFO L290 TraceCheckUtils]: 88: Hoare triple {163976#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163976#(< ~counter~0 42)} is VALID [2022-04-08 06:13:05,191 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163262#true} {163976#(< ~counter~0 42)} #98#return; {163976#(< ~counter~0 42)} is VALID [2022-04-08 06:13:05,191 INFO L290 TraceCheckUtils]: 86: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,191 INFO L290 TraceCheckUtils]: 85: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,192 INFO L290 TraceCheckUtils]: 84: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,192 INFO L272 TraceCheckUtils]: 83: Hoare triple {163976#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,192 INFO L290 TraceCheckUtils]: 82: Hoare triple {163976#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {163976#(< ~counter~0 42)} is VALID [2022-04-08 06:13:05,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {164001#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163976#(< ~counter~0 42)} is VALID [2022-04-08 06:13:05,194 INFO L290 TraceCheckUtils]: 80: Hoare triple {164001#(< ~counter~0 41)} assume !(~r~0 > 0); {164001#(< ~counter~0 41)} is VALID [2022-04-08 06:13:05,195 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163262#true} {164001#(< ~counter~0 41)} #96#return; {164001#(< ~counter~0 41)} is VALID [2022-04-08 06:13:05,195 INFO L290 TraceCheckUtils]: 78: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,195 INFO L290 TraceCheckUtils]: 77: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,195 INFO L272 TraceCheckUtils]: 75: Hoare triple {164001#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,195 INFO L290 TraceCheckUtils]: 74: Hoare triple {164001#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {164001#(< ~counter~0 41)} is VALID [2022-04-08 06:13:05,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {164026#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164001#(< ~counter~0 41)} is VALID [2022-04-08 06:13:05,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {164026#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164026#(< ~counter~0 40)} is VALID [2022-04-08 06:13:05,198 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163262#true} {164026#(< ~counter~0 40)} #96#return; {164026#(< ~counter~0 40)} is VALID [2022-04-08 06:13:05,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,198 INFO L290 TraceCheckUtils]: 69: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,198 INFO L272 TraceCheckUtils]: 67: Hoare triple {164026#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {164026#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {164026#(< ~counter~0 40)} is VALID [2022-04-08 06:13:05,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {164051#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164026#(< ~counter~0 40)} is VALID [2022-04-08 06:13:05,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {164051#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164051#(< ~counter~0 39)} is VALID [2022-04-08 06:13:05,201 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163262#true} {164051#(< ~counter~0 39)} #96#return; {164051#(< ~counter~0 39)} is VALID [2022-04-08 06:13:05,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,201 INFO L272 TraceCheckUtils]: 59: Hoare triple {164051#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {164051#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {164051#(< ~counter~0 39)} is VALID [2022-04-08 06:13:05,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {164076#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164051#(< ~counter~0 39)} is VALID [2022-04-08 06:13:05,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {164076#(< ~counter~0 38)} assume !!(0 != ~r~0); {164076#(< ~counter~0 38)} is VALID [2022-04-08 06:13:05,204 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163262#true} {164076#(< ~counter~0 38)} #94#return; {164076#(< ~counter~0 38)} is VALID [2022-04-08 06:13:05,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,204 INFO L272 TraceCheckUtils]: 51: Hoare triple {164076#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {164076#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {164076#(< ~counter~0 38)} is VALID [2022-04-08 06:13:05,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {164101#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164076#(< ~counter~0 38)} is VALID [2022-04-08 06:13:05,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {164101#(< ~counter~0 37)} assume !(~r~0 < 0); {164101#(< ~counter~0 37)} is VALID [2022-04-08 06:13:05,207 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163262#true} {164101#(< ~counter~0 37)} #98#return; {164101#(< ~counter~0 37)} is VALID [2022-04-08 06:13:05,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,207 INFO L272 TraceCheckUtils]: 43: Hoare triple {164101#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {164101#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {164101#(< ~counter~0 37)} is VALID [2022-04-08 06:13:05,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {164126#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164101#(< ~counter~0 37)} is VALID [2022-04-08 06:13:05,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {164126#(< ~counter~0 36)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164126#(< ~counter~0 36)} is VALID [2022-04-08 06:13:05,209 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163262#true} {164126#(< ~counter~0 36)} #98#return; {164126#(< ~counter~0 36)} is VALID [2022-04-08 06:13:05,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,210 INFO L272 TraceCheckUtils]: 35: Hoare triple {164126#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {164126#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {164126#(< ~counter~0 36)} is VALID [2022-04-08 06:13:05,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {164151#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164126#(< ~counter~0 36)} is VALID [2022-04-08 06:13:05,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {164151#(< ~counter~0 35)} assume !(~r~0 > 0); {164151#(< ~counter~0 35)} is VALID [2022-04-08 06:13:05,212 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163262#true} {164151#(< ~counter~0 35)} #96#return; {164151#(< ~counter~0 35)} is VALID [2022-04-08 06:13:05,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,212 INFO L272 TraceCheckUtils]: 27: Hoare triple {164151#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {164151#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {164151#(< ~counter~0 35)} is VALID [2022-04-08 06:13:05,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {164176#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164151#(< ~counter~0 35)} is VALID [2022-04-08 06:13:05,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {164176#(< ~counter~0 34)} assume !!(0 != ~r~0); {164176#(< ~counter~0 34)} is VALID [2022-04-08 06:13:05,215 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163262#true} {164176#(< ~counter~0 34)} #94#return; {164176#(< ~counter~0 34)} is VALID [2022-04-08 06:13:05,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,215 INFO L272 TraceCheckUtils]: 19: Hoare triple {164176#(< ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {164176#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {164176#(< ~counter~0 34)} is VALID [2022-04-08 06:13:05,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {164201#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164176#(< ~counter~0 34)} is VALID [2022-04-08 06:13:05,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {164201#(< ~counter~0 33)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {164201#(< ~counter~0 33)} is VALID [2022-04-08 06:13:05,217 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163262#true} {164201#(< ~counter~0 33)} #92#return; {164201#(< ~counter~0 33)} is VALID [2022-04-08 06:13:05,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,218 INFO L272 TraceCheckUtils]: 11: Hoare triple {164201#(< ~counter~0 33)} 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)); {163262#true} is VALID [2022-04-08 06:13:05,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163262#true} {164201#(< ~counter~0 33)} #90#return; {164201#(< ~counter~0 33)} is VALID [2022-04-08 06:13:05,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-08 06:13:05,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-08 06:13:05,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-08 06:13:05,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {164201#(< ~counter~0 33)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163262#true} is VALID [2022-04-08 06:13:05,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {164201#(< ~counter~0 33)} 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; {164201#(< ~counter~0 33)} is VALID [2022-04-08 06:13:05,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {164201#(< ~counter~0 33)} call #t~ret9 := main(); {164201#(< ~counter~0 33)} is VALID [2022-04-08 06:13:05,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164201#(< ~counter~0 33)} {163262#true} #102#return; {164201#(< ~counter~0 33)} is VALID [2022-04-08 06:13:05,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {164201#(< ~counter~0 33)} assume true; {164201#(< ~counter~0 33)} is VALID [2022-04-08 06:13:05,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {163262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {164201#(< ~counter~0 33)} is VALID [2022-04-08 06:13:05,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {163262#true} call ULTIMATE.init(); {163262#true} is VALID [2022-04-08 06:13:05,221 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-08 06:13:05,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:13:05,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771261256] [2022-04-08 06:13:05,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:13:05,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942677137] [2022-04-08 06:13:05,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942677137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:13:05,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:13:05,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 06:13:05,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:13:05,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [959987076] [2022-04-08 06:13:05,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [959987076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:05,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:05,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 06:13:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693029356] [2022-04-08 06:13:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:13:05,222 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-08 06:13:05,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:13:05,222 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-08 06:13:05,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:05,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 06:13:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:05,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 06:13:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 06:13:05,503 INFO L87 Difference]: Start difference. First operand 851 states and 1131 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-08 06:13:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:12,486 INFO L93 Difference]: Finished difference Result 902 states and 1201 transitions. [2022-04-08 06:13:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 06:13:12,486 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-08 06:13:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:13:12,486 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-08 06:13:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-08 06:13:12,489 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-08 06:13:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-08 06:13:12,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 354 transitions. [2022-04-08 06:13:13,170 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-08 06:13:13,209 INFO L225 Difference]: With dead ends: 902 [2022-04-08 06:13:13,209 INFO L226 Difference]: Without dead ends: 897 [2022-04-08 06:13:13,210 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-08 06:13:13,210 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 272 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:13:13,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 385 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 06:13:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-08 06:13:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2022-04-08 06:13:16,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:13:16,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:13:16,700 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:13:16,700 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:13:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:16,726 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-08 06:13:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-08 06:13:16,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:16,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:16,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-08 06:13:16,729 INFO L87 Difference]: Start difference. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-08 06:13:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:16,754 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-08 06:13:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-08 06:13:16,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:16,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:16,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:13:16,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:13:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:13:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1169 transitions. [2022-04-08 06:13:16,792 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1169 transitions. Word has length 159 [2022-04-08 06:13:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:13:16,792 INFO L478 AbstractCegarLoop]: Abstraction has 875 states and 1169 transitions. [2022-04-08 06:13:16,792 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-08 06:13:16,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 875 states and 1169 transitions. [2022-04-08 06:13:31,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1169 edges. 1167 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1169 transitions. [2022-04-08 06:13:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 06:13:31,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:31,456 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-08 06:13:31,462 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-08 06:13:31,656 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-08 06:13:31,656 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 29 times [2022-04-08 06:13:31,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:31,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022460342] [2022-04-08 06:13:31,657 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:31,657 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 30 times [2022-04-08 06:13:31,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:31,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584192570] [2022-04-08 06:13:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:31,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:31,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:13:31,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566541777] [2022-04-08 06:13:31,672 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:13:31,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:31,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:31,673 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-08 06:13:31,674 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-08 06:13:32,708 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:13:32,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:13:32,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 06:13:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:13:32,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:13:33,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {169631#true} call ULTIMATE.init(); {169631#true} is VALID [2022-04-08 06:13:33,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {169631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169639#(<= ~counter~0 0)} {169631#true} #102#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {169639#(<= ~counter~0 0)} call #t~ret9 := main(); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {169639#(<= ~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; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {169639#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {169639#(<= ~counter~0 0)} ~cond := #in~cond; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {169639#(<= ~counter~0 0)} assume !(0 == ~cond); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169639#(<= ~counter~0 0)} {169639#(<= ~counter~0 0)} #90#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,761 INFO L272 TraceCheckUtils]: 11: Hoare triple {169639#(<= ~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)); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {169639#(<= ~counter~0 0)} ~cond := #in~cond; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {169639#(<= ~counter~0 0)} assume !(0 == ~cond); {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169639#(<= ~counter~0 0)} {169639#(<= ~counter~0 0)} #92#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {169639#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {169639#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:33,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {169639#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:33,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {169688#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:33,767 INFO L272 TraceCheckUtils]: 19: Hoare triple {169688#(<= ~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)); {169688#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:33,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {169688#(<= ~counter~0 1)} ~cond := #in~cond; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:33,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {169688#(<= ~counter~0 1)} assume !(0 == ~cond); {169688#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:33,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {169688#(<= ~counter~0 1)} assume true; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:33,769 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169688#(<= ~counter~0 1)} {169688#(<= ~counter~0 1)} #94#return; {169688#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:33,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {169688#(<= ~counter~0 1)} assume !!(0 != ~r~0); {169688#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:33,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {169688#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:33,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {169713#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:33,771 INFO L272 TraceCheckUtils]: 27: Hoare triple {169713#(<= ~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)); {169713#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:33,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {169713#(<= ~counter~0 2)} ~cond := #in~cond; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:33,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {169713#(<= ~counter~0 2)} assume !(0 == ~cond); {169713#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:33,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {169713#(<= ~counter~0 2)} assume true; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:33,773 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169713#(<= ~counter~0 2)} {169713#(<= ~counter~0 2)} #96#return; {169713#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:33,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {169713#(<= ~counter~0 2)} assume !(~r~0 > 0); {169713#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:33,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {169713#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:33,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {169738#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:33,775 INFO L272 TraceCheckUtils]: 35: Hoare triple {169738#(<= ~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)); {169738#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:33,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {169738#(<= ~counter~0 3)} ~cond := #in~cond; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:33,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {169738#(<= ~counter~0 3)} assume !(0 == ~cond); {169738#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:33,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {169738#(<= ~counter~0 3)} assume true; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:33,777 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169738#(<= ~counter~0 3)} {169738#(<= ~counter~0 3)} #98#return; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:33,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {169738#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169738#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:33,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {169738#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:33,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {169763#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:33,779 INFO L272 TraceCheckUtils]: 43: Hoare triple {169763#(<= ~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)); {169763#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:33,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {169763#(<= ~counter~0 4)} ~cond := #in~cond; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:33,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {169763#(<= ~counter~0 4)} assume !(0 == ~cond); {169763#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:33,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {169763#(<= ~counter~0 4)} assume true; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:33,780 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169763#(<= ~counter~0 4)} {169763#(<= ~counter~0 4)} #98#return; {169763#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:33,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {169763#(<= ~counter~0 4)} assume !(~r~0 < 0); {169763#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:33,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {169763#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:33,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {169788#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:33,783 INFO L272 TraceCheckUtils]: 51: Hoare triple {169788#(<= ~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)); {169788#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:33,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {169788#(<= ~counter~0 5)} ~cond := #in~cond; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:33,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {169788#(<= ~counter~0 5)} assume !(0 == ~cond); {169788#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:33,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {169788#(<= ~counter~0 5)} assume true; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:33,784 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169788#(<= ~counter~0 5)} {169788#(<= ~counter~0 5)} #94#return; {169788#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:33,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {169788#(<= ~counter~0 5)} assume !!(0 != ~r~0); {169788#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:33,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {169788#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:33,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {169813#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:33,787 INFO L272 TraceCheckUtils]: 59: Hoare triple {169813#(<= ~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)); {169813#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:33,787 INFO L290 TraceCheckUtils]: 60: Hoare triple {169813#(<= ~counter~0 6)} ~cond := #in~cond; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:33,787 INFO L290 TraceCheckUtils]: 61: Hoare triple {169813#(<= ~counter~0 6)} assume !(0 == ~cond); {169813#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:33,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {169813#(<= ~counter~0 6)} assume true; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:33,788 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169813#(<= ~counter~0 6)} {169813#(<= ~counter~0 6)} #96#return; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:33,788 INFO L290 TraceCheckUtils]: 64: Hoare triple {169813#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169813#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:33,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {169813#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:33,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {169838#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:33,791 INFO L272 TraceCheckUtils]: 67: Hoare triple {169838#(<= ~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)); {169838#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:33,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {169838#(<= ~counter~0 7)} ~cond := #in~cond; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:33,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {169838#(<= ~counter~0 7)} assume !(0 == ~cond); {169838#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:33,792 INFO L290 TraceCheckUtils]: 70: Hoare triple {169838#(<= ~counter~0 7)} assume true; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:33,792 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169838#(<= ~counter~0 7)} {169838#(<= ~counter~0 7)} #96#return; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:33,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {169838#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169838#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:33,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {169838#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:33,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {169863#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:33,795 INFO L272 TraceCheckUtils]: 75: Hoare triple {169863#(<= ~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)); {169863#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:33,795 INFO L290 TraceCheckUtils]: 76: Hoare triple {169863#(<= ~counter~0 8)} ~cond := #in~cond; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:33,795 INFO L290 TraceCheckUtils]: 77: Hoare triple {169863#(<= ~counter~0 8)} assume !(0 == ~cond); {169863#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:33,796 INFO L290 TraceCheckUtils]: 78: Hoare triple {169863#(<= ~counter~0 8)} assume true; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:33,796 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169863#(<= ~counter~0 8)} {169863#(<= ~counter~0 8)} #96#return; {169863#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:33,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {169863#(<= ~counter~0 8)} assume !(~r~0 > 0); {169863#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:33,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {169863#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:33,798 INFO L290 TraceCheckUtils]: 82: Hoare triple {169888#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:33,799 INFO L272 TraceCheckUtils]: 83: Hoare triple {169888#(<= ~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)); {169888#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:33,799 INFO L290 TraceCheckUtils]: 84: Hoare triple {169888#(<= ~counter~0 9)} ~cond := #in~cond; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:33,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {169888#(<= ~counter~0 9)} assume !(0 == ~cond); {169888#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:33,799 INFO L290 TraceCheckUtils]: 86: Hoare triple {169888#(<= ~counter~0 9)} assume true; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:33,800 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169888#(<= ~counter~0 9)} {169888#(<= ~counter~0 9)} #98#return; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:33,800 INFO L290 TraceCheckUtils]: 88: Hoare triple {169888#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169888#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:33,802 INFO L290 TraceCheckUtils]: 89: Hoare triple {169888#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:33,802 INFO L290 TraceCheckUtils]: 90: Hoare triple {169913#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:33,802 INFO L272 TraceCheckUtils]: 91: Hoare triple {169913#(<= ~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)); {169913#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:33,803 INFO L290 TraceCheckUtils]: 92: Hoare triple {169913#(<= ~counter~0 10)} ~cond := #in~cond; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:33,803 INFO L290 TraceCheckUtils]: 93: Hoare triple {169913#(<= ~counter~0 10)} assume !(0 == ~cond); {169913#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:33,803 INFO L290 TraceCheckUtils]: 94: Hoare triple {169913#(<= ~counter~0 10)} assume true; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:33,804 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169913#(<= ~counter~0 10)} {169913#(<= ~counter~0 10)} #98#return; {169913#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:33,804 INFO L290 TraceCheckUtils]: 96: Hoare triple {169913#(<= ~counter~0 10)} assume !(~r~0 < 0); {169913#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:33,806 INFO L290 TraceCheckUtils]: 97: Hoare triple {169913#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:33,806 INFO L290 TraceCheckUtils]: 98: Hoare triple {169938#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:33,807 INFO L272 TraceCheckUtils]: 99: Hoare triple {169938#(<= ~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)); {169938#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:33,807 INFO L290 TraceCheckUtils]: 100: Hoare triple {169938#(<= ~counter~0 11)} ~cond := #in~cond; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:33,807 INFO L290 TraceCheckUtils]: 101: Hoare triple {169938#(<= ~counter~0 11)} assume !(0 == ~cond); {169938#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:33,807 INFO L290 TraceCheckUtils]: 102: Hoare triple {169938#(<= ~counter~0 11)} assume true; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:33,808 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169938#(<= ~counter~0 11)} {169938#(<= ~counter~0 11)} #94#return; {169938#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:33,808 INFO L290 TraceCheckUtils]: 104: Hoare triple {169938#(<= ~counter~0 11)} assume !!(0 != ~r~0); {169938#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:33,810 INFO L290 TraceCheckUtils]: 105: Hoare triple {169938#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:33,811 INFO L290 TraceCheckUtils]: 106: Hoare triple {169963#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:33,811 INFO L272 TraceCheckUtils]: 107: Hoare triple {169963#(<= ~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)); {169963#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:33,811 INFO L290 TraceCheckUtils]: 108: Hoare triple {169963#(<= ~counter~0 12)} ~cond := #in~cond; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:33,812 INFO L290 TraceCheckUtils]: 109: Hoare triple {169963#(<= ~counter~0 12)} assume !(0 == ~cond); {169963#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:33,812 INFO L290 TraceCheckUtils]: 110: Hoare triple {169963#(<= ~counter~0 12)} assume true; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:33,812 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169963#(<= ~counter~0 12)} {169963#(<= ~counter~0 12)} #96#return; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:33,813 INFO L290 TraceCheckUtils]: 112: Hoare triple {169963#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169963#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:33,814 INFO L290 TraceCheckUtils]: 113: Hoare triple {169963#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:33,815 INFO L290 TraceCheckUtils]: 114: Hoare triple {169988#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:33,815 INFO L272 TraceCheckUtils]: 115: Hoare triple {169988#(<= ~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)); {169988#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:33,815 INFO L290 TraceCheckUtils]: 116: Hoare triple {169988#(<= ~counter~0 13)} ~cond := #in~cond; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:33,816 INFO L290 TraceCheckUtils]: 117: Hoare triple {169988#(<= ~counter~0 13)} assume !(0 == ~cond); {169988#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:33,816 INFO L290 TraceCheckUtils]: 118: Hoare triple {169988#(<= ~counter~0 13)} assume true; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:33,816 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169988#(<= ~counter~0 13)} {169988#(<= ~counter~0 13)} #96#return; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:33,817 INFO L290 TraceCheckUtils]: 120: Hoare triple {169988#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169988#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:33,818 INFO L290 TraceCheckUtils]: 121: Hoare triple {169988#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:33,819 INFO L290 TraceCheckUtils]: 122: Hoare triple {170013#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:33,819 INFO L272 TraceCheckUtils]: 123: Hoare triple {170013#(<= ~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)); {170013#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:33,819 INFO L290 TraceCheckUtils]: 124: Hoare triple {170013#(<= ~counter~0 14)} ~cond := #in~cond; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:33,820 INFO L290 TraceCheckUtils]: 125: Hoare triple {170013#(<= ~counter~0 14)} assume !(0 == ~cond); {170013#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:33,820 INFO L290 TraceCheckUtils]: 126: Hoare triple {170013#(<= ~counter~0 14)} assume true; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:33,820 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {170013#(<= ~counter~0 14)} {170013#(<= ~counter~0 14)} #96#return; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:33,821 INFO L290 TraceCheckUtils]: 128: Hoare triple {170013#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170013#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:33,823 INFO L290 TraceCheckUtils]: 129: Hoare triple {170013#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:33,824 INFO L290 TraceCheckUtils]: 130: Hoare triple {170038#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:33,824 INFO L272 TraceCheckUtils]: 131: Hoare triple {170038#(<= ~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)); {170038#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:33,824 INFO L290 TraceCheckUtils]: 132: Hoare triple {170038#(<= ~counter~0 15)} ~cond := #in~cond; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:33,825 INFO L290 TraceCheckUtils]: 133: Hoare triple {170038#(<= ~counter~0 15)} assume !(0 == ~cond); {170038#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:33,825 INFO L290 TraceCheckUtils]: 134: Hoare triple {170038#(<= ~counter~0 15)} assume true; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:33,825 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {170038#(<= ~counter~0 15)} {170038#(<= ~counter~0 15)} #96#return; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:33,826 INFO L290 TraceCheckUtils]: 136: Hoare triple {170038#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170038#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:33,827 INFO L290 TraceCheckUtils]: 137: Hoare triple {170038#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:33,827 INFO L290 TraceCheckUtils]: 138: Hoare triple {170063#(<= ~counter~0 16)} assume !!(#t~post7 < 50);havoc #t~post7; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:33,828 INFO L272 TraceCheckUtils]: 139: Hoare triple {170063#(<= ~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)); {170063#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:33,828 INFO L290 TraceCheckUtils]: 140: Hoare triple {170063#(<= ~counter~0 16)} ~cond := #in~cond; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:33,828 INFO L290 TraceCheckUtils]: 141: Hoare triple {170063#(<= ~counter~0 16)} assume !(0 == ~cond); {170063#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:33,829 INFO L290 TraceCheckUtils]: 142: Hoare triple {170063#(<= ~counter~0 16)} assume true; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:33,829 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {170063#(<= ~counter~0 16)} {170063#(<= ~counter~0 16)} #96#return; {170063#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:33,830 INFO L290 TraceCheckUtils]: 144: Hoare triple {170063#(<= ~counter~0 16)} assume !(~r~0 > 0); {170063#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:33,831 INFO L290 TraceCheckUtils]: 145: Hoare triple {170063#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:33,832 INFO L290 TraceCheckUtils]: 146: Hoare triple {170088#(<= ~counter~0 17)} assume !!(#t~post8 < 50);havoc #t~post8; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:33,832 INFO L272 TraceCheckUtils]: 147: Hoare triple {170088#(<= ~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)); {170088#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:33,832 INFO L290 TraceCheckUtils]: 148: Hoare triple {170088#(<= ~counter~0 17)} ~cond := #in~cond; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:33,833 INFO L290 TraceCheckUtils]: 149: Hoare triple {170088#(<= ~counter~0 17)} assume !(0 == ~cond); {170088#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:33,833 INFO L290 TraceCheckUtils]: 150: Hoare triple {170088#(<= ~counter~0 17)} assume true; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:33,833 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {170088#(<= ~counter~0 17)} {170088#(<= ~counter~0 17)} #98#return; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:33,834 INFO L290 TraceCheckUtils]: 152: Hoare triple {170088#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170088#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:33,834 INFO L290 TraceCheckUtils]: 153: Hoare triple {170088#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170113#(<= |main_#t~post8| 17)} is VALID [2022-04-08 06:13:33,834 INFO L290 TraceCheckUtils]: 154: Hoare triple {170113#(<= |main_#t~post8| 17)} assume !(#t~post8 < 50);havoc #t~post8; {169632#false} is VALID [2022-04-08 06:13:33,835 INFO L290 TraceCheckUtils]: 155: Hoare triple {169632#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169632#false} is VALID [2022-04-08 06:13:33,835 INFO L290 TraceCheckUtils]: 156: Hoare triple {169632#false} assume !(#t~post6 < 50);havoc #t~post6; {169632#false} is VALID [2022-04-08 06:13:33,835 INFO L272 TraceCheckUtils]: 157: Hoare triple {169632#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)); {169632#false} is VALID [2022-04-08 06:13:33,835 INFO L290 TraceCheckUtils]: 158: Hoare triple {169632#false} ~cond := #in~cond; {169632#false} is VALID [2022-04-08 06:13:33,835 INFO L290 TraceCheckUtils]: 159: Hoare triple {169632#false} assume 0 == ~cond; {169632#false} is VALID [2022-04-08 06:13:33,835 INFO L290 TraceCheckUtils]: 160: Hoare triple {169632#false} assume !false; {169632#false} is VALID [2022-04-08 06:13:33,835 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-08 06:13:33,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:13:34,934 INFO L290 TraceCheckUtils]: 160: Hoare triple {169632#false} assume !false; {169632#false} is VALID [2022-04-08 06:13:34,934 INFO L290 TraceCheckUtils]: 159: Hoare triple {169632#false} assume 0 == ~cond; {169632#false} is VALID [2022-04-08 06:13:34,934 INFO L290 TraceCheckUtils]: 158: Hoare triple {169632#false} ~cond := #in~cond; {169632#false} is VALID [2022-04-08 06:13:34,934 INFO L272 TraceCheckUtils]: 157: Hoare triple {169632#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)); {169632#false} is VALID [2022-04-08 06:13:34,934 INFO L290 TraceCheckUtils]: 156: Hoare triple {169632#false} assume !(#t~post6 < 50);havoc #t~post6; {169632#false} is VALID [2022-04-08 06:13:34,935 INFO L290 TraceCheckUtils]: 155: Hoare triple {169632#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169632#false} is VALID [2022-04-08 06:13:34,935 INFO L290 TraceCheckUtils]: 154: Hoare triple {170153#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {169632#false} is VALID [2022-04-08 06:13:34,935 INFO L290 TraceCheckUtils]: 153: Hoare triple {170157#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170153#(< |main_#t~post8| 50)} is VALID [2022-04-08 06:13:34,935 INFO L290 TraceCheckUtils]: 152: Hoare triple {170157#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170157#(< ~counter~0 50)} is VALID [2022-04-08 06:13:34,936 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {169631#true} {170157#(< ~counter~0 50)} #98#return; {170157#(< ~counter~0 50)} is VALID [2022-04-08 06:13:34,936 INFO L290 TraceCheckUtils]: 150: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,936 INFO L290 TraceCheckUtils]: 149: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,936 INFO L290 TraceCheckUtils]: 148: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,936 INFO L272 TraceCheckUtils]: 147: Hoare triple {170157#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,937 INFO L290 TraceCheckUtils]: 146: Hoare triple {170157#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {170157#(< ~counter~0 50)} is VALID [2022-04-08 06:13:34,940 INFO L290 TraceCheckUtils]: 145: Hoare triple {170182#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170157#(< ~counter~0 50)} is VALID [2022-04-08 06:13:34,941 INFO L290 TraceCheckUtils]: 144: Hoare triple {170182#(< ~counter~0 49)} assume !(~r~0 > 0); {170182#(< ~counter~0 49)} is VALID [2022-04-08 06:13:34,941 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {169631#true} {170182#(< ~counter~0 49)} #96#return; {170182#(< ~counter~0 49)} is VALID [2022-04-08 06:13:34,941 INFO L290 TraceCheckUtils]: 142: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,941 INFO L290 TraceCheckUtils]: 141: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,941 INFO L290 TraceCheckUtils]: 140: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,941 INFO L272 TraceCheckUtils]: 139: Hoare triple {170182#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,942 INFO L290 TraceCheckUtils]: 138: Hoare triple {170182#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {170182#(< ~counter~0 49)} is VALID [2022-04-08 06:13:34,943 INFO L290 TraceCheckUtils]: 137: Hoare triple {170207#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170182#(< ~counter~0 49)} is VALID [2022-04-08 06:13:34,943 INFO L290 TraceCheckUtils]: 136: Hoare triple {170207#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170207#(< ~counter~0 48)} is VALID [2022-04-08 06:13:34,944 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {169631#true} {170207#(< ~counter~0 48)} #96#return; {170207#(< ~counter~0 48)} is VALID [2022-04-08 06:13:34,944 INFO L290 TraceCheckUtils]: 134: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,944 INFO L290 TraceCheckUtils]: 133: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,944 INFO L290 TraceCheckUtils]: 132: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,944 INFO L272 TraceCheckUtils]: 131: Hoare triple {170207#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,944 INFO L290 TraceCheckUtils]: 130: Hoare triple {170207#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {170207#(< ~counter~0 48)} is VALID [2022-04-08 06:13:34,946 INFO L290 TraceCheckUtils]: 129: Hoare triple {170232#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170207#(< ~counter~0 48)} is VALID [2022-04-08 06:13:34,946 INFO L290 TraceCheckUtils]: 128: Hoare triple {170232#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170232#(< ~counter~0 47)} is VALID [2022-04-08 06:13:34,947 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {169631#true} {170232#(< ~counter~0 47)} #96#return; {170232#(< ~counter~0 47)} is VALID [2022-04-08 06:13:34,947 INFO L290 TraceCheckUtils]: 126: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,947 INFO L290 TraceCheckUtils]: 125: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,947 INFO L290 TraceCheckUtils]: 124: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,947 INFO L272 TraceCheckUtils]: 123: Hoare triple {170232#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,947 INFO L290 TraceCheckUtils]: 122: Hoare triple {170232#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {170232#(< ~counter~0 47)} is VALID [2022-04-08 06:13:34,949 INFO L290 TraceCheckUtils]: 121: Hoare triple {170257#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170232#(< ~counter~0 47)} is VALID [2022-04-08 06:13:34,949 INFO L290 TraceCheckUtils]: 120: Hoare triple {170257#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170257#(< ~counter~0 46)} is VALID [2022-04-08 06:13:34,949 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169631#true} {170257#(< ~counter~0 46)} #96#return; {170257#(< ~counter~0 46)} is VALID [2022-04-08 06:13:34,950 INFO L290 TraceCheckUtils]: 118: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,950 INFO L290 TraceCheckUtils]: 117: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,950 INFO L290 TraceCheckUtils]: 116: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,950 INFO L272 TraceCheckUtils]: 115: Hoare triple {170257#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,950 INFO L290 TraceCheckUtils]: 114: Hoare triple {170257#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {170257#(< ~counter~0 46)} is VALID [2022-04-08 06:13:34,951 INFO L290 TraceCheckUtils]: 113: Hoare triple {170282#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170257#(< ~counter~0 46)} is VALID [2022-04-08 06:13:34,952 INFO L290 TraceCheckUtils]: 112: Hoare triple {170282#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170282#(< ~counter~0 45)} is VALID [2022-04-08 06:13:34,952 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169631#true} {170282#(< ~counter~0 45)} #96#return; {170282#(< ~counter~0 45)} is VALID [2022-04-08 06:13:34,952 INFO L290 TraceCheckUtils]: 110: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,953 INFO L290 TraceCheckUtils]: 109: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,953 INFO L290 TraceCheckUtils]: 108: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,953 INFO L272 TraceCheckUtils]: 107: Hoare triple {170282#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,953 INFO L290 TraceCheckUtils]: 106: Hoare triple {170282#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {170282#(< ~counter~0 45)} is VALID [2022-04-08 06:13:34,955 INFO L290 TraceCheckUtils]: 105: Hoare triple {170307#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170282#(< ~counter~0 45)} is VALID [2022-04-08 06:13:34,955 INFO L290 TraceCheckUtils]: 104: Hoare triple {170307#(< ~counter~0 44)} assume !!(0 != ~r~0); {170307#(< ~counter~0 44)} is VALID [2022-04-08 06:13:34,956 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169631#true} {170307#(< ~counter~0 44)} #94#return; {170307#(< ~counter~0 44)} is VALID [2022-04-08 06:13:34,956 INFO L290 TraceCheckUtils]: 102: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,956 INFO L290 TraceCheckUtils]: 101: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,956 INFO L290 TraceCheckUtils]: 100: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,956 INFO L272 TraceCheckUtils]: 99: Hoare triple {170307#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,956 INFO L290 TraceCheckUtils]: 98: Hoare triple {170307#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {170307#(< ~counter~0 44)} is VALID [2022-04-08 06:13:34,957 INFO L290 TraceCheckUtils]: 97: Hoare triple {170332#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170307#(< ~counter~0 44)} is VALID [2022-04-08 06:13:34,958 INFO L290 TraceCheckUtils]: 96: Hoare triple {170332#(< ~counter~0 43)} assume !(~r~0 < 0); {170332#(< ~counter~0 43)} is VALID [2022-04-08 06:13:34,958 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169631#true} {170332#(< ~counter~0 43)} #98#return; {170332#(< ~counter~0 43)} is VALID [2022-04-08 06:13:34,958 INFO L290 TraceCheckUtils]: 94: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,958 INFO L290 TraceCheckUtils]: 93: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,959 INFO L290 TraceCheckUtils]: 92: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,959 INFO L272 TraceCheckUtils]: 91: Hoare triple {170332#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,959 INFO L290 TraceCheckUtils]: 90: Hoare triple {170332#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {170332#(< ~counter~0 43)} is VALID [2022-04-08 06:13:34,960 INFO L290 TraceCheckUtils]: 89: Hoare triple {170357#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170332#(< ~counter~0 43)} is VALID [2022-04-08 06:13:34,961 INFO L290 TraceCheckUtils]: 88: Hoare triple {170357#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170357#(< ~counter~0 42)} is VALID [2022-04-08 06:13:34,961 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169631#true} {170357#(< ~counter~0 42)} #98#return; {170357#(< ~counter~0 42)} is VALID [2022-04-08 06:13:34,961 INFO L290 TraceCheckUtils]: 86: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,961 INFO L290 TraceCheckUtils]: 85: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,961 INFO L290 TraceCheckUtils]: 84: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,961 INFO L272 TraceCheckUtils]: 83: Hoare triple {170357#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,962 INFO L290 TraceCheckUtils]: 82: Hoare triple {170357#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {170357#(< ~counter~0 42)} is VALID [2022-04-08 06:13:34,963 INFO L290 TraceCheckUtils]: 81: Hoare triple {170382#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170357#(< ~counter~0 42)} is VALID [2022-04-08 06:13:34,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {170382#(< ~counter~0 41)} assume !(~r~0 > 0); {170382#(< ~counter~0 41)} is VALID [2022-04-08 06:13:34,964 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169631#true} {170382#(< ~counter~0 41)} #96#return; {170382#(< ~counter~0 41)} is VALID [2022-04-08 06:13:34,964 INFO L290 TraceCheckUtils]: 78: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,964 INFO L290 TraceCheckUtils]: 77: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,964 INFO L272 TraceCheckUtils]: 75: Hoare triple {170382#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,964 INFO L290 TraceCheckUtils]: 74: Hoare triple {170382#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {170382#(< ~counter~0 41)} is VALID [2022-04-08 06:13:34,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {170407#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170382#(< ~counter~0 41)} is VALID [2022-04-08 06:13:34,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {170407#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170407#(< ~counter~0 40)} is VALID [2022-04-08 06:13:34,967 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169631#true} {170407#(< ~counter~0 40)} #96#return; {170407#(< ~counter~0 40)} is VALID [2022-04-08 06:13:34,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,967 INFO L272 TraceCheckUtils]: 67: Hoare triple {170407#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {170407#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {170407#(< ~counter~0 40)} is VALID [2022-04-08 06:13:34,969 INFO L290 TraceCheckUtils]: 65: Hoare triple {170432#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170407#(< ~counter~0 40)} is VALID [2022-04-08 06:13:34,969 INFO L290 TraceCheckUtils]: 64: Hoare triple {170432#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170432#(< ~counter~0 39)} is VALID [2022-04-08 06:13:34,969 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169631#true} {170432#(< ~counter~0 39)} #96#return; {170432#(< ~counter~0 39)} is VALID [2022-04-08 06:13:34,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,970 INFO L290 TraceCheckUtils]: 60: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,970 INFO L272 TraceCheckUtils]: 59: Hoare triple {170432#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {170432#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {170432#(< ~counter~0 39)} is VALID [2022-04-08 06:13:34,971 INFO L290 TraceCheckUtils]: 57: Hoare triple {170457#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170432#(< ~counter~0 39)} is VALID [2022-04-08 06:13:34,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {170457#(< ~counter~0 38)} assume !!(0 != ~r~0); {170457#(< ~counter~0 38)} is VALID [2022-04-08 06:13:34,972 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169631#true} {170457#(< ~counter~0 38)} #94#return; {170457#(< ~counter~0 38)} is VALID [2022-04-08 06:13:34,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,972 INFO L272 TraceCheckUtils]: 51: Hoare triple {170457#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {170457#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {170457#(< ~counter~0 38)} is VALID [2022-04-08 06:13:34,974 INFO L290 TraceCheckUtils]: 49: Hoare triple {170482#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170457#(< ~counter~0 38)} is VALID [2022-04-08 06:13:34,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {170482#(< ~counter~0 37)} assume !(~r~0 < 0); {170482#(< ~counter~0 37)} is VALID [2022-04-08 06:13:34,975 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169631#true} {170482#(< ~counter~0 37)} #98#return; {170482#(< ~counter~0 37)} is VALID [2022-04-08 06:13:34,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,975 INFO L272 TraceCheckUtils]: 43: Hoare triple {170482#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {170482#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {170482#(< ~counter~0 37)} is VALID [2022-04-08 06:13:34,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {170507#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170482#(< ~counter~0 37)} is VALID [2022-04-08 06:13:34,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {170507#(< ~counter~0 36)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170507#(< ~counter~0 36)} is VALID [2022-04-08 06:13:34,978 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169631#true} {170507#(< ~counter~0 36)} #98#return; {170507#(< ~counter~0 36)} is VALID [2022-04-08 06:13:34,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,978 INFO L272 TraceCheckUtils]: 35: Hoare triple {170507#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {170507#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {170507#(< ~counter~0 36)} is VALID [2022-04-08 06:13:34,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {170532#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170507#(< ~counter~0 36)} is VALID [2022-04-08 06:13:34,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {170532#(< ~counter~0 35)} assume !(~r~0 > 0); {170532#(< ~counter~0 35)} is VALID [2022-04-08 06:13:34,980 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169631#true} {170532#(< ~counter~0 35)} #96#return; {170532#(< ~counter~0 35)} is VALID [2022-04-08 06:13:34,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,981 INFO L272 TraceCheckUtils]: 27: Hoare triple {170532#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {170532#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {170532#(< ~counter~0 35)} is VALID [2022-04-08 06:13:34,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {170557#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170532#(< ~counter~0 35)} is VALID [2022-04-08 06:13:34,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {170557#(< ~counter~0 34)} assume !!(0 != ~r~0); {170557#(< ~counter~0 34)} is VALID [2022-04-08 06:13:34,983 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169631#true} {170557#(< ~counter~0 34)} #94#return; {170557#(< ~counter~0 34)} is VALID [2022-04-08 06:13:34,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,983 INFO L272 TraceCheckUtils]: 19: Hoare triple {170557#(< ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {170557#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {170557#(< ~counter~0 34)} is VALID [2022-04-08 06:13:34,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {170582#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170557#(< ~counter~0 34)} is VALID [2022-04-08 06:13:34,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {170582#(< ~counter~0 33)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {170582#(< ~counter~0 33)} is VALID [2022-04-08 06:13:34,986 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169631#true} {170582#(< ~counter~0 33)} #92#return; {170582#(< ~counter~0 33)} is VALID [2022-04-08 06:13:34,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,986 INFO L272 TraceCheckUtils]: 11: Hoare triple {170582#(< ~counter~0 33)} 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)); {169631#true} is VALID [2022-04-08 06:13:34,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169631#true} {170582#(< ~counter~0 33)} #90#return; {170582#(< ~counter~0 33)} is VALID [2022-04-08 06:13:34,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-08 06:13:34,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-08 06:13:34,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-08 06:13:34,987 INFO L272 TraceCheckUtils]: 6: Hoare triple {170582#(< ~counter~0 33)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {169631#true} is VALID [2022-04-08 06:13:34,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {170582#(< ~counter~0 33)} 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; {170582#(< ~counter~0 33)} is VALID [2022-04-08 06:13:34,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {170582#(< ~counter~0 33)} call #t~ret9 := main(); {170582#(< ~counter~0 33)} is VALID [2022-04-08 06:13:34,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170582#(< ~counter~0 33)} {169631#true} #102#return; {170582#(< ~counter~0 33)} is VALID [2022-04-08 06:13:34,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {170582#(< ~counter~0 33)} assume true; {170582#(< ~counter~0 33)} is VALID [2022-04-08 06:13:34,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {169631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {170582#(< ~counter~0 33)} is VALID [2022-04-08 06:13:34,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {169631#true} call ULTIMATE.init(); {169631#true} is VALID [2022-04-08 06:13:34,989 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-08 06:13:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:13:34,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584192570] [2022-04-08 06:13:34,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:13:34,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566541777] [2022-04-08 06:13:34,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566541777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:13:34,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:13:34,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 06:13:34,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:13:34,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022460342] [2022-04-08 06:13:34,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022460342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:34,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:34,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 06:13:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038320667] [2022-04-08 06:13:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:13:34,990 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-08 06:13:34,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:13:34,991 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-08 06:13:35,229 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-08 06:13:35,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 06:13:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 06:13:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 06:13:35,230 INFO L87 Difference]: Start difference. First operand 875 states and 1169 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-08 06:13:41,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:41,807 INFO L93 Difference]: Finished difference Result 1079 states and 1471 transitions. [2022-04-08 06:13:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 06:13:41,807 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-08 06:13:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:13:41,808 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-08 06:13:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-08 06:13:41,810 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-08 06:13:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-08 06:13:41,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 376 transitions. [2022-04-08 06:13:42,360 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-08 06:13:42,393 INFO L225 Difference]: With dead ends: 1079 [2022-04-08 06:13:42,393 INFO L226 Difference]: Without dead ends: 901 [2022-04-08 06:13:42,394 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-08 06:13:42,394 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 274 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:13:42,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 365 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 06:13:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-04-08 06:13:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 890. [2022-04-08 06:13:45,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:13:45,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:13:45,976 INFO L74 IsIncluded]: Start isIncluded. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:13:45,977 INFO L87 Difference]: Start difference. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:13:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:46,002 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-08 06:13:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-08 06:13:46,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:46,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:46,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-08 06:13:46,005 INFO L87 Difference]: Start difference. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-08 06:13:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:46,039 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-08 06:13:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-08 06:13:46,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:46,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:46,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:13:46,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:13:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:13:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1187 transitions. [2022-04-08 06:13:46,076 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1187 transitions. Word has length 161 [2022-04-08 06:13:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:13:46,076 INFO L478 AbstractCegarLoop]: Abstraction has 890 states and 1187 transitions. [2022-04-08 06:13:46,077 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-08 06:13:46,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 890 states and 1187 transitions. [2022-04-08 06:13:59,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1187 edges. 1186 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1187 transitions. [2022-04-08 06:13:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 06:13:59,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:59,727 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-08 06:13:59,736 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-08 06:13:59,934 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-08 06:13:59,935 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 25 times [2022-04-08 06:13:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:59,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [279378969] [2022-04-08 06:13:59,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 26 times [2022-04-08 06:13:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:59,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940610959] [2022-04-08 06:13:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:59,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:13:59,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200234792] [2022-04-08 06:13:59,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:13:59,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:59,952 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-08 06:13:59,952 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-08 06:14:00,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:14:00,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:14:00,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 06:14:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:14:00,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:14:01,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {176406#true} call ULTIMATE.init(); {176406#true} is VALID [2022-04-08 06:14:01,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {176406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176414#(<= ~counter~0 0)} {176406#true} #102#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {176414#(<= ~counter~0 0)} call #t~ret9 := main(); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {176414#(<= ~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; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,122 INFO L272 TraceCheckUtils]: 6: Hoare triple {176414#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {176414#(<= ~counter~0 0)} ~cond := #in~cond; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {176414#(<= ~counter~0 0)} assume !(0 == ~cond); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,123 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176414#(<= ~counter~0 0)} {176414#(<= ~counter~0 0)} #90#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,124 INFO L272 TraceCheckUtils]: 11: Hoare triple {176414#(<= ~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)); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {176414#(<= ~counter~0 0)} ~cond := #in~cond; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {176414#(<= ~counter~0 0)} assume !(0 == ~cond); {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,125 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176414#(<= ~counter~0 0)} {176414#(<= ~counter~0 0)} #92#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {176414#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {176414#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:01,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {176414#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:01,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {176463#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:01,130 INFO L272 TraceCheckUtils]: 19: Hoare triple {176463#(<= ~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)); {176463#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:01,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {176463#(<= ~counter~0 1)} ~cond := #in~cond; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:01,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {176463#(<= ~counter~0 1)} assume !(0 == ~cond); {176463#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:01,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {176463#(<= ~counter~0 1)} assume true; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:01,132 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176463#(<= ~counter~0 1)} {176463#(<= ~counter~0 1)} #94#return; {176463#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:01,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {176463#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176463#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:01,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {176463#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:01,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {176488#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:01,135 INFO L272 TraceCheckUtils]: 27: Hoare triple {176488#(<= ~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)); {176488#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:01,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {176488#(<= ~counter~0 2)} ~cond := #in~cond; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:01,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {176488#(<= ~counter~0 2)} assume !(0 == ~cond); {176488#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:01,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {176488#(<= ~counter~0 2)} assume true; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:01,136 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176488#(<= ~counter~0 2)} {176488#(<= ~counter~0 2)} #96#return; {176488#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:01,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {176488#(<= ~counter~0 2)} assume !(~r~0 > 0); {176488#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:01,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {176488#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:01,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {176513#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:01,139 INFO L272 TraceCheckUtils]: 35: Hoare triple {176513#(<= ~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)); {176513#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:01,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {176513#(<= ~counter~0 3)} ~cond := #in~cond; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:01,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {176513#(<= ~counter~0 3)} assume !(0 == ~cond); {176513#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:01,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {176513#(<= ~counter~0 3)} assume true; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:01,141 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176513#(<= ~counter~0 3)} {176513#(<= ~counter~0 3)} #98#return; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:01,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {176513#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176513#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:01,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {176513#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:01,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {176538#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:01,144 INFO L272 TraceCheckUtils]: 43: Hoare triple {176538#(<= ~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)); {176538#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:01,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {176538#(<= ~counter~0 4)} ~cond := #in~cond; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:01,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {176538#(<= ~counter~0 4)} assume !(0 == ~cond); {176538#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:01,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {176538#(<= ~counter~0 4)} assume true; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:01,146 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176538#(<= ~counter~0 4)} {176538#(<= ~counter~0 4)} #98#return; {176538#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:01,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {176538#(<= ~counter~0 4)} assume !(~r~0 < 0); {176538#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:01,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {176538#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:01,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {176563#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:01,149 INFO L272 TraceCheckUtils]: 51: Hoare triple {176563#(<= ~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)); {176563#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:01,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {176563#(<= ~counter~0 5)} ~cond := #in~cond; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:01,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {176563#(<= ~counter~0 5)} assume !(0 == ~cond); {176563#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:01,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {176563#(<= ~counter~0 5)} assume true; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:01,150 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176563#(<= ~counter~0 5)} {176563#(<= ~counter~0 5)} #94#return; {176563#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:01,150 INFO L290 TraceCheckUtils]: 56: Hoare triple {176563#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176563#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:01,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {176563#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:01,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {176588#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:01,152 INFO L272 TraceCheckUtils]: 59: Hoare triple {176588#(<= ~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)); {176588#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:01,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {176588#(<= ~counter~0 6)} ~cond := #in~cond; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:01,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {176588#(<= ~counter~0 6)} assume !(0 == ~cond); {176588#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:01,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {176588#(<= ~counter~0 6)} assume true; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:01,154 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176588#(<= ~counter~0 6)} {176588#(<= ~counter~0 6)} #96#return; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:01,154 INFO L290 TraceCheckUtils]: 64: Hoare triple {176588#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176588#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:01,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {176588#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:01,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {176613#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:01,156 INFO L272 TraceCheckUtils]: 67: Hoare triple {176613#(<= ~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)); {176613#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:01,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {176613#(<= ~counter~0 7)} ~cond := #in~cond; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:01,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {176613#(<= ~counter~0 7)} assume !(0 == ~cond); {176613#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:01,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {176613#(<= ~counter~0 7)} assume true; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:01,158 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176613#(<= ~counter~0 7)} {176613#(<= ~counter~0 7)} #96#return; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:01,158 INFO L290 TraceCheckUtils]: 72: Hoare triple {176613#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176613#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:01,159 INFO L290 TraceCheckUtils]: 73: Hoare triple {176613#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:01,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {176638#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:01,160 INFO L272 TraceCheckUtils]: 75: Hoare triple {176638#(<= ~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)); {176638#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:01,160 INFO L290 TraceCheckUtils]: 76: Hoare triple {176638#(<= ~counter~0 8)} ~cond := #in~cond; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:01,161 INFO L290 TraceCheckUtils]: 77: Hoare triple {176638#(<= ~counter~0 8)} assume !(0 == ~cond); {176638#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:01,161 INFO L290 TraceCheckUtils]: 78: Hoare triple {176638#(<= ~counter~0 8)} assume true; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:01,162 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176638#(<= ~counter~0 8)} {176638#(<= ~counter~0 8)} #96#return; {176638#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:01,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {176638#(<= ~counter~0 8)} assume !(~r~0 > 0); {176638#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:01,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {176638#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:01,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {176663#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:01,164 INFO L272 TraceCheckUtils]: 83: Hoare triple {176663#(<= ~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)); {176663#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:01,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {176663#(<= ~counter~0 9)} ~cond := #in~cond; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:01,165 INFO L290 TraceCheckUtils]: 85: Hoare triple {176663#(<= ~counter~0 9)} assume !(0 == ~cond); {176663#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:01,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {176663#(<= ~counter~0 9)} assume true; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:01,165 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176663#(<= ~counter~0 9)} {176663#(<= ~counter~0 9)} #98#return; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:01,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {176663#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176663#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:01,167 INFO L290 TraceCheckUtils]: 89: Hoare triple {176663#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:01,168 INFO L290 TraceCheckUtils]: 90: Hoare triple {176688#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:01,168 INFO L272 TraceCheckUtils]: 91: Hoare triple {176688#(<= ~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)); {176688#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:01,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {176688#(<= ~counter~0 10)} ~cond := #in~cond; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:01,169 INFO L290 TraceCheckUtils]: 93: Hoare triple {176688#(<= ~counter~0 10)} assume !(0 == ~cond); {176688#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:01,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {176688#(<= ~counter~0 10)} assume true; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:01,169 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176688#(<= ~counter~0 10)} {176688#(<= ~counter~0 10)} #98#return; {176688#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:01,170 INFO L290 TraceCheckUtils]: 96: Hoare triple {176688#(<= ~counter~0 10)} assume !(~r~0 < 0); {176688#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:01,172 INFO L290 TraceCheckUtils]: 97: Hoare triple {176688#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:01,172 INFO L290 TraceCheckUtils]: 98: Hoare triple {176713#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:01,173 INFO L272 TraceCheckUtils]: 99: Hoare triple {176713#(<= ~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)); {176713#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:01,173 INFO L290 TraceCheckUtils]: 100: Hoare triple {176713#(<= ~counter~0 11)} ~cond := #in~cond; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:01,173 INFO L290 TraceCheckUtils]: 101: Hoare triple {176713#(<= ~counter~0 11)} assume !(0 == ~cond); {176713#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:01,173 INFO L290 TraceCheckUtils]: 102: Hoare triple {176713#(<= ~counter~0 11)} assume true; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:01,174 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176713#(<= ~counter~0 11)} {176713#(<= ~counter~0 11)} #94#return; {176713#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:01,174 INFO L290 TraceCheckUtils]: 104: Hoare triple {176713#(<= ~counter~0 11)} assume !!(0 != ~r~0); {176713#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:01,176 INFO L290 TraceCheckUtils]: 105: Hoare triple {176713#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:01,177 INFO L290 TraceCheckUtils]: 106: Hoare triple {176738#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:01,177 INFO L272 TraceCheckUtils]: 107: Hoare triple {176738#(<= ~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)); {176738#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:01,178 INFO L290 TraceCheckUtils]: 108: Hoare triple {176738#(<= ~counter~0 12)} ~cond := #in~cond; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:01,178 INFO L290 TraceCheckUtils]: 109: Hoare triple {176738#(<= ~counter~0 12)} assume !(0 == ~cond); {176738#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:01,178 INFO L290 TraceCheckUtils]: 110: Hoare triple {176738#(<= ~counter~0 12)} assume true; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:01,179 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176738#(<= ~counter~0 12)} {176738#(<= ~counter~0 12)} #96#return; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:01,179 INFO L290 TraceCheckUtils]: 112: Hoare triple {176738#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176738#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:01,181 INFO L290 TraceCheckUtils]: 113: Hoare triple {176738#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:01,181 INFO L290 TraceCheckUtils]: 114: Hoare triple {176763#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:01,181 INFO L272 TraceCheckUtils]: 115: Hoare triple {176763#(<= ~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)); {176763#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:01,182 INFO L290 TraceCheckUtils]: 116: Hoare triple {176763#(<= ~counter~0 13)} ~cond := #in~cond; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:01,182 INFO L290 TraceCheckUtils]: 117: Hoare triple {176763#(<= ~counter~0 13)} assume !(0 == ~cond); {176763#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:01,182 INFO L290 TraceCheckUtils]: 118: Hoare triple {176763#(<= ~counter~0 13)} assume true; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:01,183 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176763#(<= ~counter~0 13)} {176763#(<= ~counter~0 13)} #96#return; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:01,183 INFO L290 TraceCheckUtils]: 120: Hoare triple {176763#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176763#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:01,185 INFO L290 TraceCheckUtils]: 121: Hoare triple {176763#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:01,185 INFO L290 TraceCheckUtils]: 122: Hoare triple {176788#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:01,186 INFO L272 TraceCheckUtils]: 123: Hoare triple {176788#(<= ~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)); {176788#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:01,186 INFO L290 TraceCheckUtils]: 124: Hoare triple {176788#(<= ~counter~0 14)} ~cond := #in~cond; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:01,187 INFO L290 TraceCheckUtils]: 125: Hoare triple {176788#(<= ~counter~0 14)} assume !(0 == ~cond); {176788#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:01,187 INFO L290 TraceCheckUtils]: 126: Hoare triple {176788#(<= ~counter~0 14)} assume true; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:01,187 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176788#(<= ~counter~0 14)} {176788#(<= ~counter~0 14)} #96#return; {176788#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:01,188 INFO L290 TraceCheckUtils]: 128: Hoare triple {176788#(<= ~counter~0 14)} assume !(~r~0 > 0); {176788#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:01,189 INFO L290 TraceCheckUtils]: 129: Hoare triple {176788#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:01,190 INFO L290 TraceCheckUtils]: 130: Hoare triple {176813#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:01,190 INFO L272 TraceCheckUtils]: 131: Hoare triple {176813#(<= ~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)); {176813#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:01,191 INFO L290 TraceCheckUtils]: 132: Hoare triple {176813#(<= ~counter~0 15)} ~cond := #in~cond; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:01,191 INFO L290 TraceCheckUtils]: 133: Hoare triple {176813#(<= ~counter~0 15)} assume !(0 == ~cond); {176813#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:01,191 INFO L290 TraceCheckUtils]: 134: Hoare triple {176813#(<= ~counter~0 15)} assume true; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:01,192 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176813#(<= ~counter~0 15)} {176813#(<= ~counter~0 15)} #98#return; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:01,192 INFO L290 TraceCheckUtils]: 136: Hoare triple {176813#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176813#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:01,194 INFO L290 TraceCheckUtils]: 137: Hoare triple {176813#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:01,194 INFO L290 TraceCheckUtils]: 138: Hoare triple {176838#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:01,195 INFO L272 TraceCheckUtils]: 139: Hoare triple {176838#(<= ~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)); {176838#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:01,195 INFO L290 TraceCheckUtils]: 140: Hoare triple {176838#(<= ~counter~0 16)} ~cond := #in~cond; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:01,195 INFO L290 TraceCheckUtils]: 141: Hoare triple {176838#(<= ~counter~0 16)} assume !(0 == ~cond); {176838#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:01,196 INFO L290 TraceCheckUtils]: 142: Hoare triple {176838#(<= ~counter~0 16)} assume true; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:01,196 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176838#(<= ~counter~0 16)} {176838#(<= ~counter~0 16)} #98#return; {176838#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:01,196 INFO L290 TraceCheckUtils]: 144: Hoare triple {176838#(<= ~counter~0 16)} assume !(~r~0 < 0); {176838#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:01,198 INFO L290 TraceCheckUtils]: 145: Hoare triple {176838#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:01,198 INFO L290 TraceCheckUtils]: 146: Hoare triple {176863#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:01,199 INFO L272 TraceCheckUtils]: 147: Hoare triple {176863#(<= ~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)); {176863#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:01,199 INFO L290 TraceCheckUtils]: 148: Hoare triple {176863#(<= ~counter~0 17)} ~cond := #in~cond; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:01,199 INFO L290 TraceCheckUtils]: 149: Hoare triple {176863#(<= ~counter~0 17)} assume !(0 == ~cond); {176863#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:01,200 INFO L290 TraceCheckUtils]: 150: Hoare triple {176863#(<= ~counter~0 17)} assume true; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:01,200 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176863#(<= ~counter~0 17)} {176863#(<= ~counter~0 17)} #94#return; {176863#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:01,200 INFO L290 TraceCheckUtils]: 152: Hoare triple {176863#(<= ~counter~0 17)} assume !!(0 != ~r~0); {176863#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:01,201 INFO L290 TraceCheckUtils]: 153: Hoare triple {176863#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176888#(<= |main_#t~post7| 17)} is VALID [2022-04-08 06:14:01,201 INFO L290 TraceCheckUtils]: 154: Hoare triple {176888#(<= |main_#t~post7| 17)} assume !(#t~post7 < 50);havoc #t~post7; {176407#false} is VALID [2022-04-08 06:14:01,201 INFO L290 TraceCheckUtils]: 155: Hoare triple {176407#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176407#false} is VALID [2022-04-08 06:14:01,201 INFO L290 TraceCheckUtils]: 156: Hoare triple {176407#false} assume !(#t~post8 < 50);havoc #t~post8; {176407#false} is VALID [2022-04-08 06:14:01,201 INFO L290 TraceCheckUtils]: 157: Hoare triple {176407#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176407#false} is VALID [2022-04-08 06:14:01,201 INFO L290 TraceCheckUtils]: 158: Hoare triple {176407#false} assume !(#t~post6 < 50);havoc #t~post6; {176407#false} is VALID [2022-04-08 06:14:01,201 INFO L272 TraceCheckUtils]: 159: Hoare triple {176407#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)); {176407#false} is VALID [2022-04-08 06:14:01,202 INFO L290 TraceCheckUtils]: 160: Hoare triple {176407#false} ~cond := #in~cond; {176407#false} is VALID [2022-04-08 06:14:01,202 INFO L290 TraceCheckUtils]: 161: Hoare triple {176407#false} assume 0 == ~cond; {176407#false} is VALID [2022-04-08 06:14:01,202 INFO L290 TraceCheckUtils]: 162: Hoare triple {176407#false} assume !false; {176407#false} is VALID [2022-04-08 06:14:01,202 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-08 06:14:01,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:14:02,334 INFO L290 TraceCheckUtils]: 162: Hoare triple {176407#false} assume !false; {176407#false} is VALID [2022-04-08 06:14:02,334 INFO L290 TraceCheckUtils]: 161: Hoare triple {176407#false} assume 0 == ~cond; {176407#false} is VALID [2022-04-08 06:14:02,334 INFO L290 TraceCheckUtils]: 160: Hoare triple {176407#false} ~cond := #in~cond; {176407#false} is VALID [2022-04-08 06:14:02,334 INFO L272 TraceCheckUtils]: 159: Hoare triple {176407#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)); {176407#false} is VALID [2022-04-08 06:14:02,334 INFO L290 TraceCheckUtils]: 158: Hoare triple {176407#false} assume !(#t~post6 < 50);havoc #t~post6; {176407#false} is VALID [2022-04-08 06:14:02,335 INFO L290 TraceCheckUtils]: 157: Hoare triple {176407#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176407#false} is VALID [2022-04-08 06:14:02,335 INFO L290 TraceCheckUtils]: 156: Hoare triple {176407#false} assume !(#t~post8 < 50);havoc #t~post8; {176407#false} is VALID [2022-04-08 06:14:02,335 INFO L290 TraceCheckUtils]: 155: Hoare triple {176407#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176407#false} is VALID [2022-04-08 06:14:02,335 INFO L290 TraceCheckUtils]: 154: Hoare triple {176940#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {176407#false} is VALID [2022-04-08 06:14:02,335 INFO L290 TraceCheckUtils]: 153: Hoare triple {176944#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176940#(< |main_#t~post7| 50)} is VALID [2022-04-08 06:14:02,336 INFO L290 TraceCheckUtils]: 152: Hoare triple {176944#(< ~counter~0 50)} assume !!(0 != ~r~0); {176944#(< ~counter~0 50)} is VALID [2022-04-08 06:14:02,336 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176406#true} {176944#(< ~counter~0 50)} #94#return; {176944#(< ~counter~0 50)} is VALID [2022-04-08 06:14:02,336 INFO L290 TraceCheckUtils]: 150: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,336 INFO L290 TraceCheckUtils]: 149: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,336 INFO L290 TraceCheckUtils]: 148: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,336 INFO L272 TraceCheckUtils]: 147: Hoare triple {176944#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,337 INFO L290 TraceCheckUtils]: 146: Hoare triple {176944#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {176944#(< ~counter~0 50)} is VALID [2022-04-08 06:14:02,341 INFO L290 TraceCheckUtils]: 145: Hoare triple {176969#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176944#(< ~counter~0 50)} is VALID [2022-04-08 06:14:02,341 INFO L290 TraceCheckUtils]: 144: Hoare triple {176969#(< ~counter~0 49)} assume !(~r~0 < 0); {176969#(< ~counter~0 49)} is VALID [2022-04-08 06:14:02,342 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176406#true} {176969#(< ~counter~0 49)} #98#return; {176969#(< ~counter~0 49)} is VALID [2022-04-08 06:14:02,342 INFO L290 TraceCheckUtils]: 142: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,342 INFO L290 TraceCheckUtils]: 141: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,342 INFO L290 TraceCheckUtils]: 140: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,342 INFO L272 TraceCheckUtils]: 139: Hoare triple {176969#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,342 INFO L290 TraceCheckUtils]: 138: Hoare triple {176969#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {176969#(< ~counter~0 49)} is VALID [2022-04-08 06:14:02,345 INFO L290 TraceCheckUtils]: 137: Hoare triple {176994#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176969#(< ~counter~0 49)} is VALID [2022-04-08 06:14:02,345 INFO L290 TraceCheckUtils]: 136: Hoare triple {176994#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176994#(< ~counter~0 48)} is VALID [2022-04-08 06:14:02,346 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176406#true} {176994#(< ~counter~0 48)} #98#return; {176994#(< ~counter~0 48)} is VALID [2022-04-08 06:14:02,346 INFO L290 TraceCheckUtils]: 134: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,346 INFO L290 TraceCheckUtils]: 133: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,346 INFO L290 TraceCheckUtils]: 132: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,346 INFO L272 TraceCheckUtils]: 131: Hoare triple {176994#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,346 INFO L290 TraceCheckUtils]: 130: Hoare triple {176994#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {176994#(< ~counter~0 48)} is VALID [2022-04-08 06:14:02,349 INFO L290 TraceCheckUtils]: 129: Hoare triple {177019#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176994#(< ~counter~0 48)} is VALID [2022-04-08 06:14:02,349 INFO L290 TraceCheckUtils]: 128: Hoare triple {177019#(< ~counter~0 47)} assume !(~r~0 > 0); {177019#(< ~counter~0 47)} is VALID [2022-04-08 06:14:02,350 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176406#true} {177019#(< ~counter~0 47)} #96#return; {177019#(< ~counter~0 47)} is VALID [2022-04-08 06:14:02,350 INFO L290 TraceCheckUtils]: 126: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,350 INFO L290 TraceCheckUtils]: 125: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,350 INFO L290 TraceCheckUtils]: 124: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,350 INFO L272 TraceCheckUtils]: 123: Hoare triple {177019#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,350 INFO L290 TraceCheckUtils]: 122: Hoare triple {177019#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {177019#(< ~counter~0 47)} is VALID [2022-04-08 06:14:02,352 INFO L290 TraceCheckUtils]: 121: Hoare triple {177044#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177019#(< ~counter~0 47)} is VALID [2022-04-08 06:14:02,353 INFO L290 TraceCheckUtils]: 120: Hoare triple {177044#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177044#(< ~counter~0 46)} is VALID [2022-04-08 06:14:02,353 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176406#true} {177044#(< ~counter~0 46)} #96#return; {177044#(< ~counter~0 46)} is VALID [2022-04-08 06:14:02,353 INFO L290 TraceCheckUtils]: 118: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,354 INFO L290 TraceCheckUtils]: 117: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,354 INFO L290 TraceCheckUtils]: 116: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,354 INFO L272 TraceCheckUtils]: 115: Hoare triple {177044#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,354 INFO L290 TraceCheckUtils]: 114: Hoare triple {177044#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {177044#(< ~counter~0 46)} is VALID [2022-04-08 06:14:02,356 INFO L290 TraceCheckUtils]: 113: Hoare triple {177069#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177044#(< ~counter~0 46)} is VALID [2022-04-08 06:14:02,357 INFO L290 TraceCheckUtils]: 112: Hoare triple {177069#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177069#(< ~counter~0 45)} is VALID [2022-04-08 06:14:02,357 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176406#true} {177069#(< ~counter~0 45)} #96#return; {177069#(< ~counter~0 45)} is VALID [2022-04-08 06:14:02,357 INFO L290 TraceCheckUtils]: 110: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,357 INFO L290 TraceCheckUtils]: 109: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,357 INFO L290 TraceCheckUtils]: 108: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,357 INFO L272 TraceCheckUtils]: 107: Hoare triple {177069#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,358 INFO L290 TraceCheckUtils]: 106: Hoare triple {177069#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {177069#(< ~counter~0 45)} is VALID [2022-04-08 06:14:02,360 INFO L290 TraceCheckUtils]: 105: Hoare triple {177094#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177069#(< ~counter~0 45)} is VALID [2022-04-08 06:14:02,360 INFO L290 TraceCheckUtils]: 104: Hoare triple {177094#(< ~counter~0 44)} assume !!(0 != ~r~0); {177094#(< ~counter~0 44)} is VALID [2022-04-08 06:14:02,361 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176406#true} {177094#(< ~counter~0 44)} #94#return; {177094#(< ~counter~0 44)} is VALID [2022-04-08 06:14:02,361 INFO L290 TraceCheckUtils]: 102: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,361 INFO L290 TraceCheckUtils]: 101: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,361 INFO L290 TraceCheckUtils]: 100: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,361 INFO L272 TraceCheckUtils]: 99: Hoare triple {177094#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,361 INFO L290 TraceCheckUtils]: 98: Hoare triple {177094#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {177094#(< ~counter~0 44)} is VALID [2022-04-08 06:14:02,364 INFO L290 TraceCheckUtils]: 97: Hoare triple {177119#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177094#(< ~counter~0 44)} is VALID [2022-04-08 06:14:02,365 INFO L290 TraceCheckUtils]: 96: Hoare triple {177119#(< ~counter~0 43)} assume !(~r~0 < 0); {177119#(< ~counter~0 43)} is VALID [2022-04-08 06:14:02,365 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176406#true} {177119#(< ~counter~0 43)} #98#return; {177119#(< ~counter~0 43)} is VALID [2022-04-08 06:14:02,366 INFO L290 TraceCheckUtils]: 94: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,366 INFO L290 TraceCheckUtils]: 93: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,366 INFO L290 TraceCheckUtils]: 92: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,366 INFO L272 TraceCheckUtils]: 91: Hoare triple {177119#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {177119#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {177119#(< ~counter~0 43)} is VALID [2022-04-08 06:14:02,370 INFO L290 TraceCheckUtils]: 89: Hoare triple {177144#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177119#(< ~counter~0 43)} is VALID [2022-04-08 06:14:02,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {177144#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177144#(< ~counter~0 42)} is VALID [2022-04-08 06:14:02,371 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176406#true} {177144#(< ~counter~0 42)} #98#return; {177144#(< ~counter~0 42)} is VALID [2022-04-08 06:14:02,371 INFO L290 TraceCheckUtils]: 86: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,371 INFO L290 TraceCheckUtils]: 85: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,371 INFO L290 TraceCheckUtils]: 84: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,371 INFO L272 TraceCheckUtils]: 83: Hoare triple {177144#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,372 INFO L290 TraceCheckUtils]: 82: Hoare triple {177144#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {177144#(< ~counter~0 42)} is VALID [2022-04-08 06:14:02,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {177169#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177144#(< ~counter~0 42)} is VALID [2022-04-08 06:14:02,374 INFO L290 TraceCheckUtils]: 80: Hoare triple {177169#(< ~counter~0 41)} assume !(~r~0 > 0); {177169#(< ~counter~0 41)} is VALID [2022-04-08 06:14:02,375 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176406#true} {177169#(< ~counter~0 41)} #96#return; {177169#(< ~counter~0 41)} is VALID [2022-04-08 06:14:02,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,375 INFO L290 TraceCheckUtils]: 77: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,375 INFO L290 TraceCheckUtils]: 76: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,375 INFO L272 TraceCheckUtils]: 75: Hoare triple {177169#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {177169#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {177169#(< ~counter~0 41)} is VALID [2022-04-08 06:14:02,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {177194#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177169#(< ~counter~0 41)} is VALID [2022-04-08 06:14:02,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {177194#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177194#(< ~counter~0 40)} is VALID [2022-04-08 06:14:02,378 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176406#true} {177194#(< ~counter~0 40)} #96#return; {177194#(< ~counter~0 40)} is VALID [2022-04-08 06:14:02,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,379 INFO L272 TraceCheckUtils]: 67: Hoare triple {177194#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {177194#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {177194#(< ~counter~0 40)} is VALID [2022-04-08 06:14:02,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {177219#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177194#(< ~counter~0 40)} is VALID [2022-04-08 06:14:02,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {177219#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177219#(< ~counter~0 39)} is VALID [2022-04-08 06:14:02,382 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176406#true} {177219#(< ~counter~0 39)} #96#return; {177219#(< ~counter~0 39)} is VALID [2022-04-08 06:14:02,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,382 INFO L272 TraceCheckUtils]: 59: Hoare triple {177219#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {177219#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {177219#(< ~counter~0 39)} is VALID [2022-04-08 06:14:02,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {177244#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177219#(< ~counter~0 39)} is VALID [2022-04-08 06:14:02,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {177244#(< ~counter~0 38)} assume !!(0 != ~r~0); {177244#(< ~counter~0 38)} is VALID [2022-04-08 06:14:02,386 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176406#true} {177244#(< ~counter~0 38)} #94#return; {177244#(< ~counter~0 38)} is VALID [2022-04-08 06:14:02,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,386 INFO L272 TraceCheckUtils]: 51: Hoare triple {177244#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {177244#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {177244#(< ~counter~0 38)} is VALID [2022-04-08 06:14:02,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {177269#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177244#(< ~counter~0 38)} is VALID [2022-04-08 06:14:02,389 INFO L290 TraceCheckUtils]: 48: Hoare triple {177269#(< ~counter~0 37)} assume !(~r~0 < 0); {177269#(< ~counter~0 37)} is VALID [2022-04-08 06:14:02,389 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176406#true} {177269#(< ~counter~0 37)} #98#return; {177269#(< ~counter~0 37)} is VALID [2022-04-08 06:14:02,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,390 INFO L272 TraceCheckUtils]: 43: Hoare triple {177269#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {177269#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {177269#(< ~counter~0 37)} is VALID [2022-04-08 06:14:02,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {177294#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177269#(< ~counter~0 37)} is VALID [2022-04-08 06:14:02,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {177294#(< ~counter~0 36)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177294#(< ~counter~0 36)} is VALID [2022-04-08 06:14:02,392 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176406#true} {177294#(< ~counter~0 36)} #98#return; {177294#(< ~counter~0 36)} is VALID [2022-04-08 06:14:02,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,393 INFO L272 TraceCheckUtils]: 35: Hoare triple {177294#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {177294#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {177294#(< ~counter~0 36)} is VALID [2022-04-08 06:14:02,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {177319#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177294#(< ~counter~0 36)} is VALID [2022-04-08 06:14:02,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {177319#(< ~counter~0 35)} assume !(~r~0 > 0); {177319#(< ~counter~0 35)} is VALID [2022-04-08 06:14:02,396 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176406#true} {177319#(< ~counter~0 35)} #96#return; {177319#(< ~counter~0 35)} is VALID [2022-04-08 06:14:02,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,397 INFO L272 TraceCheckUtils]: 27: Hoare triple {177319#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {177319#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {177319#(< ~counter~0 35)} is VALID [2022-04-08 06:14:02,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {177344#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177319#(< ~counter~0 35)} is VALID [2022-04-08 06:14:02,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {177344#(< ~counter~0 34)} assume !!(0 != ~r~0); {177344#(< ~counter~0 34)} is VALID [2022-04-08 06:14:02,402 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176406#true} {177344#(< ~counter~0 34)} #94#return; {177344#(< ~counter~0 34)} is VALID [2022-04-08 06:14:02,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,403 INFO L272 TraceCheckUtils]: 19: Hoare triple {177344#(< ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {177344#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {177344#(< ~counter~0 34)} is VALID [2022-04-08 06:14:02,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {177369#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177344#(< ~counter~0 34)} is VALID [2022-04-08 06:14:02,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {177369#(< ~counter~0 33)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {177369#(< ~counter~0 33)} is VALID [2022-04-08 06:14:02,406 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176406#true} {177369#(< ~counter~0 33)} #92#return; {177369#(< ~counter~0 33)} is VALID [2022-04-08 06:14:02,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {177369#(< ~counter~0 33)} 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)); {176406#true} is VALID [2022-04-08 06:14:02,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176406#true} {177369#(< ~counter~0 33)} #90#return; {177369#(< ~counter~0 33)} is VALID [2022-04-08 06:14:02,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-08 06:14:02,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-08 06:14:02,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-08 06:14:02,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {177369#(< ~counter~0 33)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176406#true} is VALID [2022-04-08 06:14:02,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {177369#(< ~counter~0 33)} 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; {177369#(< ~counter~0 33)} is VALID [2022-04-08 06:14:02,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {177369#(< ~counter~0 33)} call #t~ret9 := main(); {177369#(< ~counter~0 33)} is VALID [2022-04-08 06:14:02,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177369#(< ~counter~0 33)} {176406#true} #102#return; {177369#(< ~counter~0 33)} is VALID [2022-04-08 06:14:02,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {177369#(< ~counter~0 33)} assume true; {177369#(< ~counter~0 33)} is VALID [2022-04-08 06:14:02,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {176406#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {177369#(< ~counter~0 33)} is VALID [2022-04-08 06:14:02,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {176406#true} call ULTIMATE.init(); {176406#true} is VALID [2022-04-08 06:14:02,409 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-08 06:14:02,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:14:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940610959] [2022-04-08 06:14:02,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:14:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200234792] [2022-04-08 06:14:02,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200234792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:14:02,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:14:02,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 06:14:02,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:14:02,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [279378969] [2022-04-08 06:14:02,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [279378969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:14:02,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:14:02,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 06:14:02,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853044135] [2022-04-08 06:14:02,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:14:02,411 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-08 06:14:02,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:14:02,411 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-08 06:14:02,775 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-08 06:14:02,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 06:14:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:14:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 06:14:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 06:14:02,776 INFO L87 Difference]: Start difference. First operand 890 states and 1187 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-08 06:14:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:09,438 INFO L93 Difference]: Finished difference Result 1077 states and 1465 transitions. [2022-04-08 06:14:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 06:14:09,439 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-08 06:14:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:14:09,439 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-08 06:14:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-08 06:14:09,442 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-08 06:14:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-08 06:14:09,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 376 transitions. [2022-04-08 06:14:10,017 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-08 06:14:10,051 INFO L225 Difference]: With dead ends: 1077 [2022-04-08 06:14:10,052 INFO L226 Difference]: Without dead ends: 907 [2022-04-08 06:14:10,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1316, Invalid=1764, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 06:14:10,052 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 277 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:14:10,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 385 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 06:14:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-08 06:14:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2022-04-08 06:14:13,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:14:13,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:14:13,775 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:14:13,776 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:14:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:13,802 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-08 06:14:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 06:14:13,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:14:13,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:14:13,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-08 06:14:13,804 INFO L87 Difference]: Start difference. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-08 06:14:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:13,830 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-08 06:14:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 06:14:13,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:14:13,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:14:13,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:14:13,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:14:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:14:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1204 transitions. [2022-04-08 06:14:13,868 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1204 transitions. Word has length 163 [2022-04-08 06:14:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:14:13,868 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1204 transitions. [2022-04-08 06:14:13,868 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-08 06:14:13,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1204 transitions. [2022-04-08 06:14:27,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1204 edges. 1203 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 06:14:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-08 06:14:27,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:14:27,056 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-08 06:14:27,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-08 06:14:27,256 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-08 06:14:27,257 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:14:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:14:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 19 times [2022-04-08 06:14:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:14:27,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094252987] [2022-04-08 06:14:27,257 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:14:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 20 times [2022-04-08 06:14:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:14:27,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713469121] [2022-04-08 06:14:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:14:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:14:27,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:14:27,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708620298] [2022-04-08 06:14:27,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:14:27,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:14:27,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:14:27,275 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-08 06:14:27,315 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-08 06:14:27,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:14:27,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:14:27,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 06:14:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:14:27,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:14:28,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {183237#true} call ULTIMATE.init(); {183237#true} is VALID [2022-04-08 06:14:28,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {183237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183245#(<= ~counter~0 0)} {183237#true} #102#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {183245#(<= ~counter~0 0)} call #t~ret9 := main(); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {183245#(<= ~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; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {183245#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {183245#(<= ~counter~0 0)} ~cond := #in~cond; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {183245#(<= ~counter~0 0)} assume !(0 == ~cond); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183245#(<= ~counter~0 0)} {183245#(<= ~counter~0 0)} #90#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,423 INFO L272 TraceCheckUtils]: 11: Hoare triple {183245#(<= ~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)); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {183245#(<= ~counter~0 0)} ~cond := #in~cond; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {183245#(<= ~counter~0 0)} assume !(0 == ~cond); {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,425 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183245#(<= ~counter~0 0)} {183245#(<= ~counter~0 0)} #92#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {183245#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {183245#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:28,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {183245#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:28,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {183294#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:28,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {183294#(<= ~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)); {183294#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:28,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {183294#(<= ~counter~0 1)} ~cond := #in~cond; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:28,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {183294#(<= ~counter~0 1)} assume !(0 == ~cond); {183294#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:28,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {183294#(<= ~counter~0 1)} assume true; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:28,431 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183294#(<= ~counter~0 1)} {183294#(<= ~counter~0 1)} #94#return; {183294#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:28,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {183294#(<= ~counter~0 1)} assume !!(0 != ~r~0); {183294#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:28,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {183294#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:28,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {183319#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:28,434 INFO L272 TraceCheckUtils]: 27: Hoare triple {183319#(<= ~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)); {183319#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:28,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {183319#(<= ~counter~0 2)} ~cond := #in~cond; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:28,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {183319#(<= ~counter~0 2)} assume !(0 == ~cond); {183319#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:28,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {183319#(<= ~counter~0 2)} assume true; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:28,435 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183319#(<= ~counter~0 2)} {183319#(<= ~counter~0 2)} #96#return; {183319#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:28,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {183319#(<= ~counter~0 2)} assume !(~r~0 > 0); {183319#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:28,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {183319#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:28,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {183344#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:28,438 INFO L272 TraceCheckUtils]: 35: Hoare triple {183344#(<= ~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)); {183344#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:28,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {183344#(<= ~counter~0 3)} ~cond := #in~cond; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:28,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {183344#(<= ~counter~0 3)} assume !(0 == ~cond); {183344#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:28,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {183344#(<= ~counter~0 3)} assume true; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:28,439 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183344#(<= ~counter~0 3)} {183344#(<= ~counter~0 3)} #98#return; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:28,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {183344#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183344#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:28,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {183344#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:28,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {183369#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:28,445 INFO L272 TraceCheckUtils]: 43: Hoare triple {183369#(<= ~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)); {183369#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:28,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {183369#(<= ~counter~0 4)} ~cond := #in~cond; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:28,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {183369#(<= ~counter~0 4)} assume !(0 == ~cond); {183369#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:28,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {183369#(<= ~counter~0 4)} assume true; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:28,446 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183369#(<= ~counter~0 4)} {183369#(<= ~counter~0 4)} #98#return; {183369#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:28,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {183369#(<= ~counter~0 4)} assume !(~r~0 < 0); {183369#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:28,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {183369#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:28,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {183394#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:28,449 INFO L272 TraceCheckUtils]: 51: Hoare triple {183394#(<= ~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)); {183394#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:28,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {183394#(<= ~counter~0 5)} ~cond := #in~cond; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:28,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {183394#(<= ~counter~0 5)} assume !(0 == ~cond); {183394#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:28,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {183394#(<= ~counter~0 5)} assume true; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:28,451 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183394#(<= ~counter~0 5)} {183394#(<= ~counter~0 5)} #94#return; {183394#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:28,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {183394#(<= ~counter~0 5)} assume !!(0 != ~r~0); {183394#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:28,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {183394#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:28,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {183419#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:28,455 INFO L272 TraceCheckUtils]: 59: Hoare triple {183419#(<= ~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)); {183419#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:28,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {183419#(<= ~counter~0 6)} ~cond := #in~cond; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:28,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {183419#(<= ~counter~0 6)} assume !(0 == ~cond); {183419#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:28,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {183419#(<= ~counter~0 6)} assume true; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:28,456 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183419#(<= ~counter~0 6)} {183419#(<= ~counter~0 6)} #96#return; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:28,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {183419#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183419#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:28,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {183419#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:28,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {183444#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:28,459 INFO L272 TraceCheckUtils]: 67: Hoare triple {183444#(<= ~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)); {183444#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:28,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {183444#(<= ~counter~0 7)} ~cond := #in~cond; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:28,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {183444#(<= ~counter~0 7)} assume !(0 == ~cond); {183444#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:28,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {183444#(<= ~counter~0 7)} assume true; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:28,461 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183444#(<= ~counter~0 7)} {183444#(<= ~counter~0 7)} #96#return; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:28,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {183444#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183444#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:28,463 INFO L290 TraceCheckUtils]: 73: Hoare triple {183444#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:28,463 INFO L290 TraceCheckUtils]: 74: Hoare triple {183469#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:28,464 INFO L272 TraceCheckUtils]: 75: Hoare triple {183469#(<= ~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)); {183469#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:28,464 INFO L290 TraceCheckUtils]: 76: Hoare triple {183469#(<= ~counter~0 8)} ~cond := #in~cond; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:28,464 INFO L290 TraceCheckUtils]: 77: Hoare triple {183469#(<= ~counter~0 8)} assume !(0 == ~cond); {183469#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:28,465 INFO L290 TraceCheckUtils]: 78: Hoare triple {183469#(<= ~counter~0 8)} assume true; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:28,465 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183469#(<= ~counter~0 8)} {183469#(<= ~counter~0 8)} #96#return; {183469#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:28,465 INFO L290 TraceCheckUtils]: 80: Hoare triple {183469#(<= ~counter~0 8)} assume !(~r~0 > 0); {183469#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:28,468 INFO L290 TraceCheckUtils]: 81: Hoare triple {183469#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:28,468 INFO L290 TraceCheckUtils]: 82: Hoare triple {183494#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:28,468 INFO L272 TraceCheckUtils]: 83: Hoare triple {183494#(<= ~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)); {183494#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:28,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {183494#(<= ~counter~0 9)} ~cond := #in~cond; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:28,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {183494#(<= ~counter~0 9)} assume !(0 == ~cond); {183494#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:28,469 INFO L290 TraceCheckUtils]: 86: Hoare triple {183494#(<= ~counter~0 9)} assume true; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:28,470 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183494#(<= ~counter~0 9)} {183494#(<= ~counter~0 9)} #98#return; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:28,470 INFO L290 TraceCheckUtils]: 88: Hoare triple {183494#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183494#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:28,472 INFO L290 TraceCheckUtils]: 89: Hoare triple {183494#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:28,473 INFO L290 TraceCheckUtils]: 90: Hoare triple {183519#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:28,473 INFO L272 TraceCheckUtils]: 91: Hoare triple {183519#(<= ~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)); {183519#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:28,473 INFO L290 TraceCheckUtils]: 92: Hoare triple {183519#(<= ~counter~0 10)} ~cond := #in~cond; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:28,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {183519#(<= ~counter~0 10)} assume !(0 == ~cond); {183519#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:28,474 INFO L290 TraceCheckUtils]: 94: Hoare triple {183519#(<= ~counter~0 10)} assume true; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:28,474 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183519#(<= ~counter~0 10)} {183519#(<= ~counter~0 10)} #98#return; {183519#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:28,475 INFO L290 TraceCheckUtils]: 96: Hoare triple {183519#(<= ~counter~0 10)} assume !(~r~0 < 0); {183519#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:28,477 INFO L290 TraceCheckUtils]: 97: Hoare triple {183519#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:28,477 INFO L290 TraceCheckUtils]: 98: Hoare triple {183544#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:28,477 INFO L272 TraceCheckUtils]: 99: Hoare triple {183544#(<= ~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)); {183544#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:28,478 INFO L290 TraceCheckUtils]: 100: Hoare triple {183544#(<= ~counter~0 11)} ~cond := #in~cond; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:28,478 INFO L290 TraceCheckUtils]: 101: Hoare triple {183544#(<= ~counter~0 11)} assume !(0 == ~cond); {183544#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:28,478 INFO L290 TraceCheckUtils]: 102: Hoare triple {183544#(<= ~counter~0 11)} assume true; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:28,479 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183544#(<= ~counter~0 11)} {183544#(<= ~counter~0 11)} #94#return; {183544#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:28,479 INFO L290 TraceCheckUtils]: 104: Hoare triple {183544#(<= ~counter~0 11)} assume !!(0 != ~r~0); {183544#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:28,481 INFO L290 TraceCheckUtils]: 105: Hoare triple {183544#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:28,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {183569#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:28,481 INFO L272 TraceCheckUtils]: 107: Hoare triple {183569#(<= ~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)); {183569#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:28,482 INFO L290 TraceCheckUtils]: 108: Hoare triple {183569#(<= ~counter~0 12)} ~cond := #in~cond; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:28,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {183569#(<= ~counter~0 12)} assume !(0 == ~cond); {183569#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:28,482 INFO L290 TraceCheckUtils]: 110: Hoare triple {183569#(<= ~counter~0 12)} assume true; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:28,483 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183569#(<= ~counter~0 12)} {183569#(<= ~counter~0 12)} #96#return; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:28,483 INFO L290 TraceCheckUtils]: 112: Hoare triple {183569#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183569#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:28,485 INFO L290 TraceCheckUtils]: 113: Hoare triple {183569#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:28,485 INFO L290 TraceCheckUtils]: 114: Hoare triple {183594#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:28,485 INFO L272 TraceCheckUtils]: 115: Hoare triple {183594#(<= ~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)); {183594#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:28,486 INFO L290 TraceCheckUtils]: 116: Hoare triple {183594#(<= ~counter~0 13)} ~cond := #in~cond; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:28,486 INFO L290 TraceCheckUtils]: 117: Hoare triple {183594#(<= ~counter~0 13)} assume !(0 == ~cond); {183594#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:28,486 INFO L290 TraceCheckUtils]: 118: Hoare triple {183594#(<= ~counter~0 13)} assume true; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:28,487 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183594#(<= ~counter~0 13)} {183594#(<= ~counter~0 13)} #96#return; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:28,487 INFO L290 TraceCheckUtils]: 120: Hoare triple {183594#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183594#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:28,489 INFO L290 TraceCheckUtils]: 121: Hoare triple {183594#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:28,489 INFO L290 TraceCheckUtils]: 122: Hoare triple {183619#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:28,490 INFO L272 TraceCheckUtils]: 123: Hoare triple {183619#(<= ~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)); {183619#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:28,490 INFO L290 TraceCheckUtils]: 124: Hoare triple {183619#(<= ~counter~0 14)} ~cond := #in~cond; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:28,490 INFO L290 TraceCheckUtils]: 125: Hoare triple {183619#(<= ~counter~0 14)} assume !(0 == ~cond); {183619#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:28,491 INFO L290 TraceCheckUtils]: 126: Hoare triple {183619#(<= ~counter~0 14)} assume true; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:28,491 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183619#(<= ~counter~0 14)} {183619#(<= ~counter~0 14)} #96#return; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:28,491 INFO L290 TraceCheckUtils]: 128: Hoare triple {183619#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183619#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:28,493 INFO L290 TraceCheckUtils]: 129: Hoare triple {183619#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:28,494 INFO L290 TraceCheckUtils]: 130: Hoare triple {183644#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:28,494 INFO L272 TraceCheckUtils]: 131: Hoare triple {183644#(<= ~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)); {183644#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:28,494 INFO L290 TraceCheckUtils]: 132: Hoare triple {183644#(<= ~counter~0 15)} ~cond := #in~cond; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:28,495 INFO L290 TraceCheckUtils]: 133: Hoare triple {183644#(<= ~counter~0 15)} assume !(0 == ~cond); {183644#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:28,495 INFO L290 TraceCheckUtils]: 134: Hoare triple {183644#(<= ~counter~0 15)} assume true; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:28,495 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183644#(<= ~counter~0 15)} {183644#(<= ~counter~0 15)} #96#return; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:28,496 INFO L290 TraceCheckUtils]: 136: Hoare triple {183644#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183644#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:28,497 INFO L290 TraceCheckUtils]: 137: Hoare triple {183644#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:28,498 INFO L290 TraceCheckUtils]: 138: Hoare triple {183669#(<= ~counter~0 16)} assume !!(#t~post7 < 50);havoc #t~post7; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:28,498 INFO L272 TraceCheckUtils]: 139: Hoare triple {183669#(<= ~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)); {183669#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:28,498 INFO L290 TraceCheckUtils]: 140: Hoare triple {183669#(<= ~counter~0 16)} ~cond := #in~cond; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:28,499 INFO L290 TraceCheckUtils]: 141: Hoare triple {183669#(<= ~counter~0 16)} assume !(0 == ~cond); {183669#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:28,499 INFO L290 TraceCheckUtils]: 142: Hoare triple {183669#(<= ~counter~0 16)} assume true; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:28,499 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183669#(<= ~counter~0 16)} {183669#(<= ~counter~0 16)} #96#return; {183669#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:28,500 INFO L290 TraceCheckUtils]: 144: Hoare triple {183669#(<= ~counter~0 16)} assume !(~r~0 > 0); {183669#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:28,502 INFO L290 TraceCheckUtils]: 145: Hoare triple {183669#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:28,503 INFO L290 TraceCheckUtils]: 146: Hoare triple {183694#(<= ~counter~0 17)} assume !!(#t~post8 < 50);havoc #t~post8; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:28,503 INFO L272 TraceCheckUtils]: 147: Hoare triple {183694#(<= ~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)); {183694#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:28,503 INFO L290 TraceCheckUtils]: 148: Hoare triple {183694#(<= ~counter~0 17)} ~cond := #in~cond; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:28,504 INFO L290 TraceCheckUtils]: 149: Hoare triple {183694#(<= ~counter~0 17)} assume !(0 == ~cond); {183694#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:28,504 INFO L290 TraceCheckUtils]: 150: Hoare triple {183694#(<= ~counter~0 17)} assume true; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:28,504 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183694#(<= ~counter~0 17)} {183694#(<= ~counter~0 17)} #98#return; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:28,505 INFO L290 TraceCheckUtils]: 152: Hoare triple {183694#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183694#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:28,507 INFO L290 TraceCheckUtils]: 153: Hoare triple {183694#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:28,508 INFO L290 TraceCheckUtils]: 154: Hoare triple {183719#(<= ~counter~0 18)} assume !!(#t~post8 < 50);havoc #t~post8; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:28,508 INFO L272 TraceCheckUtils]: 155: Hoare triple {183719#(<= ~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)); {183719#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:28,508 INFO L290 TraceCheckUtils]: 156: Hoare triple {183719#(<= ~counter~0 18)} ~cond := #in~cond; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:28,509 INFO L290 TraceCheckUtils]: 157: Hoare triple {183719#(<= ~counter~0 18)} assume !(0 == ~cond); {183719#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:28,509 INFO L290 TraceCheckUtils]: 158: Hoare triple {183719#(<= ~counter~0 18)} assume true; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:28,509 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183719#(<= ~counter~0 18)} {183719#(<= ~counter~0 18)} #98#return; {183719#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:28,510 INFO L290 TraceCheckUtils]: 160: Hoare triple {183719#(<= ~counter~0 18)} assume !(~r~0 < 0); {183719#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:28,510 INFO L290 TraceCheckUtils]: 161: Hoare triple {183719#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183744#(<= |main_#t~post6| 18)} is VALID [2022-04-08 06:14:28,510 INFO L290 TraceCheckUtils]: 162: Hoare triple {183744#(<= |main_#t~post6| 18)} assume !(#t~post6 < 50);havoc #t~post6; {183238#false} is VALID [2022-04-08 06:14:28,511 INFO L272 TraceCheckUtils]: 163: Hoare triple {183238#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)); {183238#false} is VALID [2022-04-08 06:14:28,511 INFO L290 TraceCheckUtils]: 164: Hoare triple {183238#false} ~cond := #in~cond; {183238#false} is VALID [2022-04-08 06:14:28,511 INFO L290 TraceCheckUtils]: 165: Hoare triple {183238#false} assume 0 == ~cond; {183238#false} is VALID [2022-04-08 06:14:28,511 INFO L290 TraceCheckUtils]: 166: Hoare triple {183238#false} assume !false; {183238#false} is VALID [2022-04-08 06:14:28,511 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-08 06:14:28,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:14:29,705 INFO L290 TraceCheckUtils]: 166: Hoare triple {183238#false} assume !false; {183238#false} is VALID [2022-04-08 06:14:29,705 INFO L290 TraceCheckUtils]: 165: Hoare triple {183238#false} assume 0 == ~cond; {183238#false} is VALID [2022-04-08 06:14:29,706 INFO L290 TraceCheckUtils]: 164: Hoare triple {183238#false} ~cond := #in~cond; {183238#false} is VALID [2022-04-08 06:14:29,706 INFO L272 TraceCheckUtils]: 163: Hoare triple {183238#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)); {183238#false} is VALID [2022-04-08 06:14:29,706 INFO L290 TraceCheckUtils]: 162: Hoare triple {183772#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {183238#false} is VALID [2022-04-08 06:14:29,706 INFO L290 TraceCheckUtils]: 161: Hoare triple {183776#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183772#(< |main_#t~post6| 50)} is VALID [2022-04-08 06:14:29,707 INFO L290 TraceCheckUtils]: 160: Hoare triple {183776#(< ~counter~0 50)} assume !(~r~0 < 0); {183776#(< ~counter~0 50)} is VALID [2022-04-08 06:14:29,707 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183237#true} {183776#(< ~counter~0 50)} #98#return; {183776#(< ~counter~0 50)} is VALID [2022-04-08 06:14:29,707 INFO L290 TraceCheckUtils]: 158: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,707 INFO L290 TraceCheckUtils]: 157: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,707 INFO L290 TraceCheckUtils]: 156: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,707 INFO L272 TraceCheckUtils]: 155: Hoare triple {183776#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,708 INFO L290 TraceCheckUtils]: 154: Hoare triple {183776#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {183776#(< ~counter~0 50)} is VALID [2022-04-08 06:14:29,715 INFO L290 TraceCheckUtils]: 153: Hoare triple {183801#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183776#(< ~counter~0 50)} is VALID [2022-04-08 06:14:29,715 INFO L290 TraceCheckUtils]: 152: Hoare triple {183801#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183801#(< ~counter~0 49)} is VALID [2022-04-08 06:14:29,716 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183237#true} {183801#(< ~counter~0 49)} #98#return; {183801#(< ~counter~0 49)} is VALID [2022-04-08 06:14:29,716 INFO L290 TraceCheckUtils]: 150: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,716 INFO L290 TraceCheckUtils]: 149: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,716 INFO L290 TraceCheckUtils]: 148: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,716 INFO L272 TraceCheckUtils]: 147: Hoare triple {183801#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,716 INFO L290 TraceCheckUtils]: 146: Hoare triple {183801#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {183801#(< ~counter~0 49)} is VALID [2022-04-08 06:14:29,718 INFO L290 TraceCheckUtils]: 145: Hoare triple {183826#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183801#(< ~counter~0 49)} is VALID [2022-04-08 06:14:29,719 INFO L290 TraceCheckUtils]: 144: Hoare triple {183826#(< ~counter~0 48)} assume !(~r~0 > 0); {183826#(< ~counter~0 48)} is VALID [2022-04-08 06:14:29,719 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183237#true} {183826#(< ~counter~0 48)} #96#return; {183826#(< ~counter~0 48)} is VALID [2022-04-08 06:14:29,719 INFO L290 TraceCheckUtils]: 142: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,719 INFO L290 TraceCheckUtils]: 141: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,719 INFO L290 TraceCheckUtils]: 140: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,719 INFO L272 TraceCheckUtils]: 139: Hoare triple {183826#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,720 INFO L290 TraceCheckUtils]: 138: Hoare triple {183826#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {183826#(< ~counter~0 48)} is VALID [2022-04-08 06:14:29,721 INFO L290 TraceCheckUtils]: 137: Hoare triple {183851#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183826#(< ~counter~0 48)} is VALID [2022-04-08 06:14:29,722 INFO L290 TraceCheckUtils]: 136: Hoare triple {183851#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183851#(< ~counter~0 47)} is VALID [2022-04-08 06:14:29,722 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183237#true} {183851#(< ~counter~0 47)} #96#return; {183851#(< ~counter~0 47)} is VALID [2022-04-08 06:14:29,722 INFO L290 TraceCheckUtils]: 134: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,722 INFO L290 TraceCheckUtils]: 133: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,723 INFO L290 TraceCheckUtils]: 132: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,723 INFO L272 TraceCheckUtils]: 131: Hoare triple {183851#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,723 INFO L290 TraceCheckUtils]: 130: Hoare triple {183851#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {183851#(< ~counter~0 47)} is VALID [2022-04-08 06:14:29,725 INFO L290 TraceCheckUtils]: 129: Hoare triple {183876#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183851#(< ~counter~0 47)} is VALID [2022-04-08 06:14:29,725 INFO L290 TraceCheckUtils]: 128: Hoare triple {183876#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183876#(< ~counter~0 46)} is VALID [2022-04-08 06:14:29,726 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183237#true} {183876#(< ~counter~0 46)} #96#return; {183876#(< ~counter~0 46)} is VALID [2022-04-08 06:14:29,726 INFO L290 TraceCheckUtils]: 126: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,726 INFO L290 TraceCheckUtils]: 125: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,726 INFO L290 TraceCheckUtils]: 124: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,726 INFO L272 TraceCheckUtils]: 123: Hoare triple {183876#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,726 INFO L290 TraceCheckUtils]: 122: Hoare triple {183876#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {183876#(< ~counter~0 46)} is VALID [2022-04-08 06:14:29,728 INFO L290 TraceCheckUtils]: 121: Hoare triple {183901#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183876#(< ~counter~0 46)} is VALID [2022-04-08 06:14:29,729 INFO L290 TraceCheckUtils]: 120: Hoare triple {183901#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183901#(< ~counter~0 45)} is VALID [2022-04-08 06:14:29,729 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183237#true} {183901#(< ~counter~0 45)} #96#return; {183901#(< ~counter~0 45)} is VALID [2022-04-08 06:14:29,729 INFO L290 TraceCheckUtils]: 118: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,729 INFO L290 TraceCheckUtils]: 117: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,729 INFO L290 TraceCheckUtils]: 116: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,729 INFO L272 TraceCheckUtils]: 115: Hoare triple {183901#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,730 INFO L290 TraceCheckUtils]: 114: Hoare triple {183901#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {183901#(< ~counter~0 45)} is VALID [2022-04-08 06:14:29,731 INFO L290 TraceCheckUtils]: 113: Hoare triple {183926#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183901#(< ~counter~0 45)} is VALID [2022-04-08 06:14:29,732 INFO L290 TraceCheckUtils]: 112: Hoare triple {183926#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183926#(< ~counter~0 44)} is VALID [2022-04-08 06:14:29,732 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183237#true} {183926#(< ~counter~0 44)} #96#return; {183926#(< ~counter~0 44)} is VALID [2022-04-08 06:14:29,732 INFO L290 TraceCheckUtils]: 110: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,733 INFO L290 TraceCheckUtils]: 109: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,733 INFO L290 TraceCheckUtils]: 108: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,733 INFO L272 TraceCheckUtils]: 107: Hoare triple {183926#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,733 INFO L290 TraceCheckUtils]: 106: Hoare triple {183926#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {183926#(< ~counter~0 44)} is VALID [2022-04-08 06:14:29,735 INFO L290 TraceCheckUtils]: 105: Hoare triple {183951#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183926#(< ~counter~0 44)} is VALID [2022-04-08 06:14:29,735 INFO L290 TraceCheckUtils]: 104: Hoare triple {183951#(< ~counter~0 43)} assume !!(0 != ~r~0); {183951#(< ~counter~0 43)} is VALID [2022-04-08 06:14:29,736 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183237#true} {183951#(< ~counter~0 43)} #94#return; {183951#(< ~counter~0 43)} is VALID [2022-04-08 06:14:29,736 INFO L290 TraceCheckUtils]: 102: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,736 INFO L290 TraceCheckUtils]: 101: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,736 INFO L290 TraceCheckUtils]: 100: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,736 INFO L272 TraceCheckUtils]: 99: Hoare triple {183951#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,737 INFO L290 TraceCheckUtils]: 98: Hoare triple {183951#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {183951#(< ~counter~0 43)} is VALID [2022-04-08 06:14:29,739 INFO L290 TraceCheckUtils]: 97: Hoare triple {183976#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183951#(< ~counter~0 43)} is VALID [2022-04-08 06:14:29,739 INFO L290 TraceCheckUtils]: 96: Hoare triple {183976#(< ~counter~0 42)} assume !(~r~0 < 0); {183976#(< ~counter~0 42)} is VALID [2022-04-08 06:14:29,739 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183237#true} {183976#(< ~counter~0 42)} #98#return; {183976#(< ~counter~0 42)} is VALID [2022-04-08 06:14:29,739 INFO L290 TraceCheckUtils]: 94: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,740 INFO L290 TraceCheckUtils]: 93: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,740 INFO L290 TraceCheckUtils]: 92: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,740 INFO L272 TraceCheckUtils]: 91: Hoare triple {183976#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,740 INFO L290 TraceCheckUtils]: 90: Hoare triple {183976#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {183976#(< ~counter~0 42)} is VALID [2022-04-08 06:14:29,742 INFO L290 TraceCheckUtils]: 89: Hoare triple {184001#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183976#(< ~counter~0 42)} is VALID [2022-04-08 06:14:29,742 INFO L290 TraceCheckUtils]: 88: Hoare triple {184001#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184001#(< ~counter~0 41)} is VALID [2022-04-08 06:14:29,742 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183237#true} {184001#(< ~counter~0 41)} #98#return; {184001#(< ~counter~0 41)} is VALID [2022-04-08 06:14:29,742 INFO L290 TraceCheckUtils]: 86: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,743 INFO L290 TraceCheckUtils]: 85: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,743 INFO L290 TraceCheckUtils]: 84: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,743 INFO L272 TraceCheckUtils]: 83: Hoare triple {184001#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,743 INFO L290 TraceCheckUtils]: 82: Hoare triple {184001#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {184001#(< ~counter~0 41)} is VALID [2022-04-08 06:14:29,745 INFO L290 TraceCheckUtils]: 81: Hoare triple {184026#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184001#(< ~counter~0 41)} is VALID [2022-04-08 06:14:29,745 INFO L290 TraceCheckUtils]: 80: Hoare triple {184026#(< ~counter~0 40)} assume !(~r~0 > 0); {184026#(< ~counter~0 40)} is VALID [2022-04-08 06:14:29,746 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183237#true} {184026#(< ~counter~0 40)} #96#return; {184026#(< ~counter~0 40)} is VALID [2022-04-08 06:14:29,746 INFO L290 TraceCheckUtils]: 78: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,746 INFO L290 TraceCheckUtils]: 77: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,746 INFO L290 TraceCheckUtils]: 76: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,746 INFO L272 TraceCheckUtils]: 75: Hoare triple {184026#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,746 INFO L290 TraceCheckUtils]: 74: Hoare triple {184026#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {184026#(< ~counter~0 40)} is VALID [2022-04-08 06:14:29,748 INFO L290 TraceCheckUtils]: 73: Hoare triple {184051#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184026#(< ~counter~0 40)} is VALID [2022-04-08 06:14:29,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {184051#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184051#(< ~counter~0 39)} is VALID [2022-04-08 06:14:29,749 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183237#true} {184051#(< ~counter~0 39)} #96#return; {184051#(< ~counter~0 39)} is VALID [2022-04-08 06:14:29,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,749 INFO L290 TraceCheckUtils]: 69: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,750 INFO L272 TraceCheckUtils]: 67: Hoare triple {184051#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {184051#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {184051#(< ~counter~0 39)} is VALID [2022-04-08 06:14:29,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {184076#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184051#(< ~counter~0 39)} is VALID [2022-04-08 06:14:29,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {184076#(< ~counter~0 38)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184076#(< ~counter~0 38)} is VALID [2022-04-08 06:14:29,752 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183237#true} {184076#(< ~counter~0 38)} #96#return; {184076#(< ~counter~0 38)} is VALID [2022-04-08 06:14:29,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,753 INFO L272 TraceCheckUtils]: 59: Hoare triple {184076#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {184076#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {184076#(< ~counter~0 38)} is VALID [2022-04-08 06:14:29,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {184101#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184076#(< ~counter~0 38)} is VALID [2022-04-08 06:14:29,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {184101#(< ~counter~0 37)} assume !!(0 != ~r~0); {184101#(< ~counter~0 37)} is VALID [2022-04-08 06:14:29,756 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183237#true} {184101#(< ~counter~0 37)} #94#return; {184101#(< ~counter~0 37)} is VALID [2022-04-08 06:14:29,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,756 INFO L272 TraceCheckUtils]: 51: Hoare triple {184101#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,756 INFO L290 TraceCheckUtils]: 50: Hoare triple {184101#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {184101#(< ~counter~0 37)} is VALID [2022-04-08 06:14:29,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {184126#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184101#(< ~counter~0 37)} is VALID [2022-04-08 06:14:29,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {184126#(< ~counter~0 36)} assume !(~r~0 < 0); {184126#(< ~counter~0 36)} is VALID [2022-04-08 06:14:29,763 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183237#true} {184126#(< ~counter~0 36)} #98#return; {184126#(< ~counter~0 36)} is VALID [2022-04-08 06:14:29,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,763 INFO L272 TraceCheckUtils]: 43: Hoare triple {184126#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {184126#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {184126#(< ~counter~0 36)} is VALID [2022-04-08 06:14:29,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {184151#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184126#(< ~counter~0 36)} is VALID [2022-04-08 06:14:29,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {184151#(< ~counter~0 35)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184151#(< ~counter~0 35)} is VALID [2022-04-08 06:14:29,774 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183237#true} {184151#(< ~counter~0 35)} #98#return; {184151#(< ~counter~0 35)} is VALID [2022-04-08 06:14:29,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,774 INFO L272 TraceCheckUtils]: 35: Hoare triple {184151#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {184151#(< ~counter~0 35)} assume !!(#t~post8 < 50);havoc #t~post8; {184151#(< ~counter~0 35)} is VALID [2022-04-08 06:14:29,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {184176#(< ~counter~0 34)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184151#(< ~counter~0 35)} is VALID [2022-04-08 06:14:29,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {184176#(< ~counter~0 34)} assume !(~r~0 > 0); {184176#(< ~counter~0 34)} is VALID [2022-04-08 06:14:29,780 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183237#true} {184176#(< ~counter~0 34)} #96#return; {184176#(< ~counter~0 34)} is VALID [2022-04-08 06:14:29,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,780 INFO L272 TraceCheckUtils]: 27: Hoare triple {184176#(< ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {184176#(< ~counter~0 34)} assume !!(#t~post7 < 50);havoc #t~post7; {184176#(< ~counter~0 34)} is VALID [2022-04-08 06:14:29,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {184201#(< ~counter~0 33)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184176#(< ~counter~0 34)} is VALID [2022-04-08 06:14:29,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {184201#(< ~counter~0 33)} assume !!(0 != ~r~0); {184201#(< ~counter~0 33)} is VALID [2022-04-08 06:14:29,783 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183237#true} {184201#(< ~counter~0 33)} #94#return; {184201#(< ~counter~0 33)} is VALID [2022-04-08 06:14:29,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,784 INFO L272 TraceCheckUtils]: 19: Hoare triple {184201#(< ~counter~0 33)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {184201#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {184201#(< ~counter~0 33)} is VALID [2022-04-08 06:14:29,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {184226#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184201#(< ~counter~0 33)} is VALID [2022-04-08 06:14:29,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {184226#(< ~counter~0 32)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {184226#(< ~counter~0 32)} is VALID [2022-04-08 06:14:29,786 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183237#true} {184226#(< ~counter~0 32)} #92#return; {184226#(< ~counter~0 32)} is VALID [2022-04-08 06:14:29,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,787 INFO L272 TraceCheckUtils]: 11: Hoare triple {184226#(< ~counter~0 32)} 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)); {183237#true} is VALID [2022-04-08 06:14:29,787 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183237#true} {184226#(< ~counter~0 32)} #90#return; {184226#(< ~counter~0 32)} is VALID [2022-04-08 06:14:29,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-08 06:14:29,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-08 06:14:29,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-08 06:14:29,787 INFO L272 TraceCheckUtils]: 6: Hoare triple {184226#(< ~counter~0 32)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183237#true} is VALID [2022-04-08 06:14:29,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {184226#(< ~counter~0 32)} 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; {184226#(< ~counter~0 32)} is VALID [2022-04-08 06:14:29,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {184226#(< ~counter~0 32)} call #t~ret9 := main(); {184226#(< ~counter~0 32)} is VALID [2022-04-08 06:14:29,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184226#(< ~counter~0 32)} {183237#true} #102#return; {184226#(< ~counter~0 32)} is VALID [2022-04-08 06:14:29,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {184226#(< ~counter~0 32)} assume true; {184226#(< ~counter~0 32)} is VALID [2022-04-08 06:14:29,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {183237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {184226#(< ~counter~0 32)} is VALID [2022-04-08 06:14:29,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {183237#true} call ULTIMATE.init(); {183237#true} is VALID [2022-04-08 06:14:29,789 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-08 06:14:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:14:29,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713469121] [2022-04-08 06:14:29,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:14:29,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708620298] [2022-04-08 06:14:29,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708620298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:14:29,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:14:29,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-08 06:14:29,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:14:29,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094252987] [2022-04-08 06:14:29,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094252987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:14:29,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:14:29,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 06:14:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103965851] [2022-04-08 06:14:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:14:29,791 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-08 06:14:29,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:14:29,791 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-08 06:14:30,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:30,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 06:14:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:14:30,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 06:14:30,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 06:14:30,073 INFO L87 Difference]: Start difference. First operand 907 states and 1204 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-08 06:14:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:37,268 INFO L93 Difference]: Finished difference Result 958 states and 1274 transitions. [2022-04-08 06:14:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 06:14:37,269 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-08 06:14:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:14:37,269 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-08 06:14:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-08 06:14:37,272 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-08 06:14:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-08 06:14:37,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 374 transitions. [2022-04-08 06:14:37,861 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-08 06:14:37,901 INFO L225 Difference]: With dead ends: 958 [2022-04-08 06:14:37,901 INFO L226 Difference]: Without dead ends: 953 [2022-04-08 06:14:37,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1358, Invalid=1834, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 06:14:37,902 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 269 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:14:37,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 413 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 06:14:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-04-08 06:14:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 931. [2022-04-08 06:14:41,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:14:41,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:14:41,696 INFO L74 IsIncluded]: Start isIncluded. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:14:41,697 INFO L87 Difference]: Start difference. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:14:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:41,725 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-08 06:14:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-08 06:14:41,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:14:41,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:14:41,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-08 06:14:41,727 INFO L87 Difference]: Start difference. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-08 06:14:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:41,758 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-08 06:14:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-08 06:14:41,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:14:41,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:14:41,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:14:41,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:14:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:14:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1242 transitions. [2022-04-08 06:14:41,797 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1242 transitions. Word has length 167 [2022-04-08 06:14:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:14:41,797 INFO L478 AbstractCegarLoop]: Abstraction has 931 states and 1242 transitions. [2022-04-08 06:14:41,797 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-08 06:14:41,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 931 states and 1242 transitions. [2022-04-08 06:14:57,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1242 edges. 1240 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1242 transitions. [2022-04-08 06:14:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-08 06:14:57,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:14:57,235 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-08 06:14:57,252 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-08 06:14:57,435 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-08 06:14:57,435 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:14:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:14:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 31 times [2022-04-08 06:14:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:14:57,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [246389470] [2022-04-08 06:14:57,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:14:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 32 times [2022-04-08 06:14:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:14:57,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630815636] [2022-04-08 06:14:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:14:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:14:57,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:14:57,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031352511] [2022-04-08 06:14:57,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:14:57,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:14:57,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:14:57,453 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-08 06:14:57,453 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-08 06:14:57,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:14:57,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:14:57,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 06:14:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:14:57,562 INFO L286 TraceCheckSpWp]: Computing forward predicates...