/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:37:31,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:37:31,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:37:31,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:37:31,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:37:31,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:37:31,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:37:31,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:37:31,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:37:31,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:37:31,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:37:31,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:37:31,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:37:31,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:37:31,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:37:31,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:37:31,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:37:31,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:37:31,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:37:31,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:37:31,464 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:37:31,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:37:31,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:37:31,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:37:31,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:37:31,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:37:31,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:37:31,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:37:31,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:37:31,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:37:31,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:37:31,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:37:31,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:37:31,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:37:31,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:37:31,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:37:31,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:37:31,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:37:31,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:37:31,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:37:31,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:37:31,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:37:31,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:37:31,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:37:31,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:37:31,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:37:31,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:37:31,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:37:31,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:37:31,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:37:31,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:37:31,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:37:31,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:37:31,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:37:31,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:37:31,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:37:31,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:37:31,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:37:31,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:37:31,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:37:31,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:37:31,493 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:37:31,493 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:37:31,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:37:31,493 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:37:31,493 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 12:37:31,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:37:31,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:37:31,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:37:31,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:37:31,710 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:37:31,711 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-28 12:37:31,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c79ab3d/07ec0d2ed8284dceb19ad6987d8d9452/FLAGf81ca1895 [2022-04-28 12:37:32,087 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:37:32,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-28 12:37:32,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c79ab3d/07ec0d2ed8284dceb19ad6987d8d9452/FLAGf81ca1895 [2022-04-28 12:37:32,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c79ab3d/07ec0d2ed8284dceb19ad6987d8d9452 [2022-04-28 12:37:32,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:37:32,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:37:32,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:37:32,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:37:32,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:37:32,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619cbcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32, skipping insertion in model container [2022-04-28 12:37:32,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:37:32,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:37:32,676 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-28 12:37:32,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:37:32,707 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:37:32,713 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-28 12:37:32,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:37:32,729 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:37:32,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32 WrapperNode [2022-04-28 12:37:32,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:37:32,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:37:32,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:37:32,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:37:32,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:37:32,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:37:32,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:37:32,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:37:32,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (1/1) ... [2022-04-28 12:37:32,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:37:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:32,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 12:37:32,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:37:32,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:37:32,829 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:37:32,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:37:32,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:37:32,829 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:37:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:37:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:37:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:37:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:37:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:37:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:37:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:37:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:37:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:37:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:37:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:37:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:37:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:37:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:37:32,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 12:37:32,872 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:37:32,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:37:33,089 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:37:33,093 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:37:33,093 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 12:37:33,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:37:33 BoogieIcfgContainer [2022-04-28 12:37:33,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:37:33,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:37:33,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:37:33,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:37:33,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:37:32" (1/3) ... [2022-04-28 12:37:33,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e3ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:37:33, skipping insertion in model container [2022-04-28 12:37:33,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:32" (2/3) ... [2022-04-28 12:37:33,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9e3ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:37:33, skipping insertion in model container [2022-04-28 12:37:33,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:37:33" (3/3) ... [2022-04-28 12:37:33,116 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2022-04-28 12:37:33,125 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:37:33,126 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:37:33,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:37:33,162 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@707a7ed2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53010e1a [2022-04-28 12:37:33,163 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:37:33,171 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-28 12:37:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 12:37:33,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:37:33,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:37:33,176 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:37:33,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:37:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-28 12:37:33,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:33,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [394628456] [2022-04-28 12:37:33,198 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:37:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-28 12:37:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:37:33,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820167291] [2022-04-28 12:37:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:37:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:37:33,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:37:33,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140286860] [2022-04-28 12:37:33,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:37:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:37:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:33,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:37:33,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 12:37:33,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:37:33,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:37:33,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 12:37:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:37:33,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:37:33,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-28 12:37:33,480 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-28 12:37:33,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 12:37:33,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-28 12:37:33,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-28 12:37:33,482 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-28 12:37:33,482 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-28 12:37:33,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 12:37:33,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-28 12:37:33,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 12:37:33,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-28 12:37:33,483 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-28 12:37:33,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 12:37:33,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 12:37:33,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 12:37:33,484 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-28 12:37:33,485 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-28 12:37:33,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 12:37:33,485 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-28 12:37:33,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 12:37:33,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 12:37:33,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 12:37:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 12:37:33,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:37:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:37:33,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820167291] [2022-04-28 12:37:33,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:37:33,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140286860] [2022-04-28 12:37:33,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140286860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:33,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:33,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:37:33,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:37:33,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [394628456] [2022-04-28 12:37:33,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [394628456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:33,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:33,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:37:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431951058] [2022-04-28 12:37:33,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:37:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 12:37:33,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:37:33,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:33,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:37:33,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 12:37:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:33,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 12:37:33,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 12:37:33,546 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-28 12:37:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:33,624 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-28 12:37:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 12:37:33,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 12:37:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:37:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 12:37:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 12:37:33,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-28 12:37:33,741 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-28 12:37:33,752 INFO L225 Difference]: With dead ends: 67 [2022-04-28 12:37:33,752 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 12:37:33,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 12:37:33,758 INFO L413 NwaCegarLoop]: 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-28 12:37:33,759 INFO L414 NwaCegarLoop]: 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-28 12:37:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 12:37:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 12:37:33,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:37:33,781 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-28 12:37:33,782 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-28 12:37:33,782 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-28 12:37:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:33,786 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 12:37:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 12:37:33,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:33,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:33,787 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-28 12:37:33,787 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-28 12:37:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:33,792 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 12:37:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 12:37:33,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:33,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:33,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:37:33,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:37:33,793 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-28 12:37:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 12:37:33,799 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-28 12:37:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:37:33,800 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 12:37:33,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:33,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 12:37:33,847 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-28 12:37:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 12:37:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:37:33,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:37:33,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:37:33,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 12:37:34,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 12:37:34,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:37:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:37:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-28 12:37:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:34,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1030518888] [2022-04-28 12:37:34,065 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:37:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-28 12:37:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:37:34,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677915767] [2022-04-28 12:37:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:37:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:37:34,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:37:34,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2314017] [2022-04-28 12:37:34,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:37:34,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:37:34,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:34,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:37:34,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 12:37:34,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:37:34,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:37:34,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:37:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:37:34,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:37:34,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-28 12:37:34,290 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-28 12:37:34,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,292 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-28 12:37:34,292 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-28 12:37:34,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,295 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-28 12:37:34,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,296 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:34,297 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-28 12:37:34,297 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-28 12:37:34,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {370#false} is VALID [2022-04-28 12:37:34,298 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-28 12:37:34,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-28 12:37:34,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-28 12:37:34,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-28 12:37:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:37:34,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:37:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:37:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677915767] [2022-04-28 12:37:34,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:37:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2314017] [2022-04-28 12:37:34,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2314017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:34,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:34,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:37:34,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:37:34,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1030518888] [2022-04-28 12:37:34,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1030518888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:34,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:34,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:37:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083399108] [2022-04-28 12:37:34,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:37:34,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:37:34,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:37:34,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:37:34,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:37:34,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:37:34,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:34,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:37:34,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:37:34,317 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-28 12:37:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:34,391 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 12:37:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:37:34,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:37:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:37:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:37:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 12:37:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:37:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 12:37:34,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-28 12:37:34,430 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-28 12:37:34,431 INFO L225 Difference]: With dead ends: 41 [2022-04-28 12:37:34,431 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 12:37:34,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:37:34,432 INFO L413 NwaCegarLoop]: 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-28 12:37:34,433 INFO L414 NwaCegarLoop]: 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-28 12:37:34,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 12:37:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 12:37:34,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:37:34,445 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-28 12:37:34,445 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-28 12:37:34,445 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-28 12:37:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:34,447 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 12:37:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 12:37:34,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:34,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:34,448 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-28 12:37:34,448 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-28 12:37:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:34,450 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 12:37:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 12:37:34,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:34,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:34,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:37:34,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:37:34,451 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-28 12:37:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 12:37:34,453 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-28 12:37:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:37:34,453 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 12:37:34,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:37:34,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 12:37:34,499 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-28 12:37:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 12:37:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:37:34,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:37:34,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:37:34,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 12:37:34,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 12:37:34,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:37:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:37:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-28 12:37:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:34,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [475981141] [2022-04-28 12:37:34,716 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:37:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-28 12:37:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:37:34,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634211859] [2022-04-28 12:37:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:37:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:37:34,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:37:34,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957171340] [2022-04-28 12:37:34,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:37:34,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:37:34,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:34,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:37:34,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 12:37:34,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:37:34,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:37:34,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:37:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:37:34,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:37:35,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-28 12:37:35,063 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-28 12:37:35,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 12:37:35,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-28 12:37:35,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-28 12:37:35,063 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-28 12:37:35,063 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-28 12:37:35,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 12:37:35,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 12:37:35,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 12:37:35,064 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-28 12:37:35,064 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-28 12:37:35,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 12:37:35,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 12:37:35,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 12:37:35,064 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-28 12:37:36,607 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-28 12:37:36,608 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-28 12:37:36,609 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-28 12:37:37,388 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-28 12:37:37,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:37:37,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-28 12:37:37,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-28 12:37:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:37:37,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:37:37,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:37:37,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634211859] [2022-04-28 12:37:37,390 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:37:37,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957171340] [2022-04-28 12:37:37,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957171340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:37,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:37,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:37:37,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:37:37,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [475981141] [2022-04-28 12:37:37,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [475981141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:37,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:37,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:37:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294529701] [2022-04-28 12:37:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:37:37,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 12:37:37,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:37:37,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:40,692 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-28 12:37:40,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:37:40,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:37:40,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:37:40,693 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-28 12:37:45,519 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-28 12:37:48,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:37:49,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:37:52,213 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-28 12:38:01,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:38:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:01,613 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 12:38:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:38:01,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 12:38:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:38:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 12:38:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:38:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 12:38:01,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-28 12:38:07,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:07,815 INFO L225 Difference]: With dead ends: 53 [2022-04-28 12:38:07,815 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 12:38:07,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:38:07,816 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:07,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 119 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2022-04-28 12:38:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 12:38:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 12:38:07,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:07,837 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-28 12:38:07,837 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-28 12:38:07,837 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-28 12:38:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:07,839 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 12:38:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 12:38:07,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:07,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:07,840 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-28 12:38:07,840 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-28 12:38:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:07,845 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 12:38:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 12:38:07,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:07,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:07,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:07,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:07,851 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-28 12:38:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-28 12:38:07,852 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-28 12:38:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:07,853 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-28 12:38:07,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:38:07,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-28 12:38:12,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 66 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-28 12:38:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 12:38:12,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:12,283 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:38:12,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:12,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:12,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-28 12:38:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:12,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193054898] [2022-04-28 12:38:12,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-28 12:38:12,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:12,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729152810] [2022-04-28 12:38:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:12,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:12,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987843704] [2022-04-28 12:38:12,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:12,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:12,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:12,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:12,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 12:38:12,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:12,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:12,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 12:38:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:12,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:12,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 12:38:12,691 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-28 12:38:12,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:12,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 12:38:12,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 12:38:12,691 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-28 12:38:12,691 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-28 12:38:12,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 12:38:12,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 12:38:12,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:12,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 12:38:12,692 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-28 12:38:12,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 12:38:12,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 12:38:12,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:12,692 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 12:38:12,692 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-28 12:38:12,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 12:38:12,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 50);havoc #t~post6; {1042#true} is VALID [2022-04-28 12:38:12,693 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-28 12:38:12,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:12,694 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-28 12:38:12,694 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-28 12:38:12,695 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-28 12:38:12,695 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-28 12:38:12,696 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-28 12:38:12,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:12,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 12:38:12,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 12:38:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:38:12,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:13,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 12:38:13,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 12:38:13,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:13,015 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-28 12:38:13,016 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-28 12:38:13,017 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-28 12:38:13,017 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-28 12:38:13,017 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-28 12:38:13,018 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-28 12:38:13,018 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-28 12:38:13,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 50);havoc #t~post6; {1042#true} is VALID [2022-04-28 12:38:13,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 12:38:13,018 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-28 12:38:13,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 12:38:13,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:13,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 12:38:13,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 12:38:13,019 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-28 12:38:13,019 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 12:38:13,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:13,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 12:38:13,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 12:38:13,019 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-28 12:38:13,019 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-28 12:38:13,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 12:38:13,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 12:38:13,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:13,020 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-28 12:38:13,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 12:38:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:38:13,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729152810] [2022-04-28 12:38:13,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987843704] [2022-04-28 12:38:13,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987843704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:13,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:13,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 12:38:13,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:13,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193054898] [2022-04-28 12:38:13,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193054898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:13,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:13,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:38:13,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787740982] [2022-04-28 12:38:13,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:13,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 12:38:13,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:13,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:38:13,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:13,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:38:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:13,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:38:13,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:38:13,039 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-28 12:38:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:13,420 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 12:38:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:38:13,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 12:38:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:38:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 12:38:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:38:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 12:38:13,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 12:38:13,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:13,476 INFO L225 Difference]: With dead ends: 57 [2022-04-28 12:38:13,476 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 12:38:13,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:38:13,477 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:13,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:38:13,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 12:38:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 12:38:13,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:13,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:38:13,498 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:38:13,499 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:38:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:13,506 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 12:38:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 12:38:13,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:13,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:13,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-28 12:38:13,507 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-28 12:38:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:13,509 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 12:38:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 12:38:13,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:13,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:13,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:13,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:38:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 12:38:13,512 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-28 12:38:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:13,512 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-28 12:38:13,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:38:13,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-28 12:38:17,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 64 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 12:38:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 12:38:17,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:17,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:38:17,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:17,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:17,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-28 12:38:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:17,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020289224] [2022-04-28 12:38:17,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-28 12:38:17,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:17,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679571783] [2022-04-28 12:38:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:17,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:17,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862477667] [2022-04-28 12:38:17,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:17,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:17,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:17,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:17,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 12:38:18,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:18,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:18,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:38:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:18,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:18,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {1553#true} call ULTIMATE.init(); {1553#true} is VALID [2022-04-28 12:38:18,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1561#(<= ~counter~0 0)} {1553#true} #102#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {1561#(<= ~counter~0 0)} call #t~ret9 := main(); {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1561#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {1561#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #90#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,331 INFO L272 TraceCheckUtils]: 11: Hoare triple {1561#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,332 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #92#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1561#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:18,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:18,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {1610#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:18,334 INFO L272 TraceCheckUtils]: 19: Hoare triple {1610#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1610#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:18,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {1610#(<= ~counter~0 1)} ~cond := #in~cond; {1610#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:18,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {1610#(<= ~counter~0 1)} assume !(0 == ~cond); {1610#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:18,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {1610#(<= ~counter~0 1)} assume true; {1610#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:18,336 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1610#(<= ~counter~0 1)} {1610#(<= ~counter~0 1)} #94#return; {1610#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:18,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {1610#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1610#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:18,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {1610#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1635#(<= |main_#t~post7| 1)} is VALID [2022-04-28 12:38:18,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {1635#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1554#false} is VALID [2022-04-28 12:38:18,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1554#false} is VALID [2022-04-28 12:38:18,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {1554#false} assume !(#t~post8 < 50);havoc #t~post8; {1554#false} is VALID [2022-04-28 12:38:18,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {1554#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1554#false} is VALID [2022-04-28 12:38:18,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {1554#false} assume !(#t~post6 < 50);havoc #t~post6; {1554#false} is VALID [2022-04-28 12:38:18,338 INFO L272 TraceCheckUtils]: 31: Hoare triple {1554#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1554#false} is VALID [2022-04-28 12:38:18,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {1554#false} ~cond := #in~cond; {1554#false} is VALID [2022-04-28 12:38:18,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {1554#false} assume 0 == ~cond; {1554#false} is VALID [2022-04-28 12:38:18,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {1554#false} assume !false; {1554#false} is VALID [2022-04-28 12:38:18,338 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-28 12:38:18,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:38:18,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:18,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679571783] [2022-04-28 12:38:18,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862477667] [2022-04-28 12:38:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862477667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:18,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:18,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:38:18,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020289224] [2022-04-28 12:38:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020289224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:18,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:18,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:38:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572975768] [2022-04-28 12:38:18,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:18,340 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-28 12:38:18,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:18,340 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-28 12:38:18,364 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-28 12:38:18,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:38:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:18,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:38:18,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:38:18,365 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:38:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:18,472 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-28 12:38:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:38:18,473 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-28 12:38:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:18,473 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-28 12:38:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 12:38:18,474 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-28 12:38:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 12:38:18,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-28 12:38:18,527 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-28 12:38:18,528 INFO L225 Difference]: With dead ends: 97 [2022-04-28 12:38:18,528 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 12:38:18,528 INFO L412 NwaCegarLoop]: 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-28 12:38:18,529 INFO L413 NwaCegarLoop]: 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-28 12:38:18,529 INFO L414 NwaCegarLoop]: 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-28 12:38:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 12:38:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 12:38:18,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:18,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 12:38:18,556 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 12:38:18,557 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 12:38:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:18,558 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-28 12:38:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-28 12:38:18,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:18,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:18,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-28 12:38:18,559 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-28 12:38:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:18,560 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-28 12:38:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-28 12:38:18,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:18,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:18,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:18,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 12:38:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 12:38:18,563 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-28 12:38:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:18,563 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-28 12:38:18,563 INFO L496 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-28 12:38:18,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-28 12:38:21,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-28 12:38:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 12:38:21,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:21,534 INFO L195 NwaCegarLoop]: 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-28 12:38:21,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:21,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:21,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-28 12:38:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:21,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963203695] [2022-04-28 12:38:21,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-28 12:38:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:21,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961029391] [2022-04-28 12:38:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:21,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:21,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826808455] [2022-04-28 12:38:21,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:21,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:21,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:21,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:21,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 12:38:21,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:21,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:21,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:38:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:21,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:22,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-28 12:38:22,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2104#(<= ~counter~0 0)} {2096#true} #102#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {2104#(<= ~counter~0 0)} call #t~ret9 := main(); {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,105 INFO L272 TraceCheckUtils]: 6: Hoare triple {2104#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,117 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #90#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,117 INFO L272 TraceCheckUtils]: 11: Hoare triple {2104#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,119 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #92#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2104#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {2104#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {2153#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,121 INFO L272 TraceCheckUtils]: 19: Hoare triple {2153#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2153#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {2153#(<= ~counter~0 1)} ~cond := #in~cond; {2153#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {2153#(<= ~counter~0 1)} assume !(0 == ~cond); {2153#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {2153#(<= ~counter~0 1)} assume true; {2153#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2153#(<= ~counter~0 1)} {2153#(<= ~counter~0 1)} #94#return; {2153#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2153#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {2153#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {2178#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,124 INFO L272 TraceCheckUtils]: 27: Hoare triple {2178#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2178#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {2178#(<= ~counter~0 2)} ~cond := #in~cond; {2178#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {2178#(<= ~counter~0 2)} assume !(0 == ~cond); {2178#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {2178#(<= ~counter~0 2)} assume true; {2178#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,125 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2178#(<= ~counter~0 2)} {2178#(<= ~counter~0 2)} #96#return; {2178#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {2178#(<= ~counter~0 2)} assume !(~r~0 > 0); {2178#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {2178#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2203#(<= |main_#t~post8| 2)} is VALID [2022-04-28 12:38:22,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {2203#(<= |main_#t~post8| 2)} assume !(#t~post8 < 50);havoc #t~post8; {2097#false} is VALID [2022-04-28 12:38:22,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-28 12:38:22,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 50);havoc #t~post6; {2097#false} is VALID [2022-04-28 12:38:22,127 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2097#false} is VALID [2022-04-28 12:38:22,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-28 12:38:22,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-28 12:38:22,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-28 12:38:22,127 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-28 12:38:22,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:22,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-28 12:38:22,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-28 12:38:22,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-28 12:38:22,357 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2097#false} is VALID [2022-04-28 12:38:22,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 50);havoc #t~post6; {2097#false} is VALID [2022-04-28 12:38:22,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-28 12:38:22,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {2243#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {2097#false} is VALID [2022-04-28 12:38:22,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2243#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:38:22,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {2247#(< ~counter~0 50)} assume !(~r~0 > 0); {2247#(< ~counter~0 50)} is VALID [2022-04-28 12:38:22,378 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2096#true} {2247#(< ~counter~0 50)} #96#return; {2247#(< ~counter~0 50)} is VALID [2022-04-28 12:38:22,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-28 12:38:22,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-28 12:38:22,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-28 12:38:22,379 INFO L272 TraceCheckUtils]: 27: Hoare triple {2247#(< ~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)); {2096#true} is VALID [2022-04-28 12:38:22,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {2247#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {2247#(< ~counter~0 50)} is VALID [2022-04-28 12:38:22,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {2272#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2247#(< ~counter~0 50)} is VALID [2022-04-28 12:38:22,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {2272#(< ~counter~0 49)} assume !!(0 != ~r~0); {2272#(< ~counter~0 49)} is VALID [2022-04-28 12:38:22,380 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2096#true} {2272#(< ~counter~0 49)} #94#return; {2272#(< ~counter~0 49)} is VALID [2022-04-28 12:38:22,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-28 12:38:22,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-28 12:38:22,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-28 12:38:22,380 INFO L272 TraceCheckUtils]: 19: Hoare triple {2272#(< ~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)); {2096#true} is VALID [2022-04-28 12:38:22,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {2272#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2272#(< ~counter~0 49)} is VALID [2022-04-28 12:38:22,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {2297#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2272#(< ~counter~0 49)} is VALID [2022-04-28 12:38:22,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {2297#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2297#(< ~counter~0 48)} is VALID [2022-04-28 12:38:22,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2096#true} {2297#(< ~counter~0 48)} #92#return; {2297#(< ~counter~0 48)} is VALID [2022-04-28 12:38:22,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-28 12:38:22,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-28 12:38:22,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-28 12:38:22,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {2297#(< ~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)); {2096#true} is VALID [2022-04-28 12:38:22,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2096#true} {2297#(< ~counter~0 48)} #90#return; {2297#(< ~counter~0 48)} is VALID [2022-04-28 12:38:22,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-28 12:38:22,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-28 12:38:22,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-28 12:38:22,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {2297#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2096#true} is VALID [2022-04-28 12:38:22,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {2297#(< ~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; {2297#(< ~counter~0 48)} is VALID [2022-04-28 12:38:22,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {2297#(< ~counter~0 48)} call #t~ret9 := main(); {2297#(< ~counter~0 48)} is VALID [2022-04-28 12:38:22,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2297#(< ~counter~0 48)} {2096#true} #102#return; {2297#(< ~counter~0 48)} is VALID [2022-04-28 12:38:22,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {2297#(< ~counter~0 48)} assume true; {2297#(< ~counter~0 48)} is VALID [2022-04-28 12:38:22,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2297#(< ~counter~0 48)} is VALID [2022-04-28 12:38:22,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-28 12:38:22,385 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-28 12:38:22,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:22,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961029391] [2022-04-28 12:38:22,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:22,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826808455] [2022-04-28 12:38:22,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826808455] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:38:22,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:38:22,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-28 12:38:22,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:22,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963203695] [2022-04-28 12:38:22,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963203695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:22,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:22,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:38:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573652747] [2022-04-28 12:38:22,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:22,386 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-28 12:38:22,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:22,387 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-28 12:38:22,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:22,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:38:22,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:22,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:38:22,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:38:22,409 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 12:38:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:22,553 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-28 12:38:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:38:22,553 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-28 12:38:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:22,554 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-28 12:38:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 12:38:22,556 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-28 12:38:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 12:38:22,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-28 12:38:22,615 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-28 12:38:22,616 INFO L225 Difference]: With dead ends: 106 [2022-04-28 12:38:22,616 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 12:38:22,617 INFO L412 NwaCegarLoop]: 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-28 12:38:22,617 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:22,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 12:38:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-28 12:38:22,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:22,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:38:22,659 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:38:22,659 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:38:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:22,661 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-28 12:38:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-28 12:38:22,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:22,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:22,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-28 12:38:22,662 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-28 12:38:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:22,664 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-28 12:38:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-28 12:38:22,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:22,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:22,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:22,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:38:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-28 12:38:22,666 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-28 12:38:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:22,666 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-28 12:38:22,666 INFO L496 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-28 12:38:22,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-28 12:38:25,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-28 12:38:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 12:38:25,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:25,978 INFO L195 NwaCegarLoop]: 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-28 12:38:26,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:26,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:26,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-28 12:38:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:26,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1502633764] [2022-04-28 12:38:26,180 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-28 12:38:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:26,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212561523] [2022-04-28 12:38:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:26,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:26,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552707770] [2022-04-28 12:38:26,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:26,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:26,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:26,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:26,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 12:38:26,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:26,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:26,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:38:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:26,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:26,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-28 12:38:26,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2845#(<= ~counter~0 0)} {2837#true} #102#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {2845#(<= ~counter~0 0)} call #t~ret9 := main(); {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {2845#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {2845#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #90#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,440 INFO L272 TraceCheckUtils]: 11: Hoare triple {2845#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,441 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #92#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {2845#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2845#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:26,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {2845#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:26,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {2894#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:26,443 INFO L272 TraceCheckUtils]: 19: Hoare triple {2894#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2894#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:26,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#(<= ~counter~0 1)} ~cond := #in~cond; {2894#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:26,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#(<= ~counter~0 1)} assume !(0 == ~cond); {2894#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:26,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {2894#(<= ~counter~0 1)} assume true; {2894#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:26,444 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2894#(<= ~counter~0 1)} {2894#(<= ~counter~0 1)} #94#return; {2894#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:26,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2894#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:26,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {2894#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:26,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {2919#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:26,446 INFO L272 TraceCheckUtils]: 27: Hoare triple {2919#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2919#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:26,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {2919#(<= ~counter~0 2)} ~cond := #in~cond; {2919#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:26,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {2919#(<= ~counter~0 2)} assume !(0 == ~cond); {2919#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:26,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {2919#(<= ~counter~0 2)} assume true; {2919#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:26,447 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2919#(<= ~counter~0 2)} {2919#(<= ~counter~0 2)} #96#return; {2919#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:26,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {2919#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2919#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:26,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {2919#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2944#(<= |main_#t~post7| 2)} is VALID [2022-04-28 12:38:26,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {2838#false} is VALID [2022-04-28 12:38:26,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-28 12:38:26,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 50);havoc #t~post8; {2838#false} is VALID [2022-04-28 12:38:26,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-28 12:38:26,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 50);havoc #t~post6; {2838#false} is VALID [2022-04-28 12:38:26,449 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2838#false} is VALID [2022-04-28 12:38:26,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-28 12:38:26,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-28 12:38:26,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-28 12:38:26,449 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-28 12:38:26,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:26,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-28 12:38:26,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-28 12:38:26,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-28 12:38:26,660 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2838#false} is VALID [2022-04-28 12:38:26,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 50);havoc #t~post6; {2838#false} is VALID [2022-04-28 12:38:26,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-28 12:38:26,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 50);havoc #t~post8; {2838#false} is VALID [2022-04-28 12:38:26,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-28 12:38:26,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {2838#false} is VALID [2022-04-28 12:38:26,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2996#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:38:26,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {3000#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3000#(< ~counter~0 50)} is VALID [2022-04-28 12:38:26,663 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2837#true} {3000#(< ~counter~0 50)} #96#return; {3000#(< ~counter~0 50)} is VALID [2022-04-28 12:38:26,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-28 12:38:26,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-28 12:38:26,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-28 12:38:26,664 INFO L272 TraceCheckUtils]: 27: Hoare triple {3000#(< ~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)); {2837#true} is VALID [2022-04-28 12:38:26,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {3000#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {3000#(< ~counter~0 50)} is VALID [2022-04-28 12:38:26,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {3025#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3000#(< ~counter~0 50)} is VALID [2022-04-28 12:38:26,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {3025#(< ~counter~0 49)} assume !!(0 != ~r~0); {3025#(< ~counter~0 49)} is VALID [2022-04-28 12:38:26,665 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2837#true} {3025#(< ~counter~0 49)} #94#return; {3025#(< ~counter~0 49)} is VALID [2022-04-28 12:38:26,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-28 12:38:26,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-28 12:38:26,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-28 12:38:26,667 INFO L272 TraceCheckUtils]: 19: Hoare triple {3025#(< ~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)); {2837#true} is VALID [2022-04-28 12:38:26,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {3025#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {3025#(< ~counter~0 49)} is VALID [2022-04-28 12:38:26,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3025#(< ~counter~0 49)} is VALID [2022-04-28 12:38:26,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3050#(< ~counter~0 48)} is VALID [2022-04-28 12:38:26,668 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2837#true} {3050#(< ~counter~0 48)} #92#return; {3050#(< ~counter~0 48)} is VALID [2022-04-28 12:38:26,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-28 12:38:26,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-28 12:38:26,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-28 12:38:26,668 INFO L272 TraceCheckUtils]: 11: Hoare triple {3050#(< ~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)); {2837#true} is VALID [2022-04-28 12:38:26,669 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2837#true} {3050#(< ~counter~0 48)} #90#return; {3050#(< ~counter~0 48)} is VALID [2022-04-28 12:38:26,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-28 12:38:26,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-28 12:38:26,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-28 12:38:26,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2837#true} is VALID [2022-04-28 12:38:26,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#(< ~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; {3050#(< ~counter~0 48)} is VALID [2022-04-28 12:38:26,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#(< ~counter~0 48)} call #t~ret9 := main(); {3050#(< ~counter~0 48)} is VALID [2022-04-28 12:38:26,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#(< ~counter~0 48)} {2837#true} #102#return; {3050#(< ~counter~0 48)} is VALID [2022-04-28 12:38:26,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#(< ~counter~0 48)} assume true; {3050#(< ~counter~0 48)} is VALID [2022-04-28 12:38:26,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3050#(< ~counter~0 48)} is VALID [2022-04-28 12:38:26,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-28 12:38:26,671 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-28 12:38:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:26,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212561523] [2022-04-28 12:38:26,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:26,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552707770] [2022-04-28 12:38:26,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552707770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:26,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:26,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 12:38:26,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:26,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1502633764] [2022-04-28 12:38:26,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1502633764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:26,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:26,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:38:26,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595231524] [2022-04-28 12:38:26,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:26,673 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-28 12:38:26,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:26,673 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-28 12:38:26,700 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-28 12:38:26,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:38:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:26,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:38:26,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:38:26,700 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 12:38:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:26,871 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-28 12:38:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:38:26,872 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-28 12:38:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:26,872 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-28 12:38:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 12:38:26,873 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-28 12:38:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 12:38:26,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-28 12:38:26,945 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-28 12:38:26,946 INFO L225 Difference]: With dead ends: 91 [2022-04-28 12:38:26,946 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 12:38:26,947 INFO L412 NwaCegarLoop]: 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-28 12:38:26,947 INFO L413 NwaCegarLoop]: 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-28 12:38:26,947 INFO L414 NwaCegarLoop]: 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-28 12:38:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 12:38:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 12:38:26,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:26,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:38:26,992 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:38:26,992 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:38:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:26,993 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-28 12:38:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-28 12:38:26,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:26,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:26,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-28 12:38:26,994 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-28 12:38:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:26,996 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-28 12:38:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-28 12:38:26,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:26,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:26,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:26,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:38:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-28 12:38:26,998 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 43 [2022-04-28 12:38:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:26,998 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-28 12:38:26,998 INFO L496 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-28 12:38:26,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2022-04-28 12:38:27,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-28 12:38:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 12:38:27,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:27,676 INFO L195 NwaCegarLoop]: 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-28 12:38:27,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:27,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:27,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-28 12:38:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:27,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1669438886] [2022-04-28 12:38:27,877 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-28 12:38:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:27,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138825035] [2022-04-28 12:38:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:27,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:27,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770338845] [2022-04-28 12:38:27,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:27,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:27,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:27,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 12:38:27,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:27,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:27,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 12:38:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:27,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:28,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #102#return; {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret9 := main(); {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #90#return; {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L272 TraceCheckUtils]: 11: Hoare triple {3568#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 12:38:28,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3568#true} {3568#true} #92#return; {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {3568#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#true} assume !!(#t~post6 < 50);havoc #t~post6; {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L272 TraceCheckUtils]: 19: Hoare triple {3568#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3568#true} {3568#true} #94#return; {3568#true} is VALID [2022-04-28 12:38:28,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {3568#true} assume !!(0 != ~r~0); {3645#(not (= main_~r~0 0))} is VALID [2022-04-28 12:38:28,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {3645#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-28 12:38:28,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {3645#(not (= main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-28 12:38:28,087 INFO L272 TraceCheckUtils]: 27: Hoare triple {3645#(not (= main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3568#true} is VALID [2022-04-28 12:38:28,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 12:38:28,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 12:38:28,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 12:38:28,087 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3568#true} {3645#(not (= main_~r~0 0))} #96#return; {3645#(not (= main_~r~0 0))} is VALID [2022-04-28 12:38:28,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {3645#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:38:28,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:38:28,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:38:28,093 INFO L272 TraceCheckUtils]: 35: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3568#true} is VALID [2022-04-28 12:38:28,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-28 12:38:28,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-28 12:38:28,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-28 12:38:28,094 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3568#true} {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:38:28,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3569#false} is VALID [2022-04-28 12:38:28,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {3569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3569#false} is VALID [2022-04-28 12:38:28,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {3569#false} assume !(#t~post6 < 50);havoc #t~post6; {3569#false} is VALID [2022-04-28 12:38:28,094 INFO L272 TraceCheckUtils]: 43: Hoare triple {3569#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3569#false} is VALID [2022-04-28 12:38:28,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {3569#false} ~cond := #in~cond; {3569#false} is VALID [2022-04-28 12:38:28,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {3569#false} assume 0 == ~cond; {3569#false} is VALID [2022-04-28 12:38:28,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-28 12:38:28,099 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-28 12:38:28,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:38:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:28,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138825035] [2022-04-28 12:38:28,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:28,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770338845] [2022-04-28 12:38:28,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770338845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:28,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:28,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:38:28,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:28,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1669438886] [2022-04-28 12:38:28,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1669438886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:28,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:28,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:38:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116307870] [2022-04-28 12:38:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:28,101 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-28 12:38:28,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:28,103 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-28 12:38:28,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:28,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:38:28,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:38:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:38:28,129 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 12:38:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:28,283 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2022-04-28 12:38:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:38:28,283 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-28 12:38:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:28,284 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-28 12:38:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 12:38:28,285 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-28 12:38:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 12:38:28,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 12:38:28,371 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-28 12:38:28,376 INFO L225 Difference]: With dead ends: 153 [2022-04-28 12:38:28,376 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 12:38:28,378 INFO L412 NwaCegarLoop]: 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-28 12:38:28,379 INFO L413 NwaCegarLoop]: 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-28 12:38:28,379 INFO L414 NwaCegarLoop]: 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-28 12:38:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 12:38:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-04-28 12:38:28,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:28,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:38:28,447 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:38:28,448 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:38:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:28,453 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2022-04-28 12:38:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2022-04-28 12:38:28,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:28,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:28,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 116 states. [2022-04-28 12:38:28,461 INFO L87 Difference]: Start difference. First operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 116 states. [2022-04-28 12:38:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:28,464 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2022-04-28 12:38:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2022-04-28 12:38:28,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:28,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:28,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:28,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 12:38:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2022-04-28 12:38:28,468 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 47 [2022-04-28 12:38:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:28,469 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2022-04-28 12:38:28,469 INFO L496 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-28 12:38:28,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 128 transitions. [2022-04-28 12:38:31,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2022-04-28 12:38:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 12:38:31,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:31,466 INFO L195 NwaCegarLoop]: 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-28 12:38:31,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:31,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-28 12:38:31,671 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-28 12:38:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:31,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777945154] [2022-04-28 12:38:31,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-28 12:38:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:31,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215939782] [2022-04-28 12:38:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:31,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:31,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587673827] [2022-04-28 12:38:31,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:31,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:31,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:31,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 12:38:31,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:31,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:31,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:38:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:31,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:31,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {4446#true} call ULTIMATE.init(); {4446#true} is VALID [2022-04-28 12:38:31,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#(<= ~counter~0 0)} {4446#true} #102#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#(<= ~counter~0 0)} call #t~ret9 := main(); {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#(<= ~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; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {4454#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {4454#(<= ~counter~0 0)} ~cond := #in~cond; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {4454#(<= ~counter~0 0)} assume !(0 == ~cond); {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4454#(<= ~counter~0 0)} {4454#(<= ~counter~0 0)} #90#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,975 INFO L272 TraceCheckUtils]: 11: Hoare triple {4454#(<= ~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)); {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#(<= ~counter~0 0)} ~cond := #in~cond; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#(<= ~counter~0 0)} assume !(0 == ~cond); {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,977 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4454#(<= ~counter~0 0)} {4454#(<= ~counter~0 0)} #92#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {4454#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4454#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:31,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {4454#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4503#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:31,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {4503#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4503#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:31,978 INFO L272 TraceCheckUtils]: 19: Hoare triple {4503#(<= ~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)); {4503#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:31,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {4503#(<= ~counter~0 1)} ~cond := #in~cond; {4503#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:31,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {4503#(<= ~counter~0 1)} assume !(0 == ~cond); {4503#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:31,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {4503#(<= ~counter~0 1)} assume true; {4503#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:31,980 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4503#(<= ~counter~0 1)} {4503#(<= ~counter~0 1)} #94#return; {4503#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:31,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {4503#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4503#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:31,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {4503#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4528#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:31,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {4528#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {4528#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:31,981 INFO L272 TraceCheckUtils]: 27: Hoare triple {4528#(<= ~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)); {4528#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:31,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {4528#(<= ~counter~0 2)} ~cond := #in~cond; {4528#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:31,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {4528#(<= ~counter~0 2)} assume !(0 == ~cond); {4528#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:31,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {4528#(<= ~counter~0 2)} assume true; {4528#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:31,983 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4528#(<= ~counter~0 2)} {4528#(<= ~counter~0 2)} #96#return; {4528#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:31,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {4528#(<= ~counter~0 2)} assume !(~r~0 > 0); {4528#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:31,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {4528#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4553#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:31,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {4553#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {4553#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:31,984 INFO L272 TraceCheckUtils]: 35: Hoare triple {4553#(<= ~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)); {4553#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:31,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {4553#(<= ~counter~0 3)} ~cond := #in~cond; {4553#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:31,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {4553#(<= ~counter~0 3)} assume !(0 == ~cond); {4553#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:31,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {4553#(<= ~counter~0 3)} assume true; {4553#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:31,985 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4553#(<= ~counter~0 3)} {4553#(<= ~counter~0 3)} #98#return; {4553#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:31,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {4553#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4553#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:31,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {4553#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4578#(<= |main_#t~post8| 3)} is VALID [2022-04-28 12:38:31,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {4578#(<= |main_#t~post8| 3)} assume !(#t~post8 < 50);havoc #t~post8; {4447#false} is VALID [2022-04-28 12:38:31,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4447#false} is VALID [2022-04-28 12:38:31,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} assume !(#t~post6 < 50);havoc #t~post6; {4447#false} is VALID [2022-04-28 12:38:31,987 INFO L272 TraceCheckUtils]: 45: Hoare triple {4447#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4447#false} is VALID [2022-04-28 12:38:31,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} ~cond := #in~cond; {4447#false} is VALID [2022-04-28 12:38:31,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {4447#false} assume 0 == ~cond; {4447#false} is VALID [2022-04-28 12:38:31,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-28 12:38:31,987 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-28 12:38:31,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:32,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-28 12:38:32,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {4447#false} assume 0 == ~cond; {4447#false} is VALID [2022-04-28 12:38:32,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} ~cond := #in~cond; {4447#false} is VALID [2022-04-28 12:38:32,250 INFO L272 TraceCheckUtils]: 45: Hoare triple {4447#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4447#false} is VALID [2022-04-28 12:38:32,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} assume !(#t~post6 < 50);havoc #t~post6; {4447#false} is VALID [2022-04-28 12:38:32,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4447#false} is VALID [2022-04-28 12:38:32,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {4618#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {4447#false} is VALID [2022-04-28 12:38:32,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {4622#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4618#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:38:32,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {4622#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4622#(< ~counter~0 50)} is VALID [2022-04-28 12:38:32,252 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4446#true} {4622#(< ~counter~0 50)} #98#return; {4622#(< ~counter~0 50)} is VALID [2022-04-28 12:38:32,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-28 12:38:32,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-28 12:38:32,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-28 12:38:32,252 INFO L272 TraceCheckUtils]: 35: Hoare triple {4622#(< ~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)); {4446#true} is VALID [2022-04-28 12:38:32,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {4622#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {4622#(< ~counter~0 50)} is VALID [2022-04-28 12:38:32,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {4647#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4622#(< ~counter~0 50)} is VALID [2022-04-28 12:38:32,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {4647#(< ~counter~0 49)} assume !(~r~0 > 0); {4647#(< ~counter~0 49)} is VALID [2022-04-28 12:38:32,254 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4446#true} {4647#(< ~counter~0 49)} #96#return; {4647#(< ~counter~0 49)} is VALID [2022-04-28 12:38:32,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-28 12:38:32,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-28 12:38:32,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-28 12:38:32,254 INFO L272 TraceCheckUtils]: 27: Hoare triple {4647#(< ~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)); {4446#true} is VALID [2022-04-28 12:38:32,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {4647#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {4647#(< ~counter~0 49)} is VALID [2022-04-28 12:38:32,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {4672#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4647#(< ~counter~0 49)} is VALID [2022-04-28 12:38:32,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {4672#(< ~counter~0 48)} assume !!(0 != ~r~0); {4672#(< ~counter~0 48)} is VALID [2022-04-28 12:38:32,256 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4446#true} {4672#(< ~counter~0 48)} #94#return; {4672#(< ~counter~0 48)} is VALID [2022-04-28 12:38:32,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-28 12:38:32,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-28 12:38:32,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-28 12:38:32,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {4672#(< ~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)); {4446#true} is VALID [2022-04-28 12:38:32,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {4672#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {4672#(< ~counter~0 48)} is VALID [2022-04-28 12:38:32,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {4697#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4672#(< ~counter~0 48)} is VALID [2022-04-28 12:38:32,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {4697#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4697#(< ~counter~0 47)} is VALID [2022-04-28 12:38:32,257 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4446#true} {4697#(< ~counter~0 47)} #92#return; {4697#(< ~counter~0 47)} is VALID [2022-04-28 12:38:32,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-28 12:38:32,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-28 12:38:32,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-28 12:38:32,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {4697#(< ~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)); {4446#true} is VALID [2022-04-28 12:38:32,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4446#true} {4697#(< ~counter~0 47)} #90#return; {4697#(< ~counter~0 47)} is VALID [2022-04-28 12:38:32,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-28 12:38:32,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-28 12:38:32,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-28 12:38:32,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {4697#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4446#true} is VALID [2022-04-28 12:38:32,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {4697#(< ~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; {4697#(< ~counter~0 47)} is VALID [2022-04-28 12:38:32,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {4697#(< ~counter~0 47)} call #t~ret9 := main(); {4697#(< ~counter~0 47)} is VALID [2022-04-28 12:38:32,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4697#(< ~counter~0 47)} {4446#true} #102#return; {4697#(< ~counter~0 47)} is VALID [2022-04-28 12:38:32,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {4697#(< ~counter~0 47)} assume true; {4697#(< ~counter~0 47)} is VALID [2022-04-28 12:38:32,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4697#(< ~counter~0 47)} is VALID [2022-04-28 12:38:32,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {4446#true} call ULTIMATE.init(); {4446#true} is VALID [2022-04-28 12:38:32,260 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-28 12:38:32,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:32,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215939782] [2022-04-28 12:38:32,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:32,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587673827] [2022-04-28 12:38:32,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587673827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:32,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:32,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 12:38:32,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:32,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777945154] [2022-04-28 12:38:32,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777945154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:32,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:32,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:38:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416083319] [2022-04-28 12:38:32,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:32,262 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-28 12:38:32,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:32,262 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-28 12:38:32,294 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-28 12:38:32,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:38:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:32,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:38:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:38:32,295 INFO L87 Difference]: Start difference. First operand 98 states and 128 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-28 12:38:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:32,508 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2022-04-28 12:38:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:38:32,509 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-28 12:38:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:32,509 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-28 12:38:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 12:38:32,510 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-28 12:38:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 12:38:32,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 12:38:32,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:32,577 INFO L225 Difference]: With dead ends: 176 [2022-04-28 12:38:32,577 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 12:38:32,577 INFO L412 NwaCegarLoop]: 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-28 12:38:32,578 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:32,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 137 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 12:38:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-04-28 12:38:32,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:32,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 110 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 12:38:32,648 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 110 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 12:38:32,648 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 110 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 12:38:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:32,650 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2022-04-28 12:38:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2022-04-28 12:38:32,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:32,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:32,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 111 states. [2022-04-28 12:38:32,651 INFO L87 Difference]: Start difference. First operand has 110 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 111 states. [2022-04-28 12:38:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:32,653 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2022-04-28 12:38:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2022-04-28 12:38:32,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:32,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:32,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:32,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 12:38:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2022-04-28 12:38:32,655 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2022-04-28 12:38:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:32,656 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2022-04-28 12:38:32,656 INFO L496 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-28 12:38:32,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 142 transitions. [2022-04-28 12:38:36,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 141 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2022-04-28 12:38:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 12:38:36,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:36,410 INFO L195 NwaCegarLoop]: 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-28 12:38:36,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:36,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:36,611 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-28 12:38:36,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:36,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1570703887] [2022-04-28 12:38:36,612 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-28 12:38:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:36,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391723038] [2022-04-28 12:38:36,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:36,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:36,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123875121] [2022-04-28 12:38:36,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:38:36,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:36,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:36,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 12:38:36,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:38:36,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:36,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:38:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:36,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:36,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {5547#true} call ULTIMATE.init(); {5547#true} is VALID [2022-04-28 12:38:36,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {5547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {5555#(<= ~counter~0 0)} assume true; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5555#(<= ~counter~0 0)} {5547#true} #102#return; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {5555#(<= ~counter~0 0)} call #t~ret9 := main(); {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {5555#(<= ~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; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {5555#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {5555#(<= ~counter~0 0)} ~cond := #in~cond; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {5555#(<= ~counter~0 0)} assume !(0 == ~cond); {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {5555#(<= ~counter~0 0)} assume true; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5555#(<= ~counter~0 0)} {5555#(<= ~counter~0 0)} #90#return; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,994 INFO L272 TraceCheckUtils]: 11: Hoare triple {5555#(<= ~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)); {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {5555#(<= ~counter~0 0)} ~cond := #in~cond; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {5555#(<= ~counter~0 0)} assume !(0 == ~cond); {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {5555#(<= ~counter~0 0)} assume true; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,995 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5555#(<= ~counter~0 0)} {5555#(<= ~counter~0 0)} #92#return; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {5555#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5555#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:36,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {5555#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5604#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:36,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {5604#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {5604#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:36,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {5604#(<= ~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)); {5604#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:36,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {5604#(<= ~counter~0 1)} ~cond := #in~cond; {5604#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:36,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {5604#(<= ~counter~0 1)} assume !(0 == ~cond); {5604#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:36,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {5604#(<= ~counter~0 1)} assume true; {5604#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:36,998 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5604#(<= ~counter~0 1)} {5604#(<= ~counter~0 1)} #94#return; {5604#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:36,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {5604#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5604#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:36,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {5604#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5629#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:37,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {5629#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {5629#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:37,000 INFO L272 TraceCheckUtils]: 27: Hoare triple {5629#(<= ~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)); {5629#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:37,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {5629#(<= ~counter~0 2)} ~cond := #in~cond; {5629#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:37,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {5629#(<= ~counter~0 2)} assume !(0 == ~cond); {5629#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:37,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {5629#(<= ~counter~0 2)} assume true; {5629#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:37,002 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5629#(<= ~counter~0 2)} {5629#(<= ~counter~0 2)} #96#return; {5629#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:37,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {5629#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5629#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:37,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {5629#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5654#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:37,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {5654#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {5654#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:37,003 INFO L272 TraceCheckUtils]: 35: Hoare triple {5654#(<= ~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)); {5654#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:37,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {5654#(<= ~counter~0 3)} ~cond := #in~cond; {5654#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:37,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {5654#(<= ~counter~0 3)} assume !(0 == ~cond); {5654#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:37,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {5654#(<= ~counter~0 3)} assume true; {5654#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:37,005 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5654#(<= ~counter~0 3)} {5654#(<= ~counter~0 3)} #96#return; {5654#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:37,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {5654#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5654#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:37,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {5654#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5679#(<= |main_#t~post7| 3)} is VALID [2022-04-28 12:38:37,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {5679#(<= |main_#t~post7| 3)} assume !(#t~post7 < 50);havoc #t~post7; {5548#false} is VALID [2022-04-28 12:38:37,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {5548#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5548#false} is VALID [2022-04-28 12:38:37,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {5548#false} assume !(#t~post8 < 50);havoc #t~post8; {5548#false} is VALID [2022-04-28 12:38:37,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {5548#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5548#false} is VALID [2022-04-28 12:38:37,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {5548#false} assume !(#t~post6 < 50);havoc #t~post6; {5548#false} is VALID [2022-04-28 12:38:37,006 INFO L272 TraceCheckUtils]: 47: Hoare triple {5548#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5548#false} is VALID [2022-04-28 12:38:37,006 INFO L290 TraceCheckUtils]: 48: Hoare triple {5548#false} ~cond := #in~cond; {5548#false} is VALID [2022-04-28 12:38:37,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {5548#false} assume 0 == ~cond; {5548#false} is VALID [2022-04-28 12:38:37,006 INFO L290 TraceCheckUtils]: 50: Hoare triple {5548#false} assume !false; {5548#false} is VALID [2022-04-28 12:38:37,006 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-28 12:38:37,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:37,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {5548#false} assume !false; {5548#false} is VALID [2022-04-28 12:38:37,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {5548#false} assume 0 == ~cond; {5548#false} is VALID [2022-04-28 12:38:37,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {5548#false} ~cond := #in~cond; {5548#false} is VALID [2022-04-28 12:38:37,275 INFO L272 TraceCheckUtils]: 47: Hoare triple {5548#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5548#false} is VALID [2022-04-28 12:38:37,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {5548#false} assume !(#t~post6 < 50);havoc #t~post6; {5548#false} is VALID [2022-04-28 12:38:37,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {5548#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5548#false} is VALID [2022-04-28 12:38:37,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {5548#false} assume !(#t~post8 < 50);havoc #t~post8; {5548#false} is VALID [2022-04-28 12:38:37,275 INFO L290 TraceCheckUtils]: 43: Hoare triple {5548#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5548#false} is VALID [2022-04-28 12:38:37,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {5731#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {5548#false} is VALID [2022-04-28 12:38:37,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {5735#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5731#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:38:37,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {5735#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5735#(< ~counter~0 50)} is VALID [2022-04-28 12:38:37,276 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5547#true} {5735#(< ~counter~0 50)} #96#return; {5735#(< ~counter~0 50)} is VALID [2022-04-28 12:38:37,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {5547#true} assume true; {5547#true} is VALID [2022-04-28 12:38:37,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {5547#true} assume !(0 == ~cond); {5547#true} is VALID [2022-04-28 12:38:37,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {5547#true} ~cond := #in~cond; {5547#true} is VALID [2022-04-28 12:38:37,277 INFO L272 TraceCheckUtils]: 35: Hoare triple {5735#(< ~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)); {5547#true} is VALID [2022-04-28 12:38:37,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {5735#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {5735#(< ~counter~0 50)} is VALID [2022-04-28 12:38:37,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {5760#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5735#(< ~counter~0 50)} is VALID [2022-04-28 12:38:37,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {5760#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5760#(< ~counter~0 49)} is VALID [2022-04-28 12:38:37,279 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5547#true} {5760#(< ~counter~0 49)} #96#return; {5760#(< ~counter~0 49)} is VALID [2022-04-28 12:38:37,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {5547#true} assume true; {5547#true} is VALID [2022-04-28 12:38:37,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {5547#true} assume !(0 == ~cond); {5547#true} is VALID [2022-04-28 12:38:37,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {5547#true} ~cond := #in~cond; {5547#true} is VALID [2022-04-28 12:38:37,280 INFO L272 TraceCheckUtils]: 27: Hoare triple {5760#(< ~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)); {5547#true} is VALID [2022-04-28 12:38:37,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {5760#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {5760#(< ~counter~0 49)} is VALID [2022-04-28 12:38:37,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {5785#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5760#(< ~counter~0 49)} is VALID [2022-04-28 12:38:37,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {5785#(< ~counter~0 48)} assume !!(0 != ~r~0); {5785#(< ~counter~0 48)} is VALID [2022-04-28 12:38:37,281 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5547#true} {5785#(< ~counter~0 48)} #94#return; {5785#(< ~counter~0 48)} is VALID [2022-04-28 12:38:37,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {5547#true} assume true; {5547#true} is VALID [2022-04-28 12:38:37,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {5547#true} assume !(0 == ~cond); {5547#true} is VALID [2022-04-28 12:38:37,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {5547#true} ~cond := #in~cond; {5547#true} is VALID [2022-04-28 12:38:37,281 INFO L272 TraceCheckUtils]: 19: Hoare triple {5785#(< ~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)); {5547#true} is VALID [2022-04-28 12:38:37,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {5785#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {5785#(< ~counter~0 48)} is VALID [2022-04-28 12:38:37,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {5810#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5785#(< ~counter~0 48)} is VALID [2022-04-28 12:38:37,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {5810#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5810#(< ~counter~0 47)} is VALID [2022-04-28 12:38:37,283 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5547#true} {5810#(< ~counter~0 47)} #92#return; {5810#(< ~counter~0 47)} is VALID [2022-04-28 12:38:37,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {5547#true} assume true; {5547#true} is VALID [2022-04-28 12:38:37,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {5547#true} assume !(0 == ~cond); {5547#true} is VALID [2022-04-28 12:38:37,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {5547#true} ~cond := #in~cond; {5547#true} is VALID [2022-04-28 12:38:37,283 INFO L272 TraceCheckUtils]: 11: Hoare triple {5810#(< ~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)); {5547#true} is VALID [2022-04-28 12:38:37,284 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5547#true} {5810#(< ~counter~0 47)} #90#return; {5810#(< ~counter~0 47)} is VALID [2022-04-28 12:38:37,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {5547#true} assume true; {5547#true} is VALID [2022-04-28 12:38:37,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {5547#true} assume !(0 == ~cond); {5547#true} is VALID [2022-04-28 12:38:37,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {5547#true} ~cond := #in~cond; {5547#true} is VALID [2022-04-28 12:38:37,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {5810#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5547#true} is VALID [2022-04-28 12:38:37,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {5810#(< ~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; {5810#(< ~counter~0 47)} is VALID [2022-04-28 12:38:37,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {5810#(< ~counter~0 47)} call #t~ret9 := main(); {5810#(< ~counter~0 47)} is VALID [2022-04-28 12:38:37,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5810#(< ~counter~0 47)} {5547#true} #102#return; {5810#(< ~counter~0 47)} is VALID [2022-04-28 12:38:37,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {5810#(< ~counter~0 47)} assume true; {5810#(< ~counter~0 47)} is VALID [2022-04-28 12:38:37,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {5547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5810#(< ~counter~0 47)} is VALID [2022-04-28 12:38:37,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {5547#true} call ULTIMATE.init(); {5547#true} is VALID [2022-04-28 12:38:37,286 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-28 12:38:37,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:37,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391723038] [2022-04-28 12:38:37,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:37,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123875121] [2022-04-28 12:38:37,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123875121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:37,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:37,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 12:38:37,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:37,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1570703887] [2022-04-28 12:38:37,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1570703887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:37,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:37,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:38:37,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283275597] [2022-04-28 12:38:37,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:37,289 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-28 12:38:37,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:37,290 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-28 12:38:37,325 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-28 12:38:37,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:38:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:37,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:38:37,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:38:37,327 INFO L87 Difference]: Start difference. First operand 110 states and 142 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-28 12:38:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:37,545 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2022-04-28 12:38:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:38:37,546 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-28 12:38:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:37,546 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-28 12:38:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 12:38:37,547 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-28 12:38:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 12:38:37,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-28 12:38:37,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:37,600 INFO L225 Difference]: With dead ends: 149 [2022-04-28 12:38:37,600 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 12:38:37,601 INFO L412 NwaCegarLoop]: 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-28 12:38:37,601 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:37,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 164 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 12:38:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-04-28 12:38:37,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:37,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 12:38:37,701 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 12:38:37,701 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 12:38:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:37,703 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2022-04-28 12:38:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2022-04-28 12:38:37,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:37,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:37,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 112 states. [2022-04-28 12:38:37,703 INFO L87 Difference]: Start difference. First operand has 112 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 112 states. [2022-04-28 12:38:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:37,705 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2022-04-28 12:38:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2022-04-28 12:38:37,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:37,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:37,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:37,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 12:38:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2022-04-28 12:38:37,708 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 51 [2022-04-28 12:38:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:37,709 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2022-04-28 12:38:37,709 INFO L496 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-28 12:38:37,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 144 transitions. [2022-04-28 12:38:41,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 143 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2022-04-28 12:38:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 12:38:41,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:41,217 INFO L195 NwaCegarLoop]: 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-28 12:38:41,236 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-28 12:38:41,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 12:38:41,418 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-28 12:38:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:41,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [264899838] [2022-04-28 12:38:41,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-28 12:38:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:41,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547464045] [2022-04-28 12:38:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:41,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:41,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:41,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449878024] [2022-04-28 12:38:41,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:41,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:41,437 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:41,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 12:38:41,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:41,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:41,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:38:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:41,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:41,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6614#true} is VALID [2022-04-28 12:38:41,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {6622#(<= ~counter~0 0)} assume true; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6622#(<= ~counter~0 0)} {6614#true} #102#return; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {6622#(<= ~counter~0 0)} call #t~ret9 := main(); {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {6622#(<= ~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; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {6622#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {6622#(<= ~counter~0 0)} ~cond := #in~cond; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {6622#(<= ~counter~0 0)} assume !(0 == ~cond); {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {6622#(<= ~counter~0 0)} assume true; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6622#(<= ~counter~0 0)} {6622#(<= ~counter~0 0)} #90#return; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,761 INFO L272 TraceCheckUtils]: 11: Hoare triple {6622#(<= ~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)); {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {6622#(<= ~counter~0 0)} ~cond := #in~cond; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {6622#(<= ~counter~0 0)} assume !(0 == ~cond); {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {6622#(<= ~counter~0 0)} assume true; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,762 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6622#(<= ~counter~0 0)} {6622#(<= ~counter~0 0)} #92#return; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {6622#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6622#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:41,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {6622#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6671#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:41,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {6671#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6671#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:41,764 INFO L272 TraceCheckUtils]: 19: Hoare triple {6671#(<= ~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)); {6671#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:41,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {6671#(<= ~counter~0 1)} ~cond := #in~cond; {6671#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:41,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {6671#(<= ~counter~0 1)} assume !(0 == ~cond); {6671#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:41,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {6671#(<= ~counter~0 1)} assume true; {6671#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:41,765 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6671#(<= ~counter~0 1)} {6671#(<= ~counter~0 1)} #94#return; {6671#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:41,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {6671#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6671#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:41,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {6671#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6696#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:41,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {6696#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {6696#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:41,767 INFO L272 TraceCheckUtils]: 27: Hoare triple {6696#(<= ~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)); {6696#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:41,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {6696#(<= ~counter~0 2)} ~cond := #in~cond; {6696#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:41,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {6696#(<= ~counter~0 2)} assume !(0 == ~cond); {6696#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:41,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {6696#(<= ~counter~0 2)} assume true; {6696#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:41,768 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6696#(<= ~counter~0 2)} {6696#(<= ~counter~0 2)} #96#return; {6696#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:41,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {6696#(<= ~counter~0 2)} assume !(~r~0 > 0); {6696#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:41,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {6696#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:41,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {6721#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:41,770 INFO L272 TraceCheckUtils]: 35: Hoare triple {6721#(<= ~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)); {6721#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:41,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {6721#(<= ~counter~0 3)} ~cond := #in~cond; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:41,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {6721#(<= ~counter~0 3)} assume !(0 == ~cond); {6721#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:41,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {6721#(<= ~counter~0 3)} assume true; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:41,771 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6721#(<= ~counter~0 3)} {6721#(<= ~counter~0 3)} #98#return; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:41,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {6721#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:41,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {6721#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6746#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:41,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {6746#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {6746#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:41,773 INFO L272 TraceCheckUtils]: 43: Hoare triple {6746#(<= ~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)); {6746#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:41,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {6746#(<= ~counter~0 4)} ~cond := #in~cond; {6746#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:41,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {6746#(<= ~counter~0 4)} assume !(0 == ~cond); {6746#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:41,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {6746#(<= ~counter~0 4)} assume true; {6746#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:41,775 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6746#(<= ~counter~0 4)} {6746#(<= ~counter~0 4)} #98#return; {6746#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:41,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {6746#(<= ~counter~0 4)} assume !(~r~0 < 0); {6746#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:41,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {6746#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6771#(<= |main_#t~post6| 4)} is VALID [2022-04-28 12:38:41,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {6771#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {6615#false} is VALID [2022-04-28 12:38:41,776 INFO L272 TraceCheckUtils]: 51: Hoare triple {6615#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6615#false} is VALID [2022-04-28 12:38:41,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2022-04-28 12:38:41,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2022-04-28 12:38:41,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2022-04-28 12:38:41,776 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-28 12:38:41,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:42,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {6615#false} assume !false; {6615#false} is VALID [2022-04-28 12:38:42,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {6615#false} assume 0 == ~cond; {6615#false} is VALID [2022-04-28 12:38:42,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {6615#false} ~cond := #in~cond; {6615#false} is VALID [2022-04-28 12:38:42,041 INFO L272 TraceCheckUtils]: 51: Hoare triple {6615#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6615#false} is VALID [2022-04-28 12:38:42,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {6799#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {6615#false} is VALID [2022-04-28 12:38:42,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {6803#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6799#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:38:42,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {6803#(< ~counter~0 50)} assume !(~r~0 < 0); {6803#(< ~counter~0 50)} is VALID [2022-04-28 12:38:42,062 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6614#true} {6803#(< ~counter~0 50)} #98#return; {6803#(< ~counter~0 50)} is VALID [2022-04-28 12:38:42,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 12:38:42,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {6614#true} assume !(0 == ~cond); {6614#true} is VALID [2022-04-28 12:38:42,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {6614#true} ~cond := #in~cond; {6614#true} is VALID [2022-04-28 12:38:42,062 INFO L272 TraceCheckUtils]: 43: Hoare triple {6803#(< ~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)); {6614#true} is VALID [2022-04-28 12:38:42,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {6803#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {6803#(< ~counter~0 50)} is VALID [2022-04-28 12:38:42,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {6828#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6803#(< ~counter~0 50)} is VALID [2022-04-28 12:38:42,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {6828#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6828#(< ~counter~0 49)} is VALID [2022-04-28 12:38:42,063 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6614#true} {6828#(< ~counter~0 49)} #98#return; {6828#(< ~counter~0 49)} is VALID [2022-04-28 12:38:42,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 12:38:42,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {6614#true} assume !(0 == ~cond); {6614#true} is VALID [2022-04-28 12:38:42,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {6614#true} ~cond := #in~cond; {6614#true} is VALID [2022-04-28 12:38:42,063 INFO L272 TraceCheckUtils]: 35: Hoare triple {6828#(< ~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)); {6614#true} is VALID [2022-04-28 12:38:42,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {6828#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {6828#(< ~counter~0 49)} is VALID [2022-04-28 12:38:42,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {6853#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6828#(< ~counter~0 49)} is VALID [2022-04-28 12:38:42,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {6853#(< ~counter~0 48)} assume !(~r~0 > 0); {6853#(< ~counter~0 48)} is VALID [2022-04-28 12:38:42,064 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6614#true} {6853#(< ~counter~0 48)} #96#return; {6853#(< ~counter~0 48)} is VALID [2022-04-28 12:38:42,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 12:38:42,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {6614#true} assume !(0 == ~cond); {6614#true} is VALID [2022-04-28 12:38:42,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {6614#true} ~cond := #in~cond; {6614#true} is VALID [2022-04-28 12:38:42,065 INFO L272 TraceCheckUtils]: 27: Hoare triple {6853#(< ~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)); {6614#true} is VALID [2022-04-28 12:38:42,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {6853#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {6853#(< ~counter~0 48)} is VALID [2022-04-28 12:38:42,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {6878#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6853#(< ~counter~0 48)} is VALID [2022-04-28 12:38:42,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {6878#(< ~counter~0 47)} assume !!(0 != ~r~0); {6878#(< ~counter~0 47)} is VALID [2022-04-28 12:38:42,066 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6614#true} {6878#(< ~counter~0 47)} #94#return; {6878#(< ~counter~0 47)} is VALID [2022-04-28 12:38:42,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 12:38:42,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {6614#true} assume !(0 == ~cond); {6614#true} is VALID [2022-04-28 12:38:42,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {6614#true} ~cond := #in~cond; {6614#true} is VALID [2022-04-28 12:38:42,066 INFO L272 TraceCheckUtils]: 19: Hoare triple {6878#(< ~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)); {6614#true} is VALID [2022-04-28 12:38:42,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {6878#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {6878#(< ~counter~0 47)} is VALID [2022-04-28 12:38:42,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {6903#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6878#(< ~counter~0 47)} is VALID [2022-04-28 12:38:42,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {6903#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6903#(< ~counter~0 46)} is VALID [2022-04-28 12:38:42,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6614#true} {6903#(< ~counter~0 46)} #92#return; {6903#(< ~counter~0 46)} is VALID [2022-04-28 12:38:42,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 12:38:42,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {6614#true} assume !(0 == ~cond); {6614#true} is VALID [2022-04-28 12:38:42,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {6614#true} ~cond := #in~cond; {6614#true} is VALID [2022-04-28 12:38:42,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {6903#(< ~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)); {6614#true} is VALID [2022-04-28 12:38:42,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6614#true} {6903#(< ~counter~0 46)} #90#return; {6903#(< ~counter~0 46)} is VALID [2022-04-28 12:38:42,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {6614#true} assume true; {6614#true} is VALID [2022-04-28 12:38:42,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {6614#true} assume !(0 == ~cond); {6614#true} is VALID [2022-04-28 12:38:42,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#true} ~cond := #in~cond; {6614#true} is VALID [2022-04-28 12:38:42,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {6903#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6614#true} is VALID [2022-04-28 12:38:42,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {6903#(< ~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; {6903#(< ~counter~0 46)} is VALID [2022-04-28 12:38:42,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {6903#(< ~counter~0 46)} call #t~ret9 := main(); {6903#(< ~counter~0 46)} is VALID [2022-04-28 12:38:42,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6903#(< ~counter~0 46)} {6614#true} #102#return; {6903#(< ~counter~0 46)} is VALID [2022-04-28 12:38:42,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {6903#(< ~counter~0 46)} assume true; {6903#(< ~counter~0 46)} is VALID [2022-04-28 12:38:42,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6903#(< ~counter~0 46)} is VALID [2022-04-28 12:38:42,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {6614#true} call ULTIMATE.init(); {6614#true} is VALID [2022-04-28 12:38:42,070 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-28 12:38:42,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:42,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547464045] [2022-04-28 12:38:42,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:42,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449878024] [2022-04-28 12:38:42,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449878024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:42,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:42,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 12:38:42,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:42,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [264899838] [2022-04-28 12:38:42,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [264899838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:42,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:42,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:38:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270608278] [2022-04-28 12:38:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:42,071 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-28 12:38:42,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:42,072 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-28 12:38:42,108 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-28 12:38:42,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:38:42,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:38:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:38:42,108 INFO L87 Difference]: Start difference. First operand 112 states and 144 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-28 12:38:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:42,372 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2022-04-28 12:38:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:38:42,373 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-28 12:38:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:42,373 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-28 12:38:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 12:38:42,374 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-28 12:38:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 12:38:42,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 12:38:42,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:42,436 INFO L225 Difference]: With dead ends: 134 [2022-04-28 12:38:42,436 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 12:38:42,436 INFO L412 NwaCegarLoop]: 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-28 12:38:42,437 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:42,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 12:38:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2022-04-28 12:38:42,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:42,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:42,517 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:42,517 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:42,520 INFO L93 Difference]: Finished difference Result 129 states and 166 transitions. [2022-04-28 12:38:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2022-04-28 12:38:42,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:42,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:42,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-28 12:38:42,520 INFO L87 Difference]: Start difference. First operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-28 12:38:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:42,522 INFO L93 Difference]: Finished difference Result 129 states and 166 transitions. [2022-04-28 12:38:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2022-04-28 12:38:42,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:42,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:42,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:42,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 161 transitions. [2022-04-28 12:38:42,525 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 161 transitions. Word has length 55 [2022-04-28 12:38:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:42,525 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 161 transitions. [2022-04-28 12:38:42,525 INFO L496 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-28 12:38:42,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 161 transitions. [2022-04-28 12:38:48,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 159 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 161 transitions. [2022-04-28 12:38:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 12:38:48,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:48,348 INFO L195 NwaCegarLoop]: 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-28 12:38:48,364 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-28 12:38:48,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 12:38:48,563 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-28 12:38:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:48,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788001444] [2022-04-28 12:38:48,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-28 12:38:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:48,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23662254] [2022-04-28 12:38:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:48,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:48,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528062667] [2022-04-28 12:38:48,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:38:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:48,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:48,594 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:48,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 12:38:48,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:38:48,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:48,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:38:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:48,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:48,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {7735#true} call ULTIMATE.init(); {7735#true} is VALID [2022-04-28 12:38:48,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {7735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {7743#(<= ~counter~0 0)} assume true; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7743#(<= ~counter~0 0)} {7735#true} #102#return; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {7743#(<= ~counter~0 0)} call #t~ret9 := main(); {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {7743#(<= ~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; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,907 INFO L272 TraceCheckUtils]: 6: Hoare triple {7743#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {7743#(<= ~counter~0 0)} ~cond := #in~cond; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {7743#(<= ~counter~0 0)} assume !(0 == ~cond); {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {7743#(<= ~counter~0 0)} assume true; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,908 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7743#(<= ~counter~0 0)} {7743#(<= ~counter~0 0)} #90#return; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,908 INFO L272 TraceCheckUtils]: 11: Hoare triple {7743#(<= ~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)); {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {7743#(<= ~counter~0 0)} ~cond := #in~cond; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {7743#(<= ~counter~0 0)} assume !(0 == ~cond); {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {7743#(<= ~counter~0 0)} assume true; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,909 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7743#(<= ~counter~0 0)} {7743#(<= ~counter~0 0)} #92#return; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {7743#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7743#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:48,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {7743#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7792#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:48,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {7792#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {7792#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:48,911 INFO L272 TraceCheckUtils]: 19: Hoare triple {7792#(<= ~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)); {7792#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:48,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {7792#(<= ~counter~0 1)} ~cond := #in~cond; {7792#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:48,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {7792#(<= ~counter~0 1)} assume !(0 == ~cond); {7792#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:48,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {7792#(<= ~counter~0 1)} assume true; {7792#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:48,912 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7792#(<= ~counter~0 1)} {7792#(<= ~counter~0 1)} #94#return; {7792#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:48,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {7792#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7792#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:48,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {7792#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7817#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:48,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {7817#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {7817#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:48,913 INFO L272 TraceCheckUtils]: 27: Hoare triple {7817#(<= ~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)); {7817#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:48,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {7817#(<= ~counter~0 2)} ~cond := #in~cond; {7817#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:48,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {7817#(<= ~counter~0 2)} assume !(0 == ~cond); {7817#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:48,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {7817#(<= ~counter~0 2)} assume true; {7817#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:48,915 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7817#(<= ~counter~0 2)} {7817#(<= ~counter~0 2)} #96#return; {7817#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:48,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {7817#(<= ~counter~0 2)} assume !(~r~0 > 0); {7817#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:48,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {7817#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7842#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:48,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {7842#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {7842#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:48,916 INFO L272 TraceCheckUtils]: 35: Hoare triple {7842#(<= ~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)); {7842#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:48,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {7842#(<= ~counter~0 3)} ~cond := #in~cond; {7842#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:48,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {7842#(<= ~counter~0 3)} assume !(0 == ~cond); {7842#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:48,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {7842#(<= ~counter~0 3)} assume true; {7842#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:48,917 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7842#(<= ~counter~0 3)} {7842#(<= ~counter~0 3)} #98#return; {7842#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:48,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {7842#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7842#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:48,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {7842#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7867#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:48,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {7867#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {7867#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:48,919 INFO L272 TraceCheckUtils]: 43: Hoare triple {7867#(<= ~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)); {7867#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:48,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {7867#(<= ~counter~0 4)} ~cond := #in~cond; {7867#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:48,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {7867#(<= ~counter~0 4)} assume !(0 == ~cond); {7867#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:48,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {7867#(<= ~counter~0 4)} assume true; {7867#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:48,920 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7867#(<= ~counter~0 4)} {7867#(<= ~counter~0 4)} #98#return; {7867#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:48,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {7867#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7867#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:48,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {7867#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7892#(<= |main_#t~post8| 4)} is VALID [2022-04-28 12:38:48,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {7892#(<= |main_#t~post8| 4)} assume !(#t~post8 < 50);havoc #t~post8; {7736#false} is VALID [2022-04-28 12:38:48,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {7736#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7736#false} is VALID [2022-04-28 12:38:48,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {7736#false} assume !(#t~post6 < 50);havoc #t~post6; {7736#false} is VALID [2022-04-28 12:38:48,921 INFO L272 TraceCheckUtils]: 53: Hoare triple {7736#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7736#false} is VALID [2022-04-28 12:38:48,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {7736#false} ~cond := #in~cond; {7736#false} is VALID [2022-04-28 12:38:48,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {7736#false} assume 0 == ~cond; {7736#false} is VALID [2022-04-28 12:38:48,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {7736#false} assume !false; {7736#false} is VALID [2022-04-28 12:38:48,921 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-28 12:38:48,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:49,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {7736#false} assume !false; {7736#false} is VALID [2022-04-28 12:38:49,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {7736#false} assume 0 == ~cond; {7736#false} is VALID [2022-04-28 12:38:49,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {7736#false} ~cond := #in~cond; {7736#false} is VALID [2022-04-28 12:38:49,166 INFO L272 TraceCheckUtils]: 53: Hoare triple {7736#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7736#false} is VALID [2022-04-28 12:38:49,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {7736#false} assume !(#t~post6 < 50);havoc #t~post6; {7736#false} is VALID [2022-04-28 12:38:49,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {7736#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7736#false} is VALID [2022-04-28 12:38:49,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {7932#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {7736#false} is VALID [2022-04-28 12:38:49,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {7936#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7932#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:38:49,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {7936#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7936#(< ~counter~0 50)} is VALID [2022-04-28 12:38:49,168 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7735#true} {7936#(< ~counter~0 50)} #98#return; {7936#(< ~counter~0 50)} is VALID [2022-04-28 12:38:49,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {7735#true} assume true; {7735#true} is VALID [2022-04-28 12:38:49,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {7735#true} assume !(0 == ~cond); {7735#true} is VALID [2022-04-28 12:38:49,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {7735#true} ~cond := #in~cond; {7735#true} is VALID [2022-04-28 12:38:49,168 INFO L272 TraceCheckUtils]: 43: Hoare triple {7936#(< ~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)); {7735#true} is VALID [2022-04-28 12:38:49,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {7936#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {7936#(< ~counter~0 50)} is VALID [2022-04-28 12:38:49,169 INFO L290 TraceCheckUtils]: 41: Hoare triple {7961#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7936#(< ~counter~0 50)} is VALID [2022-04-28 12:38:49,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {7961#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7961#(< ~counter~0 49)} is VALID [2022-04-28 12:38:49,169 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7735#true} {7961#(< ~counter~0 49)} #98#return; {7961#(< ~counter~0 49)} is VALID [2022-04-28 12:38:49,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {7735#true} assume true; {7735#true} is VALID [2022-04-28 12:38:49,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {7735#true} assume !(0 == ~cond); {7735#true} is VALID [2022-04-28 12:38:49,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {7735#true} ~cond := #in~cond; {7735#true} is VALID [2022-04-28 12:38:49,170 INFO L272 TraceCheckUtils]: 35: Hoare triple {7961#(< ~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)); {7735#true} is VALID [2022-04-28 12:38:49,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {7961#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {7961#(< ~counter~0 49)} is VALID [2022-04-28 12:38:49,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {7986#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7961#(< ~counter~0 49)} is VALID [2022-04-28 12:38:49,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {7986#(< ~counter~0 48)} assume !(~r~0 > 0); {7986#(< ~counter~0 48)} is VALID [2022-04-28 12:38:49,171 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7735#true} {7986#(< ~counter~0 48)} #96#return; {7986#(< ~counter~0 48)} is VALID [2022-04-28 12:38:49,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {7735#true} assume true; {7735#true} is VALID [2022-04-28 12:38:49,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {7735#true} assume !(0 == ~cond); {7735#true} is VALID [2022-04-28 12:38:49,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {7735#true} ~cond := #in~cond; {7735#true} is VALID [2022-04-28 12:38:49,171 INFO L272 TraceCheckUtils]: 27: Hoare triple {7986#(< ~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)); {7735#true} is VALID [2022-04-28 12:38:49,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {7986#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {7986#(< ~counter~0 48)} is VALID [2022-04-28 12:38:49,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {8011#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7986#(< ~counter~0 48)} is VALID [2022-04-28 12:38:49,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {8011#(< ~counter~0 47)} assume !!(0 != ~r~0); {8011#(< ~counter~0 47)} is VALID [2022-04-28 12:38:49,173 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7735#true} {8011#(< ~counter~0 47)} #94#return; {8011#(< ~counter~0 47)} is VALID [2022-04-28 12:38:49,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {7735#true} assume true; {7735#true} is VALID [2022-04-28 12:38:49,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {7735#true} assume !(0 == ~cond); {7735#true} is VALID [2022-04-28 12:38:49,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {7735#true} ~cond := #in~cond; {7735#true} is VALID [2022-04-28 12:38:49,173 INFO L272 TraceCheckUtils]: 19: Hoare triple {8011#(< ~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)); {7735#true} is VALID [2022-04-28 12:38:49,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {8011#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {8011#(< ~counter~0 47)} is VALID [2022-04-28 12:38:49,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {8036#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8011#(< ~counter~0 47)} is VALID [2022-04-28 12:38:49,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {8036#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8036#(< ~counter~0 46)} is VALID [2022-04-28 12:38:49,175 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7735#true} {8036#(< ~counter~0 46)} #92#return; {8036#(< ~counter~0 46)} is VALID [2022-04-28 12:38:49,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {7735#true} assume true; {7735#true} is VALID [2022-04-28 12:38:49,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {7735#true} assume !(0 == ~cond); {7735#true} is VALID [2022-04-28 12:38:49,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {7735#true} ~cond := #in~cond; {7735#true} is VALID [2022-04-28 12:38:49,175 INFO L272 TraceCheckUtils]: 11: Hoare triple {8036#(< ~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)); {7735#true} is VALID [2022-04-28 12:38:49,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7735#true} {8036#(< ~counter~0 46)} #90#return; {8036#(< ~counter~0 46)} is VALID [2022-04-28 12:38:49,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {7735#true} assume true; {7735#true} is VALID [2022-04-28 12:38:49,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {7735#true} assume !(0 == ~cond); {7735#true} is VALID [2022-04-28 12:38:49,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {7735#true} ~cond := #in~cond; {7735#true} is VALID [2022-04-28 12:38:49,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {8036#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7735#true} is VALID [2022-04-28 12:38:49,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {8036#(< ~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; {8036#(< ~counter~0 46)} is VALID [2022-04-28 12:38:49,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {8036#(< ~counter~0 46)} call #t~ret9 := main(); {8036#(< ~counter~0 46)} is VALID [2022-04-28 12:38:49,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8036#(< ~counter~0 46)} {7735#true} #102#return; {8036#(< ~counter~0 46)} is VALID [2022-04-28 12:38:49,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {8036#(< ~counter~0 46)} assume true; {8036#(< ~counter~0 46)} is VALID [2022-04-28 12:38:49,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {7735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8036#(< ~counter~0 46)} is VALID [2022-04-28 12:38:49,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {7735#true} call ULTIMATE.init(); {7735#true} is VALID [2022-04-28 12:38:49,196 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-28 12:38:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:49,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23662254] [2022-04-28 12:38:49,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:49,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528062667] [2022-04-28 12:38:49,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528062667] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:49,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:49,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 12:38:49,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:49,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788001444] [2022-04-28 12:38:49,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788001444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:49,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:49,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:38:49,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819069376] [2022-04-28 12:38:49,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:49,197 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-28 12:38:49,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:49,197 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-28 12:38:49,232 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-28 12:38:49,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:38:49,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:49,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:38:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:38:49,233 INFO L87 Difference]: Start difference. First operand 125 states and 161 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-28 12:38:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:49,511 INFO L93 Difference]: Finished difference Result 196 states and 263 transitions. [2022-04-28 12:38:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:38:49,511 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-28 12:38:49,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:49,511 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-28 12:38:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 12:38:49,512 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-28 12:38:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 12:38:49,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-28 12:38:49,590 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-28 12:38:49,592 INFO L225 Difference]: With dead ends: 196 [2022-04-28 12:38:49,592 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 12:38:49,592 INFO L412 NwaCegarLoop]: 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-28 12:38:49,592 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:49,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:38:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 12:38:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2022-04-28 12:38:49,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:49,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 130 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:49,675 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 130 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:49,675 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 130 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:49,678 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2022-04-28 12:38:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 168 transitions. [2022-04-28 12:38:49,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:49,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:49,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 131 states. [2022-04-28 12:38:49,678 INFO L87 Difference]: Start difference. First operand has 130 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 131 states. [2022-04-28 12:38:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:49,680 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2022-04-28 12:38:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 168 transitions. [2022-04-28 12:38:49,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:49,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:49,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:49,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2022-04-28 12:38:49,683 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 57 [2022-04-28 12:38:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:49,683 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2022-04-28 12:38:49,683 INFO L496 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-28 12:38:49,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 167 transitions. [2022-04-28 12:38:55,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 165 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2022-04-28 12:38:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 12:38:55,417 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:55,417 INFO L195 NwaCegarLoop]: 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-28 12:38:55,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:55,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 12:38:55,618 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:55,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-28 12:38:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:55,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1097704396] [2022-04-28 12:38:55,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-28 12:38:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:55,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702896439] [2022-04-28 12:38:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:55,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:55,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637285559] [2022-04-28 12:38:55,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:38:55,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:55,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:55,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:38:55,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 12:38:55,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:38:55,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:55,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:38:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:55,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:55,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {9008#true} call ULTIMATE.init(); {9008#true} is VALID [2022-04-28 12:38:55,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {9008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {9016#(<= ~counter~0 0)} assume true; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9016#(<= ~counter~0 0)} {9008#true} #102#return; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {9016#(<= ~counter~0 0)} call #t~ret9 := main(); {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {9016#(<= ~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; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {9016#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {9016#(<= ~counter~0 0)} ~cond := #in~cond; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {9016#(<= ~counter~0 0)} assume !(0 == ~cond); {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {9016#(<= ~counter~0 0)} assume true; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,983 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9016#(<= ~counter~0 0)} {9016#(<= ~counter~0 0)} #90#return; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,984 INFO L272 TraceCheckUtils]: 11: Hoare triple {9016#(<= ~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)); {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {9016#(<= ~counter~0 0)} ~cond := #in~cond; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {9016#(<= ~counter~0 0)} assume !(0 == ~cond); {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {9016#(<= ~counter~0 0)} assume true; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,985 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9016#(<= ~counter~0 0)} {9016#(<= ~counter~0 0)} #92#return; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {9016#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9016#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:55,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {9016#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9065#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:55,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {9065#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {9065#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:55,987 INFO L272 TraceCheckUtils]: 19: Hoare triple {9065#(<= ~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)); {9065#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:55,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {9065#(<= ~counter~0 1)} ~cond := #in~cond; {9065#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:55,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {9065#(<= ~counter~0 1)} assume !(0 == ~cond); {9065#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:55,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {9065#(<= ~counter~0 1)} assume true; {9065#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:55,988 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9065#(<= ~counter~0 1)} {9065#(<= ~counter~0 1)} #94#return; {9065#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:55,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {9065#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9065#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:55,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {9065#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9090#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:55,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {9090#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {9090#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:55,989 INFO L272 TraceCheckUtils]: 27: Hoare triple {9090#(<= ~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)); {9090#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:55,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {9090#(<= ~counter~0 2)} ~cond := #in~cond; {9090#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:55,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {9090#(<= ~counter~0 2)} assume !(0 == ~cond); {9090#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:55,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {9090#(<= ~counter~0 2)} assume true; {9090#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:55,992 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9090#(<= ~counter~0 2)} {9090#(<= ~counter~0 2)} #96#return; {9090#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:55,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {9090#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9090#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:55,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {9090#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9115#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:55,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {9115#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {9115#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:55,994 INFO L272 TraceCheckUtils]: 35: Hoare triple {9115#(<= ~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)); {9115#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:55,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {9115#(<= ~counter~0 3)} ~cond := #in~cond; {9115#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:55,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {9115#(<= ~counter~0 3)} assume !(0 == ~cond); {9115#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:55,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {9115#(<= ~counter~0 3)} assume true; {9115#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:55,995 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9115#(<= ~counter~0 3)} {9115#(<= ~counter~0 3)} #96#return; {9115#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:55,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {9115#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9115#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:55,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {9115#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9140#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:55,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {9140#(<= ~counter~0 4)} assume !!(#t~post7 < 50);havoc #t~post7; {9140#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:55,997 INFO L272 TraceCheckUtils]: 43: Hoare triple {9140#(<= ~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)); {9140#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:55,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {9140#(<= ~counter~0 4)} ~cond := #in~cond; {9140#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:55,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {9140#(<= ~counter~0 4)} assume !(0 == ~cond); {9140#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:55,997 INFO L290 TraceCheckUtils]: 46: Hoare triple {9140#(<= ~counter~0 4)} assume true; {9140#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:55,998 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9140#(<= ~counter~0 4)} {9140#(<= ~counter~0 4)} #96#return; {9140#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:55,998 INFO L290 TraceCheckUtils]: 48: Hoare triple {9140#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9140#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {9140#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9165#(<= |main_#t~post7| 4)} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 50: Hoare triple {9165#(<= |main_#t~post7| 4)} assume !(#t~post7 < 50);havoc #t~post7; {9009#false} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {9009#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9009#false} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {9009#false} assume !(#t~post8 < 50);havoc #t~post8; {9009#false} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {9009#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9009#false} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {9009#false} assume !(#t~post6 < 50);havoc #t~post6; {9009#false} is VALID [2022-04-28 12:38:55,999 INFO L272 TraceCheckUtils]: 55: Hoare triple {9009#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9009#false} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {9009#false} ~cond := #in~cond; {9009#false} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {9009#false} assume 0 == ~cond; {9009#false} is VALID [2022-04-28 12:38:55,999 INFO L290 TraceCheckUtils]: 58: Hoare triple {9009#false} assume !false; {9009#false} is VALID [2022-04-28 12:38:56,000 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-28 12:38:56,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:56,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {9009#false} assume !false; {9009#false} is VALID [2022-04-28 12:38:56,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {9009#false} assume 0 == ~cond; {9009#false} is VALID [2022-04-28 12:38:56,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {9009#false} ~cond := #in~cond; {9009#false} is VALID [2022-04-28 12:38:56,332 INFO L272 TraceCheckUtils]: 55: Hoare triple {9009#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9009#false} is VALID [2022-04-28 12:38:56,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {9009#false} assume !(#t~post6 < 50);havoc #t~post6; {9009#false} is VALID [2022-04-28 12:38:56,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {9009#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9009#false} is VALID [2022-04-28 12:38:56,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {9009#false} assume !(#t~post8 < 50);havoc #t~post8; {9009#false} is VALID [2022-04-28 12:38:56,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {9009#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9009#false} is VALID [2022-04-28 12:38:56,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {9217#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {9009#false} is VALID [2022-04-28 12:38:56,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {9221#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9217#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:38:56,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {9221#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9221#(< ~counter~0 50)} is VALID [2022-04-28 12:38:56,334 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9008#true} {9221#(< ~counter~0 50)} #96#return; {9221#(< ~counter~0 50)} is VALID [2022-04-28 12:38:56,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-28 12:38:56,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-28 12:38:56,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-28 12:38:56,334 INFO L272 TraceCheckUtils]: 43: Hoare triple {9221#(< ~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)); {9008#true} is VALID [2022-04-28 12:38:56,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {9221#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {9221#(< ~counter~0 50)} is VALID [2022-04-28 12:38:56,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {9246#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9221#(< ~counter~0 50)} is VALID [2022-04-28 12:38:56,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {9246#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9246#(< ~counter~0 49)} is VALID [2022-04-28 12:38:56,336 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9008#true} {9246#(< ~counter~0 49)} #96#return; {9246#(< ~counter~0 49)} is VALID [2022-04-28 12:38:56,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-28 12:38:56,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-28 12:38:56,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-28 12:38:56,351 INFO L272 TraceCheckUtils]: 35: Hoare triple {9246#(< ~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)); {9008#true} is VALID [2022-04-28 12:38:56,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {9246#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {9246#(< ~counter~0 49)} is VALID [2022-04-28 12:38:56,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {9271#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9246#(< ~counter~0 49)} is VALID [2022-04-28 12:38:56,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {9271#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9271#(< ~counter~0 48)} is VALID [2022-04-28 12:38:56,353 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9008#true} {9271#(< ~counter~0 48)} #96#return; {9271#(< ~counter~0 48)} is VALID [2022-04-28 12:38:56,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-28 12:38:56,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-28 12:38:56,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-28 12:38:56,353 INFO L272 TraceCheckUtils]: 27: Hoare triple {9271#(< ~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)); {9008#true} is VALID [2022-04-28 12:38:56,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {9271#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {9271#(< ~counter~0 48)} is VALID [2022-04-28 12:38:56,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {9296#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9271#(< ~counter~0 48)} is VALID [2022-04-28 12:38:56,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {9296#(< ~counter~0 47)} assume !!(0 != ~r~0); {9296#(< ~counter~0 47)} is VALID [2022-04-28 12:38:56,355 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9008#true} {9296#(< ~counter~0 47)} #94#return; {9296#(< ~counter~0 47)} is VALID [2022-04-28 12:38:56,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-28 12:38:56,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-28 12:38:56,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-28 12:38:56,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {9296#(< ~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)); {9008#true} is VALID [2022-04-28 12:38:56,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {9296#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {9296#(< ~counter~0 47)} is VALID [2022-04-28 12:38:56,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {9321#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9296#(< ~counter~0 47)} is VALID [2022-04-28 12:38:56,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {9321#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9321#(< ~counter~0 46)} is VALID [2022-04-28 12:38:56,364 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9008#true} {9321#(< ~counter~0 46)} #92#return; {9321#(< ~counter~0 46)} is VALID [2022-04-28 12:38:56,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-28 12:38:56,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-28 12:38:56,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-28 12:38:56,364 INFO L272 TraceCheckUtils]: 11: Hoare triple {9321#(< ~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)); {9008#true} is VALID [2022-04-28 12:38:56,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9008#true} {9321#(< ~counter~0 46)} #90#return; {9321#(< ~counter~0 46)} is VALID [2022-04-28 12:38:56,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {9008#true} assume true; {9008#true} is VALID [2022-04-28 12:38:56,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {9008#true} assume !(0 == ~cond); {9008#true} is VALID [2022-04-28 12:38:56,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {9008#true} ~cond := #in~cond; {9008#true} is VALID [2022-04-28 12:38:56,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {9321#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9008#true} is VALID [2022-04-28 12:38:56,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#(< ~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; {9321#(< ~counter~0 46)} is VALID [2022-04-28 12:38:56,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#(< ~counter~0 46)} call #t~ret9 := main(); {9321#(< ~counter~0 46)} is VALID [2022-04-28 12:38:56,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#(< ~counter~0 46)} {9008#true} #102#return; {9321#(< ~counter~0 46)} is VALID [2022-04-28 12:38:56,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#(< ~counter~0 46)} assume true; {9321#(< ~counter~0 46)} is VALID [2022-04-28 12:38:56,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {9008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9321#(< ~counter~0 46)} is VALID [2022-04-28 12:38:56,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {9008#true} call ULTIMATE.init(); {9008#true} is VALID [2022-04-28 12:38:56,367 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-28 12:38:56,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702896439] [2022-04-28 12:38:56,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637285559] [2022-04-28 12:38:56,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637285559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:56,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:56,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 12:38:56,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1097704396] [2022-04-28 12:38:56,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1097704396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:56,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:56,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:38:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928557064] [2022-04-28 12:38:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 12:38:56,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:56,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 12:38:56,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:56,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:38:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:56,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:38:56,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:38:56,414 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 12:38:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:56,697 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2022-04-28 12:38:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:38:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 12:38:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 12:38:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 12:38:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 12:38:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 12:38:56,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-28 12:38:56,774 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-28 12:38:56,778 INFO L225 Difference]: With dead ends: 169 [2022-04-28 12:38:56,778 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 12:38:56,778 INFO L412 NwaCegarLoop]: 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-28 12:38:56,779 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:56,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:38:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 12:38:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 12:38:56,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:56,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:56,856 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:56,856 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:56,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:56,859 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2022-04-28 12:38:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2022-04-28 12:38:56,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:56,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:56,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-28 12:38:56,860 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-28 12:38:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:56,861 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2022-04-28 12:38:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2022-04-28 12:38:56,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:56,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:56,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:56,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 25 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 12:38:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2022-04-28 12:38:56,865 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 59 [2022-04-28 12:38:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:56,865 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2022-04-28 12:38:56,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 12:38:56,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 169 transitions. [2022-04-28 12:39:02,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 168 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2022-04-28 12:39:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 12:39:02,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:39:02,183 INFO L195 NwaCegarLoop]: 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-28 12:39:02,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 12:39:02,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 12:39:02,384 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:39:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:39:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-28 12:39:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:02,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2106885098] [2022-04-28 12:39:02,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:39:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-28 12:39:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:39:02,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689430283] [2022-04-28 12:39:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:39:02,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:39:02,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:39:02,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099343581] [2022-04-28 12:39:02,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:39:02,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:39:02,397 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:39:02,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 12:39:02,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:39:02,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:39:02,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 12:39:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:39:02,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:39:02,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {10247#true} call ULTIMATE.init(); {10247#true} is VALID [2022-04-28 12:39:02,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {10247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {10255#(<= ~counter~0 0)} assume true; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10255#(<= ~counter~0 0)} {10247#true} #102#return; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {10255#(<= ~counter~0 0)} call #t~ret9 := main(); {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {10255#(<= ~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; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,725 INFO L272 TraceCheckUtils]: 6: Hoare triple {10255#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {10255#(<= ~counter~0 0)} ~cond := #in~cond; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {10255#(<= ~counter~0 0)} assume !(0 == ~cond); {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {10255#(<= ~counter~0 0)} assume true; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,727 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10255#(<= ~counter~0 0)} {10255#(<= ~counter~0 0)} #90#return; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,727 INFO L272 TraceCheckUtils]: 11: Hoare triple {10255#(<= ~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)); {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {10255#(<= ~counter~0 0)} ~cond := #in~cond; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {10255#(<= ~counter~0 0)} assume !(0 == ~cond); {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {10255#(<= ~counter~0 0)} assume true; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,728 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10255#(<= ~counter~0 0)} {10255#(<= ~counter~0 0)} #92#return; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {10255#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10255#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:02,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {10255#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10304#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:02,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {10304#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10304#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:02,730 INFO L272 TraceCheckUtils]: 19: Hoare triple {10304#(<= ~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)); {10304#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:02,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {10304#(<= ~counter~0 1)} ~cond := #in~cond; {10304#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:02,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {10304#(<= ~counter~0 1)} assume !(0 == ~cond); {10304#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:02,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {10304#(<= ~counter~0 1)} assume true; {10304#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:02,731 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10304#(<= ~counter~0 1)} {10304#(<= ~counter~0 1)} #94#return; {10304#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:02,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {10304#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10304#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:02,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {10304#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10329#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:02,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {10329#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {10329#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:02,732 INFO L272 TraceCheckUtils]: 27: Hoare triple {10329#(<= ~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)); {10329#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:02,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {10329#(<= ~counter~0 2)} ~cond := #in~cond; {10329#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:02,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {10329#(<= ~counter~0 2)} assume !(0 == ~cond); {10329#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:02,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {10329#(<= ~counter~0 2)} assume true; {10329#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:02,734 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10329#(<= ~counter~0 2)} {10329#(<= ~counter~0 2)} #96#return; {10329#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:02,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {10329#(<= ~counter~0 2)} assume !(~r~0 > 0); {10329#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:02,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {10329#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10354#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:02,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {10354#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {10354#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:02,735 INFO L272 TraceCheckUtils]: 35: Hoare triple {10354#(<= ~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)); {10354#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:02,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {10354#(<= ~counter~0 3)} ~cond := #in~cond; {10354#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:02,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {10354#(<= ~counter~0 3)} assume !(0 == ~cond); {10354#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:02,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {10354#(<= ~counter~0 3)} assume true; {10354#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:02,736 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10354#(<= ~counter~0 3)} {10354#(<= ~counter~0 3)} #98#return; {10354#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:02,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {10354#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10354#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:02,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {10354#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10379#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:02,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {10379#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {10379#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:02,738 INFO L272 TraceCheckUtils]: 43: Hoare triple {10379#(<= ~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)); {10379#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:02,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {10379#(<= ~counter~0 4)} ~cond := #in~cond; {10379#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:02,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {10379#(<= ~counter~0 4)} assume !(0 == ~cond); {10379#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:02,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {10379#(<= ~counter~0 4)} assume true; {10379#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:02,739 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10379#(<= ~counter~0 4)} {10379#(<= ~counter~0 4)} #98#return; {10379#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:02,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {10379#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10379#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:02,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {10379#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10404#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:02,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {10404#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {10404#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:02,740 INFO L272 TraceCheckUtils]: 51: Hoare triple {10404#(<= ~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)); {10404#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:02,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {10404#(<= ~counter~0 5)} ~cond := #in~cond; {10404#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:02,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {10404#(<= ~counter~0 5)} assume !(0 == ~cond); {10404#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:02,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {10404#(<= ~counter~0 5)} assume true; {10404#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:02,742 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10404#(<= ~counter~0 5)} {10404#(<= ~counter~0 5)} #98#return; {10404#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:02,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {10404#(<= ~counter~0 5)} assume !(~r~0 < 0); {10404#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:02,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {10404#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10429#(<= |main_#t~post6| 5)} is VALID [2022-04-28 12:39:02,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {10429#(<= |main_#t~post6| 5)} assume !(#t~post6 < 50);havoc #t~post6; {10248#false} is VALID [2022-04-28 12:39:02,743 INFO L272 TraceCheckUtils]: 59: Hoare triple {10248#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10248#false} is VALID [2022-04-28 12:39:02,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {10248#false} ~cond := #in~cond; {10248#false} is VALID [2022-04-28 12:39:02,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {10248#false} assume 0 == ~cond; {10248#false} is VALID [2022-04-28 12:39:02,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {10248#false} assume !false; {10248#false} is VALID [2022-04-28 12:39:02,743 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-28 12:39:02,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:39:03,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {10248#false} assume !false; {10248#false} is VALID [2022-04-28 12:39:03,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {10248#false} assume 0 == ~cond; {10248#false} is VALID [2022-04-28 12:39:03,040 INFO L290 TraceCheckUtils]: 60: Hoare triple {10248#false} ~cond := #in~cond; {10248#false} is VALID [2022-04-28 12:39:03,040 INFO L272 TraceCheckUtils]: 59: Hoare triple {10248#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10248#false} is VALID [2022-04-28 12:39:03,041 INFO L290 TraceCheckUtils]: 58: Hoare triple {10457#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {10248#false} is VALID [2022-04-28 12:39:03,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {10461#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10457#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:39:03,041 INFO L290 TraceCheckUtils]: 56: Hoare triple {10461#(< ~counter~0 50)} assume !(~r~0 < 0); {10461#(< ~counter~0 50)} is VALID [2022-04-28 12:39:03,042 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10247#true} {10461#(< ~counter~0 50)} #98#return; {10461#(< ~counter~0 50)} is VALID [2022-04-28 12:39:03,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {10247#true} assume true; {10247#true} is VALID [2022-04-28 12:39:03,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {10247#true} assume !(0 == ~cond); {10247#true} is VALID [2022-04-28 12:39:03,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {10247#true} ~cond := #in~cond; {10247#true} is VALID [2022-04-28 12:39:03,042 INFO L272 TraceCheckUtils]: 51: Hoare triple {10461#(< ~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)); {10247#true} is VALID [2022-04-28 12:39:03,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {10461#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {10461#(< ~counter~0 50)} is VALID [2022-04-28 12:39:03,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {10486#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10461#(< ~counter~0 50)} is VALID [2022-04-28 12:39:03,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {10486#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10486#(< ~counter~0 49)} is VALID [2022-04-28 12:39:03,043 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10247#true} {10486#(< ~counter~0 49)} #98#return; {10486#(< ~counter~0 49)} is VALID [2022-04-28 12:39:03,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {10247#true} assume true; {10247#true} is VALID [2022-04-28 12:39:03,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {10247#true} assume !(0 == ~cond); {10247#true} is VALID [2022-04-28 12:39:03,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {10247#true} ~cond := #in~cond; {10247#true} is VALID [2022-04-28 12:39:03,043 INFO L272 TraceCheckUtils]: 43: Hoare triple {10486#(< ~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)); {10247#true} is VALID [2022-04-28 12:39:03,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {10486#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {10486#(< ~counter~0 49)} is VALID [2022-04-28 12:39:03,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {10511#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10486#(< ~counter~0 49)} is VALID [2022-04-28 12:39:03,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {10511#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10511#(< ~counter~0 48)} is VALID [2022-04-28 12:39:03,044 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10247#true} {10511#(< ~counter~0 48)} #98#return; {10511#(< ~counter~0 48)} is VALID [2022-04-28 12:39:03,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {10247#true} assume true; {10247#true} is VALID [2022-04-28 12:39:03,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {10247#true} assume !(0 == ~cond); {10247#true} is VALID [2022-04-28 12:39:03,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {10247#true} ~cond := #in~cond; {10247#true} is VALID [2022-04-28 12:39:03,045 INFO L272 TraceCheckUtils]: 35: Hoare triple {10511#(< ~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)); {10247#true} is VALID [2022-04-28 12:39:03,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {10511#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {10511#(< ~counter~0 48)} is VALID [2022-04-28 12:39:03,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {10536#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10511#(< ~counter~0 48)} is VALID [2022-04-28 12:39:03,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {10536#(< ~counter~0 47)} assume !(~r~0 > 0); {10536#(< ~counter~0 47)} is VALID [2022-04-28 12:39:03,046 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10247#true} {10536#(< ~counter~0 47)} #96#return; {10536#(< ~counter~0 47)} is VALID [2022-04-28 12:39:03,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {10247#true} assume true; {10247#true} is VALID [2022-04-28 12:39:03,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {10247#true} assume !(0 == ~cond); {10247#true} is VALID [2022-04-28 12:39:03,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {10247#true} ~cond := #in~cond; {10247#true} is VALID [2022-04-28 12:39:03,046 INFO L272 TraceCheckUtils]: 27: Hoare triple {10536#(< ~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)); {10247#true} is VALID [2022-04-28 12:39:03,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {10536#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {10536#(< ~counter~0 47)} is VALID [2022-04-28 12:39:03,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {10561#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10536#(< ~counter~0 47)} is VALID [2022-04-28 12:39:03,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {10561#(< ~counter~0 46)} assume !!(0 != ~r~0); {10561#(< ~counter~0 46)} is VALID [2022-04-28 12:39:03,048 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10247#true} {10561#(< ~counter~0 46)} #94#return; {10561#(< ~counter~0 46)} is VALID [2022-04-28 12:39:03,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {10247#true} assume true; {10247#true} is VALID [2022-04-28 12:39:03,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {10247#true} assume !(0 == ~cond); {10247#true} is VALID [2022-04-28 12:39:03,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {10247#true} ~cond := #in~cond; {10247#true} is VALID [2022-04-28 12:39:03,048 INFO L272 TraceCheckUtils]: 19: Hoare triple {10561#(< ~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)); {10247#true} is VALID [2022-04-28 12:39:03,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {10561#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {10561#(< ~counter~0 46)} is VALID [2022-04-28 12:39:03,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {10586#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10561#(< ~counter~0 46)} is VALID [2022-04-28 12:39:03,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {10586#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10586#(< ~counter~0 45)} is VALID [2022-04-28 12:39:03,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10247#true} {10586#(< ~counter~0 45)} #92#return; {10586#(< ~counter~0 45)} is VALID [2022-04-28 12:39:03,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {10247#true} assume true; {10247#true} is VALID [2022-04-28 12:39:03,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {10247#true} assume !(0 == ~cond); {10247#true} is VALID [2022-04-28 12:39:03,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {10247#true} ~cond := #in~cond; {10247#true} is VALID [2022-04-28 12:39:03,050 INFO L272 TraceCheckUtils]: 11: Hoare triple {10586#(< ~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)); {10247#true} is VALID [2022-04-28 12:39:03,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10247#true} {10586#(< ~counter~0 45)} #90#return; {10586#(< ~counter~0 45)} is VALID [2022-04-28 12:39:03,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {10247#true} assume true; {10247#true} is VALID [2022-04-28 12:39:03,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {10247#true} assume !(0 == ~cond); {10247#true} is VALID [2022-04-28 12:39:03,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {10247#true} ~cond := #in~cond; {10247#true} is VALID [2022-04-28 12:39:03,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {10586#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10247#true} is VALID [2022-04-28 12:39:03,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {10586#(< ~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; {10586#(< ~counter~0 45)} is VALID [2022-04-28 12:39:03,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {10586#(< ~counter~0 45)} call #t~ret9 := main(); {10586#(< ~counter~0 45)} is VALID [2022-04-28 12:39:03,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10586#(< ~counter~0 45)} {10247#true} #102#return; {10586#(< ~counter~0 45)} is VALID [2022-04-28 12:39:03,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {10586#(< ~counter~0 45)} assume true; {10586#(< ~counter~0 45)} is VALID [2022-04-28 12:39:03,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {10247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10586#(< ~counter~0 45)} is VALID [2022-04-28 12:39:03,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {10247#true} call ULTIMATE.init(); {10247#true} is VALID [2022-04-28 12:39:03,052 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-28 12:39:03,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:39:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689430283] [2022-04-28 12:39:03,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:39:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099343581] [2022-04-28 12:39:03,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099343581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:39:03,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:39:03,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 12:39:03,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:39:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2106885098] [2022-04-28 12:39:03,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2106885098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:03,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:03,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:39:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907883995] [2022-04-28 12:39:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:39:03,053 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-28 12:39:03,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:39:03,053 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-28 12:39:03,079 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-28 12:39:03,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:39:03,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:03,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:39:03,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:39:03,080 INFO L87 Difference]: Start difference. First operand 132 states and 169 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-28 12:39:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:03,385 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2022-04-28 12:39:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:39:03,386 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-28 12:39:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:39:03,386 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-28 12:39:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 12:39:03,387 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-28 12:39:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 12:39:03,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-28 12:39:03,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:03,466 INFO L225 Difference]: With dead ends: 164 [2022-04-28 12:39:03,466 INFO L226 Difference]: Without dead ends: 159 [2022-04-28 12:39:03,466 INFO L412 NwaCegarLoop]: 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-28 12:39:03,466 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 46 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:39:03,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 165 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:39:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-28 12:39:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2022-04-28 12:39:03,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:39:03,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 151 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 113 states have internal predecessors, (135), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:03,575 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 151 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 113 states have internal predecessors, (135), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:03,576 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 151 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 113 states have internal predecessors, (135), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:03,578 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-28 12:39:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-28 12:39:03,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:03,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:03,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 113 states have internal predecessors, (135), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) Second operand 159 states. [2022-04-28 12:39:03,579 INFO L87 Difference]: Start difference. First operand has 151 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 113 states have internal predecessors, (135), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) Second operand 159 states. [2022-04-28 12:39:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:03,581 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-28 12:39:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-28 12:39:03,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:03,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:03,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:39:03,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:39:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 113 states have internal predecessors, (135), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 193 transitions. [2022-04-28 12:39:03,584 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 193 transitions. Word has length 63 [2022-04-28 12:39:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:39:03,584 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 193 transitions. [2022-04-28 12:39:03,584 INFO L496 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-28 12:39:03,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 193 transitions. [2022-04-28 12:39:09,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 193 transitions. [2022-04-28 12:39:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 12:39:09,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:39:09,443 INFO L195 NwaCegarLoop]: 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-28 12:39:09,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 12:39:09,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:09,644 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:39:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:39:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-28 12:39:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:09,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898533702] [2022-04-28 12:39:09,645 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:39:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-28 12:39:09,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:39:09,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504542022] [2022-04-28 12:39:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:39:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:39:09,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:39:09,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769836874] [2022-04-28 12:39:09,668 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:39:09,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:09,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:39:09,671 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:39:09,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 12:39:09,748 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 12:39:09,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:39:09,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 12:39:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:39:09,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:39:10,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {11592#true} call ULTIMATE.init(); {11592#true} is VALID [2022-04-28 12:39:10,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {11592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {11600#(<= ~counter~0 0)} assume true; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11600#(<= ~counter~0 0)} {11592#true} #102#return; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {11600#(<= ~counter~0 0)} call #t~ret9 := main(); {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {11600#(<= ~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; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,037 INFO L272 TraceCheckUtils]: 6: Hoare triple {11600#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {11600#(<= ~counter~0 0)} ~cond := #in~cond; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {11600#(<= ~counter~0 0)} assume !(0 == ~cond); {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {11600#(<= ~counter~0 0)} assume true; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,038 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11600#(<= ~counter~0 0)} {11600#(<= ~counter~0 0)} #90#return; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,039 INFO L272 TraceCheckUtils]: 11: Hoare triple {11600#(<= ~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)); {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {11600#(<= ~counter~0 0)} ~cond := #in~cond; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {11600#(<= ~counter~0 0)} assume !(0 == ~cond); {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {11600#(<= ~counter~0 0)} assume true; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,040 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11600#(<= ~counter~0 0)} {11600#(<= ~counter~0 0)} #92#return; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {11600#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11600#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:10,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {11600#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11649#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:10,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {11649#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {11649#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:10,041 INFO L272 TraceCheckUtils]: 19: Hoare triple {11649#(<= ~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)); {11649#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:10,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {11649#(<= ~counter~0 1)} ~cond := #in~cond; {11649#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:10,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {11649#(<= ~counter~0 1)} assume !(0 == ~cond); {11649#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:10,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {11649#(<= ~counter~0 1)} assume true; {11649#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:10,042 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11649#(<= ~counter~0 1)} {11649#(<= ~counter~0 1)} #94#return; {11649#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:10,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {11649#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11649#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:10,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {11649#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11674#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:10,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {11674#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {11674#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:10,044 INFO L272 TraceCheckUtils]: 27: Hoare triple {11674#(<= ~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)); {11674#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:10,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {11674#(<= ~counter~0 2)} ~cond := #in~cond; {11674#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:10,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {11674#(<= ~counter~0 2)} assume !(0 == ~cond); {11674#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:10,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {11674#(<= ~counter~0 2)} assume true; {11674#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:10,045 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11674#(<= ~counter~0 2)} {11674#(<= ~counter~0 2)} #96#return; {11674#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:10,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {11674#(<= ~counter~0 2)} assume !(~r~0 > 0); {11674#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:10,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {11674#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11699#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:10,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {11699#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {11699#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:10,046 INFO L272 TraceCheckUtils]: 35: Hoare triple {11699#(<= ~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)); {11699#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:10,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {11699#(<= ~counter~0 3)} ~cond := #in~cond; {11699#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:10,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {11699#(<= ~counter~0 3)} assume !(0 == ~cond); {11699#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:10,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {11699#(<= ~counter~0 3)} assume true; {11699#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:10,047 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11699#(<= ~counter~0 3)} {11699#(<= ~counter~0 3)} #98#return; {11699#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:10,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {11699#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11699#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:10,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {11699#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11724#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:10,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {11724#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {11724#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:10,048 INFO L272 TraceCheckUtils]: 43: Hoare triple {11724#(<= ~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)); {11724#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:10,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {11724#(<= ~counter~0 4)} ~cond := #in~cond; {11724#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:10,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {11724#(<= ~counter~0 4)} assume !(0 == ~cond); {11724#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:10,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {11724#(<= ~counter~0 4)} assume true; {11724#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:10,053 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11724#(<= ~counter~0 4)} {11724#(<= ~counter~0 4)} #98#return; {11724#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:10,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {11724#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11724#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:10,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {11724#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11749#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:10,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {11749#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {11749#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:10,054 INFO L272 TraceCheckUtils]: 51: Hoare triple {11749#(<= ~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)); {11749#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:10,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {11749#(<= ~counter~0 5)} ~cond := #in~cond; {11749#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:10,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {11749#(<= ~counter~0 5)} assume !(0 == ~cond); {11749#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:10,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {11749#(<= ~counter~0 5)} assume true; {11749#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:10,055 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11749#(<= ~counter~0 5)} {11749#(<= ~counter~0 5)} #98#return; {11749#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:10,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {11749#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11749#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:10,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {11749#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11774#(<= |main_#t~post8| 5)} is VALID [2022-04-28 12:39:10,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {11774#(<= |main_#t~post8| 5)} assume !(#t~post8 < 50);havoc #t~post8; {11593#false} is VALID [2022-04-28 12:39:10,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {11593#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11593#false} is VALID [2022-04-28 12:39:10,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {11593#false} assume !(#t~post6 < 50);havoc #t~post6; {11593#false} is VALID [2022-04-28 12:39:10,077 INFO L272 TraceCheckUtils]: 61: Hoare triple {11593#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11593#false} is VALID [2022-04-28 12:39:10,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {11593#false} ~cond := #in~cond; {11593#false} is VALID [2022-04-28 12:39:10,077 INFO L290 TraceCheckUtils]: 63: Hoare triple {11593#false} assume 0 == ~cond; {11593#false} is VALID [2022-04-28 12:39:10,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {11593#false} assume !false; {11593#false} is VALID [2022-04-28 12:39:10,077 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-28 12:39:10,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:39:10,356 INFO L290 TraceCheckUtils]: 64: Hoare triple {11593#false} assume !false; {11593#false} is VALID [2022-04-28 12:39:10,356 INFO L290 TraceCheckUtils]: 63: Hoare triple {11593#false} assume 0 == ~cond; {11593#false} is VALID [2022-04-28 12:39:10,356 INFO L290 TraceCheckUtils]: 62: Hoare triple {11593#false} ~cond := #in~cond; {11593#false} is VALID [2022-04-28 12:39:10,356 INFO L272 TraceCheckUtils]: 61: Hoare triple {11593#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11593#false} is VALID [2022-04-28 12:39:10,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {11593#false} assume !(#t~post6 < 50);havoc #t~post6; {11593#false} is VALID [2022-04-28 12:39:10,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {11593#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11593#false} is VALID [2022-04-28 12:39:10,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {11814#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {11593#false} is VALID [2022-04-28 12:39:10,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {11818#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11814#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:39:10,357 INFO L290 TraceCheckUtils]: 56: Hoare triple {11818#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11818#(< ~counter~0 50)} is VALID [2022-04-28 12:39:10,359 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11592#true} {11818#(< ~counter~0 50)} #98#return; {11818#(< ~counter~0 50)} is VALID [2022-04-28 12:39:10,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {11592#true} assume true; {11592#true} is VALID [2022-04-28 12:39:10,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {11592#true} assume !(0 == ~cond); {11592#true} is VALID [2022-04-28 12:39:10,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {11592#true} ~cond := #in~cond; {11592#true} is VALID [2022-04-28 12:39:10,359 INFO L272 TraceCheckUtils]: 51: Hoare triple {11818#(< ~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)); {11592#true} is VALID [2022-04-28 12:39:10,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {11818#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {11818#(< ~counter~0 50)} is VALID [2022-04-28 12:39:10,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {11843#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11818#(< ~counter~0 50)} is VALID [2022-04-28 12:39:10,360 INFO L290 TraceCheckUtils]: 48: Hoare triple {11843#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11843#(< ~counter~0 49)} is VALID [2022-04-28 12:39:10,360 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11592#true} {11843#(< ~counter~0 49)} #98#return; {11843#(< ~counter~0 49)} is VALID [2022-04-28 12:39:10,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {11592#true} assume true; {11592#true} is VALID [2022-04-28 12:39:10,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {11592#true} assume !(0 == ~cond); {11592#true} is VALID [2022-04-28 12:39:10,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {11592#true} ~cond := #in~cond; {11592#true} is VALID [2022-04-28 12:39:10,361 INFO L272 TraceCheckUtils]: 43: Hoare triple {11843#(< ~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)); {11592#true} is VALID [2022-04-28 12:39:10,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {11843#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {11843#(< ~counter~0 49)} is VALID [2022-04-28 12:39:10,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {11868#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11843#(< ~counter~0 49)} is VALID [2022-04-28 12:39:10,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {11868#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11868#(< ~counter~0 48)} is VALID [2022-04-28 12:39:10,362 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11592#true} {11868#(< ~counter~0 48)} #98#return; {11868#(< ~counter~0 48)} is VALID [2022-04-28 12:39:10,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {11592#true} assume true; {11592#true} is VALID [2022-04-28 12:39:10,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {11592#true} assume !(0 == ~cond); {11592#true} is VALID [2022-04-28 12:39:10,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {11592#true} ~cond := #in~cond; {11592#true} is VALID [2022-04-28 12:39:10,362 INFO L272 TraceCheckUtils]: 35: Hoare triple {11868#(< ~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)); {11592#true} is VALID [2022-04-28 12:39:10,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {11868#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {11868#(< ~counter~0 48)} is VALID [2022-04-28 12:39:10,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {11893#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11868#(< ~counter~0 48)} is VALID [2022-04-28 12:39:10,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {11893#(< ~counter~0 47)} assume !(~r~0 > 0); {11893#(< ~counter~0 47)} is VALID [2022-04-28 12:39:10,363 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11592#true} {11893#(< ~counter~0 47)} #96#return; {11893#(< ~counter~0 47)} is VALID [2022-04-28 12:39:10,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {11592#true} assume true; {11592#true} is VALID [2022-04-28 12:39:10,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {11592#true} assume !(0 == ~cond); {11592#true} is VALID [2022-04-28 12:39:10,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {11592#true} ~cond := #in~cond; {11592#true} is VALID [2022-04-28 12:39:10,363 INFO L272 TraceCheckUtils]: 27: Hoare triple {11893#(< ~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)); {11592#true} is VALID [2022-04-28 12:39:10,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {11893#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {11893#(< ~counter~0 47)} is VALID [2022-04-28 12:39:10,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {11918#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11893#(< ~counter~0 47)} is VALID [2022-04-28 12:39:10,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {11918#(< ~counter~0 46)} assume !!(0 != ~r~0); {11918#(< ~counter~0 46)} is VALID [2022-04-28 12:39:10,369 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11592#true} {11918#(< ~counter~0 46)} #94#return; {11918#(< ~counter~0 46)} is VALID [2022-04-28 12:39:10,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {11592#true} assume true; {11592#true} is VALID [2022-04-28 12:39:10,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {11592#true} assume !(0 == ~cond); {11592#true} is VALID [2022-04-28 12:39:10,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {11592#true} ~cond := #in~cond; {11592#true} is VALID [2022-04-28 12:39:10,369 INFO L272 TraceCheckUtils]: 19: Hoare triple {11918#(< ~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)); {11592#true} is VALID [2022-04-28 12:39:10,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {11918#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {11918#(< ~counter~0 46)} is VALID [2022-04-28 12:39:10,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {11943#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11918#(< ~counter~0 46)} is VALID [2022-04-28 12:39:10,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {11943#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11943#(< ~counter~0 45)} is VALID [2022-04-28 12:39:10,370 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11592#true} {11943#(< ~counter~0 45)} #92#return; {11943#(< ~counter~0 45)} is VALID [2022-04-28 12:39:10,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {11592#true} assume true; {11592#true} is VALID [2022-04-28 12:39:10,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {11592#true} assume !(0 == ~cond); {11592#true} is VALID [2022-04-28 12:39:10,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {11592#true} ~cond := #in~cond; {11592#true} is VALID [2022-04-28 12:39:10,370 INFO L272 TraceCheckUtils]: 11: Hoare triple {11943#(< ~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)); {11592#true} is VALID [2022-04-28 12:39:10,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11592#true} {11943#(< ~counter~0 45)} #90#return; {11943#(< ~counter~0 45)} is VALID [2022-04-28 12:39:10,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {11592#true} assume true; {11592#true} is VALID [2022-04-28 12:39:10,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {11592#true} assume !(0 == ~cond); {11592#true} is VALID [2022-04-28 12:39:10,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {11592#true} ~cond := #in~cond; {11592#true} is VALID [2022-04-28 12:39:10,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {11943#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11592#true} is VALID [2022-04-28 12:39:10,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {11943#(< ~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; {11943#(< ~counter~0 45)} is VALID [2022-04-28 12:39:10,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {11943#(< ~counter~0 45)} call #t~ret9 := main(); {11943#(< ~counter~0 45)} is VALID [2022-04-28 12:39:10,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11943#(< ~counter~0 45)} {11592#true} #102#return; {11943#(< ~counter~0 45)} is VALID [2022-04-28 12:39:10,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {11943#(< ~counter~0 45)} assume true; {11943#(< ~counter~0 45)} is VALID [2022-04-28 12:39:10,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {11592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11943#(< ~counter~0 45)} is VALID [2022-04-28 12:39:10,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {11592#true} call ULTIMATE.init(); {11592#true} is VALID [2022-04-28 12:39:10,373 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-28 12:39:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:39:10,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504542022] [2022-04-28 12:39:10,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:39:10,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769836874] [2022-04-28 12:39:10,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769836874] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:39:10,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:39:10,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 12:39:10,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:39:10,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898533702] [2022-04-28 12:39:10,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898533702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:10,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:10,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:39:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027487694] [2022-04-28 12:39:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:39:10,374 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-28 12:39:10,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:39:10,374 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-28 12:39:10,402 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-28 12:39:10,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:39:10,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:10,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:39:10,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:39:10,403 INFO L87 Difference]: Start difference. First operand 151 states and 193 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-28 12:39:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:10,720 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2022-04-28 12:39:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:39:10,720 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-28 12:39:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:39:10,721 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-28 12:39:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-28 12:39:10,722 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-28 12:39:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-28 12:39:10,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-28 12:39:10,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:10,835 INFO L225 Difference]: With dead ends: 226 [2022-04-28 12:39:10,835 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 12:39:10,836 INFO L412 NwaCegarLoop]: 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-28 12:39:10,836 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:39:10,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 171 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:39:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 12:39:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2022-04-28 12:39:10,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:39:10,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 156 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 117 states have internal predecessors, (141), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:10,963 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 156 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 117 states have internal predecessors, (141), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:10,963 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 156 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 117 states have internal predecessors, (141), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:10,965 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-28 12:39:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-28 12:39:10,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:10,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:10,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 117 states have internal predecessors, (141), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 161 states. [2022-04-28 12:39:10,966 INFO L87 Difference]: Start difference. First operand has 156 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 117 states have internal predecessors, (141), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 161 states. [2022-04-28 12:39:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:10,969 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-28 12:39:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-28 12:39:10,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:10,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:10,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:39:10,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:39:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 117 states have internal predecessors, (141), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2022-04-28 12:39:10,972 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 65 [2022-04-28 12:39:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:39:10,980 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2022-04-28 12:39:10,980 INFO L496 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-28 12:39:10,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 199 transitions. [2022-04-28 12:39:19,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 196 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2022-04-28 12:39:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 12:39:19,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:39:19,646 INFO L195 NwaCegarLoop]: 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-28 12:39:19,662 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-28 12:39:19,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 12:39:19,846 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:39:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:39:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-28 12:39:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:19,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825974288] [2022-04-28 12:39:19,847 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:39:19,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-28 12:39:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:39:19,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055890250] [2022-04-28 12:39:19,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:39:19,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:39:19,857 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:39:19,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305824591] [2022-04-28 12:39:19,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:39:19,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:39:19,864 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:39:19,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 12:39:19,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:39:19,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:39:19,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 12:39:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:39:19,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:39:20,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {13089#true} call ULTIMATE.init(); {13089#true} is VALID [2022-04-28 12:39:20,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {13089#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {13097#(<= ~counter~0 0)} assume true; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13097#(<= ~counter~0 0)} {13089#true} #102#return; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {13097#(<= ~counter~0 0)} call #t~ret9 := main(); {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {13097#(<= ~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; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {13097#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {13097#(<= ~counter~0 0)} ~cond := #in~cond; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {13097#(<= ~counter~0 0)} assume !(0 == ~cond); {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {13097#(<= ~counter~0 0)} assume true; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13097#(<= ~counter~0 0)} {13097#(<= ~counter~0 0)} #90#return; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,187 INFO L272 TraceCheckUtils]: 11: Hoare triple {13097#(<= ~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)); {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {13097#(<= ~counter~0 0)} ~cond := #in~cond; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {13097#(<= ~counter~0 0)} assume !(0 == ~cond); {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {13097#(<= ~counter~0 0)} assume true; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,188 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13097#(<= ~counter~0 0)} {13097#(<= ~counter~0 0)} #92#return; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {13097#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13097#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:20,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {13097#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13146#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:20,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {13146#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {13146#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:20,189 INFO L272 TraceCheckUtils]: 19: Hoare triple {13146#(<= ~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)); {13146#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:20,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {13146#(<= ~counter~0 1)} ~cond := #in~cond; {13146#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:20,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {13146#(<= ~counter~0 1)} assume !(0 == ~cond); {13146#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:20,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {13146#(<= ~counter~0 1)} assume true; {13146#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:20,190 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13146#(<= ~counter~0 1)} {13146#(<= ~counter~0 1)} #94#return; {13146#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:20,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {13146#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13146#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:20,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {13146#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13171#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:20,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {13171#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {13171#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:20,191 INFO L272 TraceCheckUtils]: 27: Hoare triple {13171#(<= ~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)); {13171#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:20,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {13171#(<= ~counter~0 2)} ~cond := #in~cond; {13171#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:20,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {13171#(<= ~counter~0 2)} assume !(0 == ~cond); {13171#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:20,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {13171#(<= ~counter~0 2)} assume true; {13171#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:20,192 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13171#(<= ~counter~0 2)} {13171#(<= ~counter~0 2)} #96#return; {13171#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:20,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {13171#(<= ~counter~0 2)} assume !(~r~0 > 0); {13171#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:20,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {13171#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13196#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:20,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {13196#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {13196#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:20,193 INFO L272 TraceCheckUtils]: 35: Hoare triple {13196#(<= ~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)); {13196#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:20,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {13196#(<= ~counter~0 3)} ~cond := #in~cond; {13196#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:20,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {13196#(<= ~counter~0 3)} assume !(0 == ~cond); {13196#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:20,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {13196#(<= ~counter~0 3)} assume true; {13196#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:20,194 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13196#(<= ~counter~0 3)} {13196#(<= ~counter~0 3)} #98#return; {13196#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:20,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {13196#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13196#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:20,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {13196#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13221#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:20,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {13221#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {13221#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:20,196 INFO L272 TraceCheckUtils]: 43: Hoare triple {13221#(<= ~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)); {13221#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:20,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {13221#(<= ~counter~0 4)} ~cond := #in~cond; {13221#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:20,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {13221#(<= ~counter~0 4)} assume !(0 == ~cond); {13221#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:20,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {13221#(<= ~counter~0 4)} assume true; {13221#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:20,197 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13221#(<= ~counter~0 4)} {13221#(<= ~counter~0 4)} #98#return; {13221#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:20,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {13221#(<= ~counter~0 4)} assume !(~r~0 < 0); {13221#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:20,197 INFO L290 TraceCheckUtils]: 49: Hoare triple {13221#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13246#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:20,197 INFO L290 TraceCheckUtils]: 50: Hoare triple {13246#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {13246#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:20,198 INFO L272 TraceCheckUtils]: 51: Hoare triple {13246#(<= ~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)); {13246#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:20,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {13246#(<= ~counter~0 5)} ~cond := #in~cond; {13246#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:20,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {13246#(<= ~counter~0 5)} assume !(0 == ~cond); {13246#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:20,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {13246#(<= ~counter~0 5)} assume true; {13246#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:20,199 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13246#(<= ~counter~0 5)} {13246#(<= ~counter~0 5)} #94#return; {13246#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:20,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {13246#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13246#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:20,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {13246#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13271#(<= |main_#t~post7| 5)} is VALID [2022-04-28 12:39:20,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {13271#(<= |main_#t~post7| 5)} assume !(#t~post7 < 50);havoc #t~post7; {13090#false} is VALID [2022-04-28 12:39:20,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {13090#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13090#false} is VALID [2022-04-28 12:39:20,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {13090#false} assume !(#t~post8 < 50);havoc #t~post8; {13090#false} is VALID [2022-04-28 12:39:20,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {13090#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13090#false} is VALID [2022-04-28 12:39:20,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {13090#false} assume !(#t~post6 < 50);havoc #t~post6; {13090#false} is VALID [2022-04-28 12:39:20,200 INFO L272 TraceCheckUtils]: 63: Hoare triple {13090#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13090#false} is VALID [2022-04-28 12:39:20,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {13090#false} ~cond := #in~cond; {13090#false} is VALID [2022-04-28 12:39:20,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {13090#false} assume 0 == ~cond; {13090#false} is VALID [2022-04-28 12:39:20,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {13090#false} assume !false; {13090#false} is VALID [2022-04-28 12:39:20,200 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-28 12:39:20,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:39:20,458 INFO L290 TraceCheckUtils]: 66: Hoare triple {13090#false} assume !false; {13090#false} is VALID [2022-04-28 12:39:20,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {13090#false} assume 0 == ~cond; {13090#false} is VALID [2022-04-28 12:39:20,458 INFO L290 TraceCheckUtils]: 64: Hoare triple {13090#false} ~cond := #in~cond; {13090#false} is VALID [2022-04-28 12:39:20,458 INFO L272 TraceCheckUtils]: 63: Hoare triple {13090#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13090#false} is VALID [2022-04-28 12:39:20,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {13090#false} assume !(#t~post6 < 50);havoc #t~post6; {13090#false} is VALID [2022-04-28 12:39:20,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {13090#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13090#false} is VALID [2022-04-28 12:39:20,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {13090#false} assume !(#t~post8 < 50);havoc #t~post8; {13090#false} is VALID [2022-04-28 12:39:20,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {13090#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13090#false} is VALID [2022-04-28 12:39:20,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {13323#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {13090#false} is VALID [2022-04-28 12:39:20,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {13327#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13323#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:39:20,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {13327#(< ~counter~0 50)} assume !!(0 != ~r~0); {13327#(< ~counter~0 50)} is VALID [2022-04-28 12:39:20,460 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13089#true} {13327#(< ~counter~0 50)} #94#return; {13327#(< ~counter~0 50)} is VALID [2022-04-28 12:39:20,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {13089#true} assume true; {13089#true} is VALID [2022-04-28 12:39:20,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {13089#true} assume !(0 == ~cond); {13089#true} is VALID [2022-04-28 12:39:20,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {13089#true} ~cond := #in~cond; {13089#true} is VALID [2022-04-28 12:39:20,460 INFO L272 TraceCheckUtils]: 51: Hoare triple {13327#(< ~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)); {13089#true} is VALID [2022-04-28 12:39:20,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {13327#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {13327#(< ~counter~0 50)} is VALID [2022-04-28 12:39:20,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {13352#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13327#(< ~counter~0 50)} is VALID [2022-04-28 12:39:20,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {13352#(< ~counter~0 49)} assume !(~r~0 < 0); {13352#(< ~counter~0 49)} is VALID [2022-04-28 12:39:20,461 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13089#true} {13352#(< ~counter~0 49)} #98#return; {13352#(< ~counter~0 49)} is VALID [2022-04-28 12:39:20,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {13089#true} assume true; {13089#true} is VALID [2022-04-28 12:39:20,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {13089#true} assume !(0 == ~cond); {13089#true} is VALID [2022-04-28 12:39:20,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {13089#true} ~cond := #in~cond; {13089#true} is VALID [2022-04-28 12:39:20,461 INFO L272 TraceCheckUtils]: 43: Hoare triple {13352#(< ~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)); {13089#true} is VALID [2022-04-28 12:39:20,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {13352#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {13352#(< ~counter~0 49)} is VALID [2022-04-28 12:39:20,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {13377#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13352#(< ~counter~0 49)} is VALID [2022-04-28 12:39:20,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {13377#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13377#(< ~counter~0 48)} is VALID [2022-04-28 12:39:20,462 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13089#true} {13377#(< ~counter~0 48)} #98#return; {13377#(< ~counter~0 48)} is VALID [2022-04-28 12:39:20,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {13089#true} assume true; {13089#true} is VALID [2022-04-28 12:39:20,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {13089#true} assume !(0 == ~cond); {13089#true} is VALID [2022-04-28 12:39:20,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {13089#true} ~cond := #in~cond; {13089#true} is VALID [2022-04-28 12:39:20,463 INFO L272 TraceCheckUtils]: 35: Hoare triple {13377#(< ~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)); {13089#true} is VALID [2022-04-28 12:39:20,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {13377#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {13377#(< ~counter~0 48)} is VALID [2022-04-28 12:39:20,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {13402#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13377#(< ~counter~0 48)} is VALID [2022-04-28 12:39:20,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {13402#(< ~counter~0 47)} assume !(~r~0 > 0); {13402#(< ~counter~0 47)} is VALID [2022-04-28 12:39:20,464 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13089#true} {13402#(< ~counter~0 47)} #96#return; {13402#(< ~counter~0 47)} is VALID [2022-04-28 12:39:20,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {13089#true} assume true; {13089#true} is VALID [2022-04-28 12:39:20,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {13089#true} assume !(0 == ~cond); {13089#true} is VALID [2022-04-28 12:39:20,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {13089#true} ~cond := #in~cond; {13089#true} is VALID [2022-04-28 12:39:20,464 INFO L272 TraceCheckUtils]: 27: Hoare triple {13402#(< ~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)); {13089#true} is VALID [2022-04-28 12:39:20,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {13402#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {13402#(< ~counter~0 47)} is VALID [2022-04-28 12:39:20,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {13427#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13402#(< ~counter~0 47)} is VALID [2022-04-28 12:39:20,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {13427#(< ~counter~0 46)} assume !!(0 != ~r~0); {13427#(< ~counter~0 46)} is VALID [2022-04-28 12:39:20,465 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13089#true} {13427#(< ~counter~0 46)} #94#return; {13427#(< ~counter~0 46)} is VALID [2022-04-28 12:39:20,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {13089#true} assume true; {13089#true} is VALID [2022-04-28 12:39:20,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {13089#true} assume !(0 == ~cond); {13089#true} is VALID [2022-04-28 12:39:20,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {13089#true} ~cond := #in~cond; {13089#true} is VALID [2022-04-28 12:39:20,465 INFO L272 TraceCheckUtils]: 19: Hoare triple {13427#(< ~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)); {13089#true} is VALID [2022-04-28 12:39:20,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {13427#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {13427#(< ~counter~0 46)} is VALID [2022-04-28 12:39:20,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {13452#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13427#(< ~counter~0 46)} is VALID [2022-04-28 12:39:20,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {13452#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13452#(< ~counter~0 45)} is VALID [2022-04-28 12:39:20,467 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13089#true} {13452#(< ~counter~0 45)} #92#return; {13452#(< ~counter~0 45)} is VALID [2022-04-28 12:39:20,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {13089#true} assume true; {13089#true} is VALID [2022-04-28 12:39:20,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {13089#true} assume !(0 == ~cond); {13089#true} is VALID [2022-04-28 12:39:20,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {13089#true} ~cond := #in~cond; {13089#true} is VALID [2022-04-28 12:39:20,467 INFO L272 TraceCheckUtils]: 11: Hoare triple {13452#(< ~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)); {13089#true} is VALID [2022-04-28 12:39:20,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13089#true} {13452#(< ~counter~0 45)} #90#return; {13452#(< ~counter~0 45)} is VALID [2022-04-28 12:39:20,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {13089#true} assume true; {13089#true} is VALID [2022-04-28 12:39:20,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {13089#true} assume !(0 == ~cond); {13089#true} is VALID [2022-04-28 12:39:20,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {13089#true} ~cond := #in~cond; {13089#true} is VALID [2022-04-28 12:39:20,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {13452#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13089#true} is VALID [2022-04-28 12:39:20,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {13452#(< ~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; {13452#(< ~counter~0 45)} is VALID [2022-04-28 12:39:20,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {13452#(< ~counter~0 45)} call #t~ret9 := main(); {13452#(< ~counter~0 45)} is VALID [2022-04-28 12:39:20,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13452#(< ~counter~0 45)} {13089#true} #102#return; {13452#(< ~counter~0 45)} is VALID [2022-04-28 12:39:20,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {13452#(< ~counter~0 45)} assume true; {13452#(< ~counter~0 45)} is VALID [2022-04-28 12:39:20,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {13089#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13452#(< ~counter~0 45)} is VALID [2022-04-28 12:39:20,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {13089#true} call ULTIMATE.init(); {13089#true} is VALID [2022-04-28 12:39:20,469 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-28 12:39:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:39:20,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055890250] [2022-04-28 12:39:20,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:39:20,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305824591] [2022-04-28 12:39:20,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305824591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:39:20,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:39:20,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 12:39:20,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:39:20,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825974288] [2022-04-28 12:39:20,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825974288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:20,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:20,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:39:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515571534] [2022-04-28 12:39:20,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:39:20,470 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-28 12:39:20,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:39:20,471 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-28 12:39:20,500 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-28 12:39:20,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:39:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:20,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:39:20,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:39:20,504 INFO L87 Difference]: Start difference. First operand 156 states and 199 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-28 12:39:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:20,888 INFO L93 Difference]: Finished difference Result 229 states and 303 transitions. [2022-04-28 12:39:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:39:20,888 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-28 12:39:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:39:20,888 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-28 12:39:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-28 12:39:20,890 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-28 12:39:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-28 12:39:20,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-28 12:39:20,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:21,000 INFO L225 Difference]: With dead ends: 229 [2022-04-28 12:39:21,000 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 12:39:21,000 INFO L412 NwaCegarLoop]: 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-28 12:39:21,001 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:39:21,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 174 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:39:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 12:39:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-28 12:39:21,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:39:21,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:21,128 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:21,129 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:21,132 INFO L93 Difference]: Finished difference Result 164 states and 207 transitions. [2022-04-28 12:39:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 207 transitions. [2022-04-28 12:39:21,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:21,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:21,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 164 states. [2022-04-28 12:39:21,133 INFO L87 Difference]: Start difference. First operand has 164 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 164 states. [2022-04-28 12:39:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:21,139 INFO L93 Difference]: Finished difference Result 164 states and 207 transitions. [2022-04-28 12:39:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 207 transitions. [2022-04-28 12:39:21,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:21,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:21,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:39:21,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:39:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 123 states have internal predecessors, (149), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 12:39:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 207 transitions. [2022-04-28 12:39:21,142 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 207 transitions. Word has length 67 [2022-04-28 12:39:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:39:21,143 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 207 transitions. [2022-04-28 12:39:21,143 INFO L496 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-28 12:39:21,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 207 transitions. [2022-04-28 12:39:26,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 206 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 207 transitions. [2022-04-28 12:39:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 12:39:26,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:39:26,507 INFO L195 NwaCegarLoop]: 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-28 12:39:26,525 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-28 12:39:26,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 12:39:26,708 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:39:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:39:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-28 12:39:26,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:26,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1735810372] [2022-04-28 12:39:26,709 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:39:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-28 12:39:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:39:26,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114441007] [2022-04-28 12:39:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:39:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:39:26,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:39:26,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767374255] [2022-04-28 12:39:26,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:39:26,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:26,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:39:26,725 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:39:26,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 12:39:26,791 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:39:26,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:39:26,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:39:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:39:26,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:39:27,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {14628#true} call ULTIMATE.init(); {14628#true} is VALID [2022-04-28 12:39:27,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {14628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {14636#(<= ~counter~0 0)} assume true; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14636#(<= ~counter~0 0)} {14628#true} #102#return; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {14636#(<= ~counter~0 0)} call #t~ret9 := main(); {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {14636#(<= ~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; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {14636#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {14636#(<= ~counter~0 0)} ~cond := #in~cond; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {14636#(<= ~counter~0 0)} assume !(0 == ~cond); {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {14636#(<= ~counter~0 0)} assume true; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14636#(<= ~counter~0 0)} {14636#(<= ~counter~0 0)} #90#return; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,177 INFO L272 TraceCheckUtils]: 11: Hoare triple {14636#(<= ~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)); {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {14636#(<= ~counter~0 0)} ~cond := #in~cond; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {14636#(<= ~counter~0 0)} assume !(0 == ~cond); {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {14636#(<= ~counter~0 0)} assume true; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14636#(<= ~counter~0 0)} {14636#(<= ~counter~0 0)} #92#return; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {14636#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14636#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:27,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {14636#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14685#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:27,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {14685#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {14685#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:27,180 INFO L272 TraceCheckUtils]: 19: Hoare triple {14685#(<= ~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)); {14685#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:27,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {14685#(<= ~counter~0 1)} ~cond := #in~cond; {14685#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:27,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {14685#(<= ~counter~0 1)} assume !(0 == ~cond); {14685#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:27,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {14685#(<= ~counter~0 1)} assume true; {14685#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:27,181 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14685#(<= ~counter~0 1)} {14685#(<= ~counter~0 1)} #94#return; {14685#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:27,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {14685#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14685#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:27,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {14685#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14710#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:27,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {14710#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {14710#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:27,182 INFO L272 TraceCheckUtils]: 27: Hoare triple {14710#(<= ~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)); {14710#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:27,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {14710#(<= ~counter~0 2)} ~cond := #in~cond; {14710#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:27,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {14710#(<= ~counter~0 2)} assume !(0 == ~cond); {14710#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:27,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {14710#(<= ~counter~0 2)} assume true; {14710#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:27,184 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14710#(<= ~counter~0 2)} {14710#(<= ~counter~0 2)} #96#return; {14710#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:27,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {14710#(<= ~counter~0 2)} assume !(~r~0 > 0); {14710#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:27,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {14710#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14735#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:27,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {14735#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {14735#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:27,185 INFO L272 TraceCheckUtils]: 35: Hoare triple {14735#(<= ~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)); {14735#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:27,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {14735#(<= ~counter~0 3)} ~cond := #in~cond; {14735#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:27,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {14735#(<= ~counter~0 3)} assume !(0 == ~cond); {14735#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:27,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {14735#(<= ~counter~0 3)} assume true; {14735#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:27,187 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14735#(<= ~counter~0 3)} {14735#(<= ~counter~0 3)} #98#return; {14735#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:27,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {14735#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14735#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:27,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {14735#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14760#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:27,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {14760#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {14760#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:27,188 INFO L272 TraceCheckUtils]: 43: Hoare triple {14760#(<= ~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)); {14760#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:27,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {14760#(<= ~counter~0 4)} ~cond := #in~cond; {14760#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:27,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {14760#(<= ~counter~0 4)} assume !(0 == ~cond); {14760#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:27,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {14760#(<= ~counter~0 4)} assume true; {14760#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:27,189 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14760#(<= ~counter~0 4)} {14760#(<= ~counter~0 4)} #98#return; {14760#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:27,190 INFO L290 TraceCheckUtils]: 48: Hoare triple {14760#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14760#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:27,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {14760#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:27,190 INFO L290 TraceCheckUtils]: 50: Hoare triple {14785#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:27,191 INFO L272 TraceCheckUtils]: 51: Hoare triple {14785#(<= ~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)); {14785#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:27,191 INFO L290 TraceCheckUtils]: 52: Hoare triple {14785#(<= ~counter~0 5)} ~cond := #in~cond; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:27,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {14785#(<= ~counter~0 5)} assume !(0 == ~cond); {14785#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:27,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {14785#(<= ~counter~0 5)} assume true; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:27,192 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14785#(<= ~counter~0 5)} {14785#(<= ~counter~0 5)} #98#return; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:27,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {14785#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14785#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:27,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {14785#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14810#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:27,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {14810#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {14810#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:27,194 INFO L272 TraceCheckUtils]: 59: Hoare triple {14810#(<= ~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)); {14810#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:27,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {14810#(<= ~counter~0 6)} ~cond := #in~cond; {14810#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:27,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {14810#(<= ~counter~0 6)} assume !(0 == ~cond); {14810#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:27,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {14810#(<= ~counter~0 6)} assume true; {14810#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:27,195 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14810#(<= ~counter~0 6)} {14810#(<= ~counter~0 6)} #98#return; {14810#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:27,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {14810#(<= ~counter~0 6)} assume !(~r~0 < 0); {14810#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:27,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {14810#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14835#(<= |main_#t~post6| 6)} is VALID [2022-04-28 12:39:27,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {14835#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {14629#false} is VALID [2022-04-28 12:39:27,196 INFO L272 TraceCheckUtils]: 67: Hoare triple {14629#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14629#false} is VALID [2022-04-28 12:39:27,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {14629#false} ~cond := #in~cond; {14629#false} is VALID [2022-04-28 12:39:27,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {14629#false} assume 0 == ~cond; {14629#false} is VALID [2022-04-28 12:39:27,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {14629#false} assume !false; {14629#false} is VALID [2022-04-28 12:39:27,196 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-28 12:39:27,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:39:27,549 INFO L290 TraceCheckUtils]: 70: Hoare triple {14629#false} assume !false; {14629#false} is VALID [2022-04-28 12:39:27,549 INFO L290 TraceCheckUtils]: 69: Hoare triple {14629#false} assume 0 == ~cond; {14629#false} is VALID [2022-04-28 12:39:27,550 INFO L290 TraceCheckUtils]: 68: Hoare triple {14629#false} ~cond := #in~cond; {14629#false} is VALID [2022-04-28 12:39:27,550 INFO L272 TraceCheckUtils]: 67: Hoare triple {14629#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14629#false} is VALID [2022-04-28 12:39:27,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {14863#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {14629#false} is VALID [2022-04-28 12:39:27,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {14867#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14863#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:39:27,550 INFO L290 TraceCheckUtils]: 64: Hoare triple {14867#(< ~counter~0 50)} assume !(~r~0 < 0); {14867#(< ~counter~0 50)} is VALID [2022-04-28 12:39:27,551 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14628#true} {14867#(< ~counter~0 50)} #98#return; {14867#(< ~counter~0 50)} is VALID [2022-04-28 12:39:27,551 INFO L290 TraceCheckUtils]: 62: Hoare triple {14628#true} assume true; {14628#true} is VALID [2022-04-28 12:39:27,551 INFO L290 TraceCheckUtils]: 61: Hoare triple {14628#true} assume !(0 == ~cond); {14628#true} is VALID [2022-04-28 12:39:27,551 INFO L290 TraceCheckUtils]: 60: Hoare triple {14628#true} ~cond := #in~cond; {14628#true} is VALID [2022-04-28 12:39:27,551 INFO L272 TraceCheckUtils]: 59: Hoare triple {14867#(< ~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)); {14628#true} is VALID [2022-04-28 12:39:27,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {14867#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {14867#(< ~counter~0 50)} is VALID [2022-04-28 12:39:27,551 INFO L290 TraceCheckUtils]: 57: Hoare triple {14892#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14867#(< ~counter~0 50)} is VALID [2022-04-28 12:39:27,552 INFO L290 TraceCheckUtils]: 56: Hoare triple {14892#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14892#(< ~counter~0 49)} is VALID [2022-04-28 12:39:27,552 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14628#true} {14892#(< ~counter~0 49)} #98#return; {14892#(< ~counter~0 49)} is VALID [2022-04-28 12:39:27,552 INFO L290 TraceCheckUtils]: 54: Hoare triple {14628#true} assume true; {14628#true} is VALID [2022-04-28 12:39:27,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {14628#true} assume !(0 == ~cond); {14628#true} is VALID [2022-04-28 12:39:27,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {14628#true} ~cond := #in~cond; {14628#true} is VALID [2022-04-28 12:39:27,552 INFO L272 TraceCheckUtils]: 51: Hoare triple {14892#(< ~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)); {14628#true} is VALID [2022-04-28 12:39:27,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {14892#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {14892#(< ~counter~0 49)} is VALID [2022-04-28 12:39:27,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {14917#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14892#(< ~counter~0 49)} is VALID [2022-04-28 12:39:27,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {14917#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14917#(< ~counter~0 48)} is VALID [2022-04-28 12:39:27,554 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14628#true} {14917#(< ~counter~0 48)} #98#return; {14917#(< ~counter~0 48)} is VALID [2022-04-28 12:39:27,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {14628#true} assume true; {14628#true} is VALID [2022-04-28 12:39:27,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {14628#true} assume !(0 == ~cond); {14628#true} is VALID [2022-04-28 12:39:27,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {14628#true} ~cond := #in~cond; {14628#true} is VALID [2022-04-28 12:39:27,554 INFO L272 TraceCheckUtils]: 43: Hoare triple {14917#(< ~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)); {14628#true} is VALID [2022-04-28 12:39:27,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {14917#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {14917#(< ~counter~0 48)} is VALID [2022-04-28 12:39:27,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {14942#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14917#(< ~counter~0 48)} is VALID [2022-04-28 12:39:27,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {14942#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14942#(< ~counter~0 47)} is VALID [2022-04-28 12:39:27,555 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14628#true} {14942#(< ~counter~0 47)} #98#return; {14942#(< ~counter~0 47)} is VALID [2022-04-28 12:39:27,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {14628#true} assume true; {14628#true} is VALID [2022-04-28 12:39:27,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {14628#true} assume !(0 == ~cond); {14628#true} is VALID [2022-04-28 12:39:27,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {14628#true} ~cond := #in~cond; {14628#true} is VALID [2022-04-28 12:39:27,555 INFO L272 TraceCheckUtils]: 35: Hoare triple {14942#(< ~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)); {14628#true} is VALID [2022-04-28 12:39:27,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {14942#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {14942#(< ~counter~0 47)} is VALID [2022-04-28 12:39:27,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {14967#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14942#(< ~counter~0 47)} is VALID [2022-04-28 12:39:27,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {14967#(< ~counter~0 46)} assume !(~r~0 > 0); {14967#(< ~counter~0 46)} is VALID [2022-04-28 12:39:27,557 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14628#true} {14967#(< ~counter~0 46)} #96#return; {14967#(< ~counter~0 46)} is VALID [2022-04-28 12:39:27,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {14628#true} assume true; {14628#true} is VALID [2022-04-28 12:39:27,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {14628#true} assume !(0 == ~cond); {14628#true} is VALID [2022-04-28 12:39:27,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {14628#true} ~cond := #in~cond; {14628#true} is VALID [2022-04-28 12:39:27,557 INFO L272 TraceCheckUtils]: 27: Hoare triple {14967#(< ~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)); {14628#true} is VALID [2022-04-28 12:39:27,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {14967#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {14967#(< ~counter~0 46)} is VALID [2022-04-28 12:39:27,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {14992#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14967#(< ~counter~0 46)} is VALID [2022-04-28 12:39:27,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {14992#(< ~counter~0 45)} assume !!(0 != ~r~0); {14992#(< ~counter~0 45)} is VALID [2022-04-28 12:39:27,558 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14628#true} {14992#(< ~counter~0 45)} #94#return; {14992#(< ~counter~0 45)} is VALID [2022-04-28 12:39:27,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {14628#true} assume true; {14628#true} is VALID [2022-04-28 12:39:27,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {14628#true} assume !(0 == ~cond); {14628#true} is VALID [2022-04-28 12:39:27,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {14628#true} ~cond := #in~cond; {14628#true} is VALID [2022-04-28 12:39:27,558 INFO L272 TraceCheckUtils]: 19: Hoare triple {14992#(< ~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)); {14628#true} is VALID [2022-04-28 12:39:27,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {14992#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {14992#(< ~counter~0 45)} is VALID [2022-04-28 12:39:27,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {15017#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14992#(< ~counter~0 45)} is VALID [2022-04-28 12:39:27,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {15017#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15017#(< ~counter~0 44)} is VALID [2022-04-28 12:39:27,559 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14628#true} {15017#(< ~counter~0 44)} #92#return; {15017#(< ~counter~0 44)} is VALID [2022-04-28 12:39:27,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {14628#true} assume true; {14628#true} is VALID [2022-04-28 12:39:27,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {14628#true} assume !(0 == ~cond); {14628#true} is VALID [2022-04-28 12:39:27,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {14628#true} ~cond := #in~cond; {14628#true} is VALID [2022-04-28 12:39:27,559 INFO L272 TraceCheckUtils]: 11: Hoare triple {15017#(< ~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)); {14628#true} is VALID [2022-04-28 12:39:27,559 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14628#true} {15017#(< ~counter~0 44)} #90#return; {15017#(< ~counter~0 44)} is VALID [2022-04-28 12:39:27,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {14628#true} assume true; {14628#true} is VALID [2022-04-28 12:39:27,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {14628#true} assume !(0 == ~cond); {14628#true} is VALID [2022-04-28 12:39:27,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {14628#true} ~cond := #in~cond; {14628#true} is VALID [2022-04-28 12:39:27,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {15017#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14628#true} is VALID [2022-04-28 12:39:27,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {15017#(< ~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; {15017#(< ~counter~0 44)} is VALID [2022-04-28 12:39:27,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {15017#(< ~counter~0 44)} call #t~ret9 := main(); {15017#(< ~counter~0 44)} is VALID [2022-04-28 12:39:27,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15017#(< ~counter~0 44)} {14628#true} #102#return; {15017#(< ~counter~0 44)} is VALID [2022-04-28 12:39:27,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {15017#(< ~counter~0 44)} assume true; {15017#(< ~counter~0 44)} is VALID [2022-04-28 12:39:27,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {14628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15017#(< ~counter~0 44)} is VALID [2022-04-28 12:39:27,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {14628#true} call ULTIMATE.init(); {14628#true} is VALID [2022-04-28 12:39:27,561 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-28 12:39:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:39:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114441007] [2022-04-28 12:39:27,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:39:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767374255] [2022-04-28 12:39:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767374255] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:39:27,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:39:27,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 12:39:27,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:39:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1735810372] [2022-04-28 12:39:27,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1735810372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:27,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:27,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:39:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549295889] [2022-04-28 12:39:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:39:27,563 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-28 12:39:27,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:39:27,563 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-28 12:39:27,596 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-28 12:39:27,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:39:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:39:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:39:27,597 INFO L87 Difference]: Start difference. First operand 164 states and 207 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-28 12:39:27,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:27,950 INFO L93 Difference]: Finished difference Result 202 states and 256 transitions. [2022-04-28 12:39:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:39:27,951 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-28 12:39:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:39:27,951 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-28 12:39:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 12:39:27,963 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-28 12:39:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 12:39:27,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-28 12:39:28,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:28,074 INFO L225 Difference]: With dead ends: 202 [2022-04-28 12:39:28,074 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 12:39:28,074 INFO L412 NwaCegarLoop]: 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-28 12:39:28,075 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:39:28,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 181 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:39:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 12:39:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2022-04-28 12:39:28,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:39:28,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 185 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 140 states have internal predecessors, (163), 37 states have call successors, (37), 14 states have call predecessors, (37), 12 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 12:39:28,210 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 185 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 140 states have internal predecessors, (163), 37 states have call successors, (37), 14 states have call predecessors, (37), 12 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 12:39:28,211 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 185 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 140 states have internal predecessors, (163), 37 states have call successors, (37), 14 states have call predecessors, (37), 12 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 12:39:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:28,214 INFO L93 Difference]: Finished difference Result 197 states and 250 transitions. [2022-04-28 12:39:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 250 transitions. [2022-04-28 12:39:28,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:28,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:28,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 140 states have internal predecessors, (163), 37 states have call successors, (37), 14 states have call predecessors, (37), 12 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) Second operand 197 states. [2022-04-28 12:39:28,214 INFO L87 Difference]: Start difference. First operand has 185 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 140 states have internal predecessors, (163), 37 states have call successors, (37), 14 states have call predecessors, (37), 12 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) Second operand 197 states. [2022-04-28 12:39:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:28,220 INFO L93 Difference]: Finished difference Result 197 states and 250 transitions. [2022-04-28 12:39:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 250 transitions. [2022-04-28 12:39:28,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:28,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:28,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:39:28,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:39:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 140 states have internal predecessors, (163), 37 states have call successors, (37), 14 states have call predecessors, (37), 12 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 12:39:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2022-04-28 12:39:28,224 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 71 [2022-04-28 12:39:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:39:28,224 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2022-04-28 12:39:28,224 INFO L496 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-28 12:39:28,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 235 transitions. [2022-04-28 12:39:37,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 232 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2022-04-28 12:39:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 12:39:37,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:39:37,197 INFO L195 NwaCegarLoop]: 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-28 12:39:37,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 12:39:37,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 12:39:37,397 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:39:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:39:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-28 12:39:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:37,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [230809318] [2022-04-28 12:39:37,398 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:39:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-28 12:39:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:39:37,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400638983] [2022-04-28 12:39:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:39:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:39:37,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:39:37,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183938046] [2022-04-28 12:39:37,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:39:37,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:37,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:39:37,414 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:39:37,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 12:39:37,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:39:37,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:39:37,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 12:39:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:39:37,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:39:37,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {16245#true} call ULTIMATE.init(); {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {16245#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16245#true} {16245#true} #102#return; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {16245#true} call #t~ret9 := main(); {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {16245#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; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L272 TraceCheckUtils]: 6: Hoare triple {16245#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {16245#true} ~cond := #in~cond; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {16245#true} assume !(0 == ~cond); {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16245#true} {16245#true} #90#return; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L272 TraceCheckUtils]: 11: Hoare triple {16245#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)); {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {16245#true} ~cond := #in~cond; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {16245#true} assume !(0 == ~cond); {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16245#true} {16245#true} #92#return; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {16245#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16245#true} is VALID [2022-04-28 12:39:37,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {16245#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {16245#true} assume !!(#t~post6 < 50);havoc #t~post6; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L272 TraceCheckUtils]: 19: Hoare triple {16245#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)); {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {16245#true} ~cond := #in~cond; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {16245#true} assume !(0 == ~cond); {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16245#true} {16245#true} #94#return; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {16245#true} assume !!(0 != ~r~0); {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {16245#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {16245#true} assume !!(#t~post7 < 50);havoc #t~post7; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L272 TraceCheckUtils]: 27: Hoare triple {16245#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)); {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {16245#true} ~cond := #in~cond; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {16245#true} assume !(0 == ~cond); {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16245#true} {16245#true} #96#return; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {16245#true} assume !(~r~0 > 0); {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {16245#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {16245#true} assume !!(#t~post8 < 50);havoc #t~post8; {16245#true} is VALID [2022-04-28 12:39:37,684 INFO L272 TraceCheckUtils]: 35: Hoare triple {16245#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)); {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {16245#true} ~cond := #in~cond; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {16245#true} assume !(0 == ~cond); {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16245#true} {16245#true} #98#return; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {16245#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {16245#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {16245#true} assume !!(#t~post8 < 50);havoc #t~post8; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L272 TraceCheckUtils]: 43: Hoare triple {16245#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)); {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {16245#true} ~cond := #in~cond; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {16245#true} assume !(0 == ~cond); {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16245#true} {16245#true} #98#return; {16245#true} is VALID [2022-04-28 12:39:37,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {16245#true} assume !(~r~0 < 0); {16394#(not (< main_~r~0 0))} is VALID [2022-04-28 12:39:37,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {16394#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16394#(not (< main_~r~0 0))} is VALID [2022-04-28 12:39:37,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {16394#(not (< main_~r~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {16394#(not (< main_~r~0 0))} is VALID [2022-04-28 12:39:37,686 INFO L272 TraceCheckUtils]: 51: Hoare triple {16394#(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)); {16245#true} is VALID [2022-04-28 12:39:37,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {16245#true} ~cond := #in~cond; {16245#true} is VALID [2022-04-28 12:39:37,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {16245#true} assume !(0 == ~cond); {16245#true} is VALID [2022-04-28 12:39:37,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,687 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16245#true} {16394#(not (< main_~r~0 0))} #94#return; {16394#(not (< main_~r~0 0))} is VALID [2022-04-28 12:39:37,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {16394#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {16419#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 12:39:37,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {16419#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16419#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 12:39:37,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {16419#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 50);havoc #t~post7; {16419#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 12:39:37,688 INFO L272 TraceCheckUtils]: 59: Hoare triple {16419#(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)); {16245#true} is VALID [2022-04-28 12:39:37,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {16245#true} ~cond := #in~cond; {16245#true} is VALID [2022-04-28 12:39:37,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {16245#true} assume !(0 == ~cond); {16245#true} is VALID [2022-04-28 12:39:37,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {16245#true} assume true; {16245#true} is VALID [2022-04-28 12:39:37,688 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16245#true} {16419#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {16419#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 12:39:37,689 INFO L290 TraceCheckUtils]: 64: Hoare triple {16419#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {16246#false} is VALID [2022-04-28 12:39:37,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {16246#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16246#false} is VALID [2022-04-28 12:39:37,689 INFO L290 TraceCheckUtils]: 66: Hoare triple {16246#false} assume !(#t~post8 < 50);havoc #t~post8; {16246#false} is VALID [2022-04-28 12:39:37,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {16246#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16246#false} is VALID [2022-04-28 12:39:37,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {16246#false} assume !(#t~post6 < 50);havoc #t~post6; {16246#false} is VALID [2022-04-28 12:39:37,689 INFO L272 TraceCheckUtils]: 69: Hoare triple {16246#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16246#false} is VALID [2022-04-28 12:39:37,689 INFO L290 TraceCheckUtils]: 70: Hoare triple {16246#false} ~cond := #in~cond; {16246#false} is VALID [2022-04-28 12:39:37,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {16246#false} assume 0 == ~cond; {16246#false} is VALID [2022-04-28 12:39:37,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {16246#false} assume !false; {16246#false} is VALID [2022-04-28 12:39:37,689 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-28 12:39:37,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:39:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:39:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400638983] [2022-04-28 12:39:37,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:39:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183938046] [2022-04-28 12:39:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183938046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:37,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:37,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:39:37,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:39:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [230809318] [2022-04-28 12:39:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [230809318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:37,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:37,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:39:37,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275241069] [2022-04-28 12:39:37,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:39:37,691 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-28 12:39:37,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:39:37,691 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-28 12:39:37,727 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-28 12:39:37,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:39:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:39:37,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:39:37,728 INFO L87 Difference]: Start difference. First operand 185 states and 235 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-28 12:39:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:37,993 INFO L93 Difference]: Finished difference Result 284 states and 382 transitions. [2022-04-28 12:39:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:39:37,993 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-28 12:39:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:39:37,995 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-28 12:39:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 12:39:37,996 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-28 12:39:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 12:39:37,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 12:39:38,076 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-28 12:39:38,080 INFO L225 Difference]: With dead ends: 284 [2022-04-28 12:39:38,080 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 12:39:38,080 INFO L412 NwaCegarLoop]: 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-28 12:39:38,080 INFO L413 NwaCegarLoop]: 60 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, 94 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-28 12:39:38,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 94 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:39:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 12:39:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2022-04-28 12:39:38,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:39:38,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 208 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 158 states have internal predecessors, (186), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:38,233 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 208 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 158 states have internal predecessors, (186), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:38,233 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 208 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 158 states have internal predecessors, (186), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:38,236 INFO L93 Difference]: Finished difference Result 219 states and 285 transitions. [2022-04-28 12:39:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 285 transitions. [2022-04-28 12:39:38,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:38,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:38,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 158 states have internal predecessors, (186), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) Second operand 219 states. [2022-04-28 12:39:38,237 INFO L87 Difference]: Start difference. First operand has 208 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 158 states have internal predecessors, (186), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) Second operand 219 states. [2022-04-28 12:39:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:38,241 INFO L93 Difference]: Finished difference Result 219 states and 285 transitions. [2022-04-28 12:39:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 285 transitions. [2022-04-28 12:39:38,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:38,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:38,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:39:38,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:39:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 158 states have internal predecessors, (186), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 270 transitions. [2022-04-28 12:39:38,245 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 270 transitions. Word has length 73 [2022-04-28 12:39:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:39:38,245 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 270 transitions. [2022-04-28 12:39:38,245 INFO L496 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-28 12:39:38,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 270 transitions. [2022-04-28 12:39:45,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 269 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 270 transitions. [2022-04-28 12:39:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 12:39:45,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:39:45,825 INFO L195 NwaCegarLoop]: 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-28 12:39:45,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 12:39:46,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 12:39:46,025 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:39:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:39:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-28 12:39:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:46,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [18601688] [2022-04-28 12:39:46,026 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:39:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-28 12:39:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:39:46,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132153088] [2022-04-28 12:39:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:39:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:39:46,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:39:46,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355718205] [2022-04-28 12:39:46,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:39:46,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:46,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:39:46,054 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:39:46,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 12:39:46,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:39:46,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:39:46,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:39:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:39:46,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:39:46,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {17889#true} call ULTIMATE.init(); {17889#true} is VALID [2022-04-28 12:39:46,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {17889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {17897#(<= ~counter~0 0)} assume true; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17897#(<= ~counter~0 0)} {17889#true} #102#return; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {17897#(<= ~counter~0 0)} call #t~ret9 := main(); {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {17897#(<= ~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; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {17897#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {17897#(<= ~counter~0 0)} ~cond := #in~cond; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {17897#(<= ~counter~0 0)} assume !(0 == ~cond); {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {17897#(<= ~counter~0 0)} assume true; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17897#(<= ~counter~0 0)} {17897#(<= ~counter~0 0)} #90#return; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,442 INFO L272 TraceCheckUtils]: 11: Hoare triple {17897#(<= ~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)); {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {17897#(<= ~counter~0 0)} ~cond := #in~cond; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {17897#(<= ~counter~0 0)} assume !(0 == ~cond); {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {17897#(<= ~counter~0 0)} assume true; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,443 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17897#(<= ~counter~0 0)} {17897#(<= ~counter~0 0)} #92#return; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17897#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:46,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {17897#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17946#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:46,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {17946#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {17946#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:46,444 INFO L272 TraceCheckUtils]: 19: Hoare triple {17946#(<= ~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)); {17946#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:46,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {17946#(<= ~counter~0 1)} ~cond := #in~cond; {17946#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:46,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {17946#(<= ~counter~0 1)} assume !(0 == ~cond); {17946#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:46,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {17946#(<= ~counter~0 1)} assume true; {17946#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:46,445 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17946#(<= ~counter~0 1)} {17946#(<= ~counter~0 1)} #94#return; {17946#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:46,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {17946#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17946#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:46,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {17946#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17971#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:46,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {17971#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {17971#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:46,446 INFO L272 TraceCheckUtils]: 27: Hoare triple {17971#(<= ~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)); {17971#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:46,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {17971#(<= ~counter~0 2)} ~cond := #in~cond; {17971#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:46,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {17971#(<= ~counter~0 2)} assume !(0 == ~cond); {17971#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:46,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {17971#(<= ~counter~0 2)} assume true; {17971#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:46,447 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17971#(<= ~counter~0 2)} {17971#(<= ~counter~0 2)} #96#return; {17971#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:46,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {17971#(<= ~counter~0 2)} assume !(~r~0 > 0); {17971#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:46,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {17971#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17996#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:46,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {17996#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {17996#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:46,448 INFO L272 TraceCheckUtils]: 35: Hoare triple {17996#(<= ~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)); {17996#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:46,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {17996#(<= ~counter~0 3)} ~cond := #in~cond; {17996#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:46,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {17996#(<= ~counter~0 3)} assume !(0 == ~cond); {17996#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:46,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {17996#(<= ~counter~0 3)} assume true; {17996#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:46,449 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17996#(<= ~counter~0 3)} {17996#(<= ~counter~0 3)} #98#return; {17996#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:46,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {17996#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17996#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:46,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {17996#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18021#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:46,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {18021#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {18021#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:46,450 INFO L272 TraceCheckUtils]: 43: Hoare triple {18021#(<= ~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)); {18021#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:46,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {18021#(<= ~counter~0 4)} ~cond := #in~cond; {18021#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:46,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {18021#(<= ~counter~0 4)} assume !(0 == ~cond); {18021#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:46,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {18021#(<= ~counter~0 4)} assume true; {18021#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:46,452 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18021#(<= ~counter~0 4)} {18021#(<= ~counter~0 4)} #98#return; {18021#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:46,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {18021#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18021#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:46,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {18021#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18046#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:46,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {18046#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {18046#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:46,453 INFO L272 TraceCheckUtils]: 51: Hoare triple {18046#(<= ~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)); {18046#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:46,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {18046#(<= ~counter~0 5)} ~cond := #in~cond; {18046#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:46,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {18046#(<= ~counter~0 5)} assume !(0 == ~cond); {18046#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:46,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {18046#(<= ~counter~0 5)} assume true; {18046#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:46,454 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18046#(<= ~counter~0 5)} {18046#(<= ~counter~0 5)} #98#return; {18046#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:46,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {18046#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18046#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:46,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {18046#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18071#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:46,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {18071#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {18071#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:46,455 INFO L272 TraceCheckUtils]: 59: Hoare triple {18071#(<= ~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)); {18071#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:46,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {18071#(<= ~counter~0 6)} ~cond := #in~cond; {18071#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:46,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {18071#(<= ~counter~0 6)} assume !(0 == ~cond); {18071#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:46,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {18071#(<= ~counter~0 6)} assume true; {18071#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:46,456 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18071#(<= ~counter~0 6)} {18071#(<= ~counter~0 6)} #98#return; {18071#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:46,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {18071#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18071#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:46,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {18071#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18096#(<= |main_#t~post8| 6)} is VALID [2022-04-28 12:39:46,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {18096#(<= |main_#t~post8| 6)} assume !(#t~post8 < 50);havoc #t~post8; {17890#false} is VALID [2022-04-28 12:39:46,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {17890#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17890#false} is VALID [2022-04-28 12:39:46,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {17890#false} assume !(#t~post6 < 50);havoc #t~post6; {17890#false} is VALID [2022-04-28 12:39:46,457 INFO L272 TraceCheckUtils]: 69: Hoare triple {17890#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17890#false} is VALID [2022-04-28 12:39:46,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {17890#false} ~cond := #in~cond; {17890#false} is VALID [2022-04-28 12:39:46,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {17890#false} assume 0 == ~cond; {17890#false} is VALID [2022-04-28 12:39:46,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {17890#false} assume !false; {17890#false} is VALID [2022-04-28 12:39:46,457 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-28 12:39:46,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:39:46,667 INFO L290 TraceCheckUtils]: 72: Hoare triple {17890#false} assume !false; {17890#false} is VALID [2022-04-28 12:39:46,667 INFO L290 TraceCheckUtils]: 71: Hoare triple {17890#false} assume 0 == ~cond; {17890#false} is VALID [2022-04-28 12:39:46,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {17890#false} ~cond := #in~cond; {17890#false} is VALID [2022-04-28 12:39:46,668 INFO L272 TraceCheckUtils]: 69: Hoare triple {17890#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17890#false} is VALID [2022-04-28 12:39:46,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {17890#false} assume !(#t~post6 < 50);havoc #t~post6; {17890#false} is VALID [2022-04-28 12:39:46,668 INFO L290 TraceCheckUtils]: 67: Hoare triple {17890#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17890#false} is VALID [2022-04-28 12:39:46,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {18136#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {17890#false} is VALID [2022-04-28 12:39:46,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {18140#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18136#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:39:46,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {18140#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18140#(< ~counter~0 50)} is VALID [2022-04-28 12:39:46,669 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17889#true} {18140#(< ~counter~0 50)} #98#return; {18140#(< ~counter~0 50)} is VALID [2022-04-28 12:39:46,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {17889#true} assume true; {17889#true} is VALID [2022-04-28 12:39:46,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {17889#true} assume !(0 == ~cond); {17889#true} is VALID [2022-04-28 12:39:46,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {17889#true} ~cond := #in~cond; {17889#true} is VALID [2022-04-28 12:39:46,669 INFO L272 TraceCheckUtils]: 59: Hoare triple {18140#(< ~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)); {17889#true} is VALID [2022-04-28 12:39:46,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {18140#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {18140#(< ~counter~0 50)} is VALID [2022-04-28 12:39:46,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {18165#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18140#(< ~counter~0 50)} is VALID [2022-04-28 12:39:46,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {18165#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18165#(< ~counter~0 49)} is VALID [2022-04-28 12:39:46,670 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17889#true} {18165#(< ~counter~0 49)} #98#return; {18165#(< ~counter~0 49)} is VALID [2022-04-28 12:39:46,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {17889#true} assume true; {17889#true} is VALID [2022-04-28 12:39:46,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {17889#true} assume !(0 == ~cond); {17889#true} is VALID [2022-04-28 12:39:46,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {17889#true} ~cond := #in~cond; {17889#true} is VALID [2022-04-28 12:39:46,670 INFO L272 TraceCheckUtils]: 51: Hoare triple {18165#(< ~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)); {17889#true} is VALID [2022-04-28 12:39:46,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {18165#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {18165#(< ~counter~0 49)} is VALID [2022-04-28 12:39:46,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {18190#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18165#(< ~counter~0 49)} is VALID [2022-04-28 12:39:46,671 INFO L290 TraceCheckUtils]: 48: Hoare triple {18190#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18190#(< ~counter~0 48)} is VALID [2022-04-28 12:39:46,671 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17889#true} {18190#(< ~counter~0 48)} #98#return; {18190#(< ~counter~0 48)} is VALID [2022-04-28 12:39:46,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {17889#true} assume true; {17889#true} is VALID [2022-04-28 12:39:46,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {17889#true} assume !(0 == ~cond); {17889#true} is VALID [2022-04-28 12:39:46,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {17889#true} ~cond := #in~cond; {17889#true} is VALID [2022-04-28 12:39:46,671 INFO L272 TraceCheckUtils]: 43: Hoare triple {18190#(< ~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)); {17889#true} is VALID [2022-04-28 12:39:46,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {18190#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {18190#(< ~counter~0 48)} is VALID [2022-04-28 12:39:46,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {18215#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18190#(< ~counter~0 48)} is VALID [2022-04-28 12:39:46,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {18215#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18215#(< ~counter~0 47)} is VALID [2022-04-28 12:39:46,672 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17889#true} {18215#(< ~counter~0 47)} #98#return; {18215#(< ~counter~0 47)} is VALID [2022-04-28 12:39:46,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {17889#true} assume true; {17889#true} is VALID [2022-04-28 12:39:46,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {17889#true} assume !(0 == ~cond); {17889#true} is VALID [2022-04-28 12:39:46,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {17889#true} ~cond := #in~cond; {17889#true} is VALID [2022-04-28 12:39:46,673 INFO L272 TraceCheckUtils]: 35: Hoare triple {18215#(< ~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)); {17889#true} is VALID [2022-04-28 12:39:46,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {18215#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {18215#(< ~counter~0 47)} is VALID [2022-04-28 12:39:46,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {18240#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18215#(< ~counter~0 47)} is VALID [2022-04-28 12:39:46,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {18240#(< ~counter~0 46)} assume !(~r~0 > 0); {18240#(< ~counter~0 46)} is VALID [2022-04-28 12:39:46,674 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17889#true} {18240#(< ~counter~0 46)} #96#return; {18240#(< ~counter~0 46)} is VALID [2022-04-28 12:39:46,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {17889#true} assume true; {17889#true} is VALID [2022-04-28 12:39:46,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {17889#true} assume !(0 == ~cond); {17889#true} is VALID [2022-04-28 12:39:46,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {17889#true} ~cond := #in~cond; {17889#true} is VALID [2022-04-28 12:39:46,674 INFO L272 TraceCheckUtils]: 27: Hoare triple {18240#(< ~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)); {17889#true} is VALID [2022-04-28 12:39:46,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {18240#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {18240#(< ~counter~0 46)} is VALID [2022-04-28 12:39:46,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {18265#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18240#(< ~counter~0 46)} is VALID [2022-04-28 12:39:46,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {18265#(< ~counter~0 45)} assume !!(0 != ~r~0); {18265#(< ~counter~0 45)} is VALID [2022-04-28 12:39:46,675 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17889#true} {18265#(< ~counter~0 45)} #94#return; {18265#(< ~counter~0 45)} is VALID [2022-04-28 12:39:46,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {17889#true} assume true; {17889#true} is VALID [2022-04-28 12:39:46,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {17889#true} assume !(0 == ~cond); {17889#true} is VALID [2022-04-28 12:39:46,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {17889#true} ~cond := #in~cond; {17889#true} is VALID [2022-04-28 12:39:46,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {18265#(< ~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)); {17889#true} is VALID [2022-04-28 12:39:46,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {18265#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {18265#(< ~counter~0 45)} is VALID [2022-04-28 12:39:46,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {18290#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18265#(< ~counter~0 45)} is VALID [2022-04-28 12:39:46,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {18290#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18290#(< ~counter~0 44)} is VALID [2022-04-28 12:39:46,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17889#true} {18290#(< ~counter~0 44)} #92#return; {18290#(< ~counter~0 44)} is VALID [2022-04-28 12:39:46,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {17889#true} assume true; {17889#true} is VALID [2022-04-28 12:39:46,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {17889#true} assume !(0 == ~cond); {17889#true} is VALID [2022-04-28 12:39:46,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {17889#true} ~cond := #in~cond; {17889#true} is VALID [2022-04-28 12:39:46,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {18290#(< ~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)); {17889#true} is VALID [2022-04-28 12:39:46,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17889#true} {18290#(< ~counter~0 44)} #90#return; {18290#(< ~counter~0 44)} is VALID [2022-04-28 12:39:46,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {17889#true} assume true; {17889#true} is VALID [2022-04-28 12:39:46,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {17889#true} assume !(0 == ~cond); {17889#true} is VALID [2022-04-28 12:39:46,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {17889#true} ~cond := #in~cond; {17889#true} is VALID [2022-04-28 12:39:46,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {18290#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17889#true} is VALID [2022-04-28 12:39:46,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {18290#(< ~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; {18290#(< ~counter~0 44)} is VALID [2022-04-28 12:39:46,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {18290#(< ~counter~0 44)} call #t~ret9 := main(); {18290#(< ~counter~0 44)} is VALID [2022-04-28 12:39:46,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18290#(< ~counter~0 44)} {17889#true} #102#return; {18290#(< ~counter~0 44)} is VALID [2022-04-28 12:39:46,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {18290#(< ~counter~0 44)} assume true; {18290#(< ~counter~0 44)} is VALID [2022-04-28 12:39:46,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {17889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18290#(< ~counter~0 44)} is VALID [2022-04-28 12:39:46,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {17889#true} call ULTIMATE.init(); {17889#true} is VALID [2022-04-28 12:39:46,678 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-28 12:39:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:39:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132153088] [2022-04-28 12:39:46,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:39:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355718205] [2022-04-28 12:39:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355718205] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:39:46,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:39:46,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 12:39:46,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:39:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [18601688] [2022-04-28 12:39:46,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [18601688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:46,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:46,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:39:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809137312] [2022-04-28 12:39:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:39:46,679 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-28 12:39:46,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:39:46,679 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-28 12:39:46,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:46,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:39:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:46,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:39:46,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:39:46,708 INFO L87 Difference]: Start difference. First operand 208 states and 270 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-28 12:39:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:47,200 INFO L93 Difference]: Finished difference Result 307 states and 412 transitions. [2022-04-28 12:39:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:39:47,200 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-28 12:39:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:39:47,201 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-28 12:39:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-28 12:39:47,202 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-28 12:39:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-28 12:39:47,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-28 12:39:47,281 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-28 12:39:47,284 INFO L225 Difference]: With dead ends: 307 [2022-04-28 12:39:47,284 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 12:39:47,285 INFO L412 NwaCegarLoop]: 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-28 12:39:47,285 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 66 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:39:47,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 193 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:39:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 12:39:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2022-04-28 12:39:47,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:39:47,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 213 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 162 states have internal predecessors, (192), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:47,408 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 213 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 162 states have internal predecessors, (192), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:47,409 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 213 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 162 states have internal predecessors, (192), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:47,412 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2022-04-28 12:39:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2022-04-28 12:39:47,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:47,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:47,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 162 states have internal predecessors, (192), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) Second operand 219 states. [2022-04-28 12:39:47,413 INFO L87 Difference]: Start difference. First operand has 213 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 162 states have internal predecessors, (192), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) Second operand 219 states. [2022-04-28 12:39:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:47,416 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2022-04-28 12:39:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2022-04-28 12:39:47,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:47,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:47,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:39:47,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:39:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 162 states have internal predecessors, (192), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 276 transitions. [2022-04-28 12:39:47,424 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 276 transitions. Word has length 73 [2022-04-28 12:39:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:39:47,424 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 276 transitions. [2022-04-28 12:39:47,425 INFO L496 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-28 12:39:47,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 276 transitions. [2022-04-28 12:39:56,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 274 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 276 transitions. [2022-04-28 12:39:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 12:39:56,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:39:56,674 INFO L195 NwaCegarLoop]: 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-28 12:39:56,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-28 12:39:56,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:56,874 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:39:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:39:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-28 12:39:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:56,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1979735262] [2022-04-28 12:39:56,875 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:39:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-28 12:39:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:39:56,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104074809] [2022-04-28 12:39:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:39:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:39:56,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:39:56,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064959707] [2022-04-28 12:39:56,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:39:56,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:56,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:39:56,893 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:39:56,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 12:39:56,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:39:56,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:39:56,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:39:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:39:56,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:39:57,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {19830#true} call ULTIMATE.init(); {19830#true} is VALID [2022-04-28 12:39:57,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {19830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {19838#(<= ~counter~0 0)} assume true; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19838#(<= ~counter~0 0)} {19830#true} #102#return; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {19838#(<= ~counter~0 0)} call #t~ret9 := main(); {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {19838#(<= ~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; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {19838#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {19838#(<= ~counter~0 0)} ~cond := #in~cond; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {19838#(<= ~counter~0 0)} assume !(0 == ~cond); {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {19838#(<= ~counter~0 0)} assume true; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19838#(<= ~counter~0 0)} {19838#(<= ~counter~0 0)} #90#return; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,309 INFO L272 TraceCheckUtils]: 11: Hoare triple {19838#(<= ~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)); {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {19838#(<= ~counter~0 0)} ~cond := #in~cond; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {19838#(<= ~counter~0 0)} assume !(0 == ~cond); {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {19838#(<= ~counter~0 0)} assume true; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,310 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19838#(<= ~counter~0 0)} {19838#(<= ~counter~0 0)} #92#return; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {19838#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19838#(<= ~counter~0 0)} is VALID [2022-04-28 12:39:57,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {19838#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19887#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:57,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {19887#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {19887#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:57,312 INFO L272 TraceCheckUtils]: 19: Hoare triple {19887#(<= ~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)); {19887#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:57,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {19887#(<= ~counter~0 1)} ~cond := #in~cond; {19887#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:57,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {19887#(<= ~counter~0 1)} assume !(0 == ~cond); {19887#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:57,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {19887#(<= ~counter~0 1)} assume true; {19887#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:57,313 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19887#(<= ~counter~0 1)} {19887#(<= ~counter~0 1)} #94#return; {19887#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:57,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {19887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {19887#(<= ~counter~0 1)} is VALID [2022-04-28 12:39:57,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {19887#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19912#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:57,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {19912#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {19912#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:57,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {19912#(<= ~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)); {19912#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:57,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {19912#(<= ~counter~0 2)} ~cond := #in~cond; {19912#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:57,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {19912#(<= ~counter~0 2)} assume !(0 == ~cond); {19912#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:57,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {19912#(<= ~counter~0 2)} assume true; {19912#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:57,316 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19912#(<= ~counter~0 2)} {19912#(<= ~counter~0 2)} #96#return; {19912#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:57,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {19912#(<= ~counter~0 2)} assume !(~r~0 > 0); {19912#(<= ~counter~0 2)} is VALID [2022-04-28 12:39:57,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {19912#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19937#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:57,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {19937#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {19937#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:57,318 INFO L272 TraceCheckUtils]: 35: Hoare triple {19937#(<= ~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)); {19937#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:57,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {19937#(<= ~counter~0 3)} ~cond := #in~cond; {19937#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:57,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {19937#(<= ~counter~0 3)} assume !(0 == ~cond); {19937#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:57,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {19937#(<= ~counter~0 3)} assume true; {19937#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:57,320 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19937#(<= ~counter~0 3)} {19937#(<= ~counter~0 3)} #98#return; {19937#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:57,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {19937#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19937#(<= ~counter~0 3)} is VALID [2022-04-28 12:39:57,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {19937#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19962#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:57,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {19962#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {19962#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:57,321 INFO L272 TraceCheckUtils]: 43: Hoare triple {19962#(<= ~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)); {19962#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:57,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {19962#(<= ~counter~0 4)} ~cond := #in~cond; {19962#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:57,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {19962#(<= ~counter~0 4)} assume !(0 == ~cond); {19962#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:57,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {19962#(<= ~counter~0 4)} assume true; {19962#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:57,323 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {19962#(<= ~counter~0 4)} {19962#(<= ~counter~0 4)} #98#return; {19962#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:57,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {19962#(<= ~counter~0 4)} assume !(~r~0 < 0); {19962#(<= ~counter~0 4)} is VALID [2022-04-28 12:39:57,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {19962#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19987#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:57,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {19987#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {19987#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:57,324 INFO L272 TraceCheckUtils]: 51: Hoare triple {19987#(<= ~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)); {19987#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:57,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {19987#(<= ~counter~0 5)} ~cond := #in~cond; {19987#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:57,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {19987#(<= ~counter~0 5)} assume !(0 == ~cond); {19987#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:57,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {19987#(<= ~counter~0 5)} assume true; {19987#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:57,326 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19987#(<= ~counter~0 5)} {19987#(<= ~counter~0 5)} #94#return; {19987#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:57,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {19987#(<= ~counter~0 5)} assume !!(0 != ~r~0); {19987#(<= ~counter~0 5)} is VALID [2022-04-28 12:39:57,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {19987#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20012#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:57,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {20012#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {20012#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:57,328 INFO L272 TraceCheckUtils]: 59: Hoare triple {20012#(<= ~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)); {20012#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:57,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {20012#(<= ~counter~0 6)} ~cond := #in~cond; {20012#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:57,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {20012#(<= ~counter~0 6)} assume !(0 == ~cond); {20012#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:57,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {20012#(<= ~counter~0 6)} assume true; {20012#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:57,329 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20012#(<= ~counter~0 6)} {20012#(<= ~counter~0 6)} #96#return; {20012#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:57,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {20012#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20012#(<= ~counter~0 6)} is VALID [2022-04-28 12:39:57,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {20012#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20037#(<= |main_#t~post7| 6)} is VALID [2022-04-28 12:39:57,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {20037#(<= |main_#t~post7| 6)} assume !(#t~post7 < 50);havoc #t~post7; {19831#false} is VALID [2022-04-28 12:39:57,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {19831#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19831#false} is VALID [2022-04-28 12:39:57,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {19831#false} assume !(#t~post8 < 50);havoc #t~post8; {19831#false} is VALID [2022-04-28 12:39:57,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {19831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19831#false} is VALID [2022-04-28 12:39:57,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {19831#false} assume !(#t~post6 < 50);havoc #t~post6; {19831#false} is VALID [2022-04-28 12:39:57,330 INFO L272 TraceCheckUtils]: 71: Hoare triple {19831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19831#false} is VALID [2022-04-28 12:39:57,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {19831#false} ~cond := #in~cond; {19831#false} is VALID [2022-04-28 12:39:57,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {19831#false} assume 0 == ~cond; {19831#false} is VALID [2022-04-28 12:39:57,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {19831#false} assume !false; {19831#false} is VALID [2022-04-28 12:39:57,331 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-28 12:39:57,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:39:57,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {19831#false} assume !false; {19831#false} is VALID [2022-04-28 12:39:57,706 INFO L290 TraceCheckUtils]: 73: Hoare triple {19831#false} assume 0 == ~cond; {19831#false} is VALID [2022-04-28 12:39:57,706 INFO L290 TraceCheckUtils]: 72: Hoare triple {19831#false} ~cond := #in~cond; {19831#false} is VALID [2022-04-28 12:39:57,706 INFO L272 TraceCheckUtils]: 71: Hoare triple {19831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19831#false} is VALID [2022-04-28 12:39:57,706 INFO L290 TraceCheckUtils]: 70: Hoare triple {19831#false} assume !(#t~post6 < 50);havoc #t~post6; {19831#false} is VALID [2022-04-28 12:39:57,706 INFO L290 TraceCheckUtils]: 69: Hoare triple {19831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19831#false} is VALID [2022-04-28 12:39:57,706 INFO L290 TraceCheckUtils]: 68: Hoare triple {19831#false} assume !(#t~post8 < 50);havoc #t~post8; {19831#false} is VALID [2022-04-28 12:39:57,706 INFO L290 TraceCheckUtils]: 67: Hoare triple {19831#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19831#false} is VALID [2022-04-28 12:39:57,714 INFO L290 TraceCheckUtils]: 66: Hoare triple {20089#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {19831#false} is VALID [2022-04-28 12:39:57,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {20093#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20089#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:39:57,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {20093#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20093#(< ~counter~0 50)} is VALID [2022-04-28 12:39:57,715 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19830#true} {20093#(< ~counter~0 50)} #96#return; {20093#(< ~counter~0 50)} is VALID [2022-04-28 12:39:57,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 12:39:57,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 12:39:57,716 INFO L290 TraceCheckUtils]: 60: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 12:39:57,716 INFO L272 TraceCheckUtils]: 59: Hoare triple {20093#(< ~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)); {19830#true} is VALID [2022-04-28 12:39:57,716 INFO L290 TraceCheckUtils]: 58: Hoare triple {20093#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {20093#(< ~counter~0 50)} is VALID [2022-04-28 12:39:57,716 INFO L290 TraceCheckUtils]: 57: Hoare triple {20118#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20093#(< ~counter~0 50)} is VALID [2022-04-28 12:39:57,717 INFO L290 TraceCheckUtils]: 56: Hoare triple {20118#(< ~counter~0 49)} assume !!(0 != ~r~0); {20118#(< ~counter~0 49)} is VALID [2022-04-28 12:39:57,717 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19830#true} {20118#(< ~counter~0 49)} #94#return; {20118#(< ~counter~0 49)} is VALID [2022-04-28 12:39:57,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 12:39:57,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 12:39:57,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 12:39:57,717 INFO L272 TraceCheckUtils]: 51: Hoare triple {20118#(< ~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)); {19830#true} is VALID [2022-04-28 12:39:57,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {20118#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {20118#(< ~counter~0 49)} is VALID [2022-04-28 12:39:57,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {20143#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20118#(< ~counter~0 49)} is VALID [2022-04-28 12:39:57,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {20143#(< ~counter~0 48)} assume !(~r~0 < 0); {20143#(< ~counter~0 48)} is VALID [2022-04-28 12:39:57,718 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {19830#true} {20143#(< ~counter~0 48)} #98#return; {20143#(< ~counter~0 48)} is VALID [2022-04-28 12:39:57,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 12:39:57,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 12:39:57,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 12:39:57,719 INFO L272 TraceCheckUtils]: 43: Hoare triple {20143#(< ~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)); {19830#true} is VALID [2022-04-28 12:39:57,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {20143#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {20143#(< ~counter~0 48)} is VALID [2022-04-28 12:39:57,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {20168#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20143#(< ~counter~0 48)} is VALID [2022-04-28 12:39:57,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {20168#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20168#(< ~counter~0 47)} is VALID [2022-04-28 12:39:57,720 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19830#true} {20168#(< ~counter~0 47)} #98#return; {20168#(< ~counter~0 47)} is VALID [2022-04-28 12:39:57,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 12:39:57,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 12:39:57,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 12:39:57,720 INFO L272 TraceCheckUtils]: 35: Hoare triple {20168#(< ~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)); {19830#true} is VALID [2022-04-28 12:39:57,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {20168#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {20168#(< ~counter~0 47)} is VALID [2022-04-28 12:39:57,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {20193#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20168#(< ~counter~0 47)} is VALID [2022-04-28 12:39:57,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {20193#(< ~counter~0 46)} assume !(~r~0 > 0); {20193#(< ~counter~0 46)} is VALID [2022-04-28 12:39:57,721 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19830#true} {20193#(< ~counter~0 46)} #96#return; {20193#(< ~counter~0 46)} is VALID [2022-04-28 12:39:57,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 12:39:57,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 12:39:57,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 12:39:57,721 INFO L272 TraceCheckUtils]: 27: Hoare triple {20193#(< ~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)); {19830#true} is VALID [2022-04-28 12:39:57,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {20193#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {20193#(< ~counter~0 46)} is VALID [2022-04-28 12:39:57,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {20218#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20193#(< ~counter~0 46)} is VALID [2022-04-28 12:39:57,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {20218#(< ~counter~0 45)} assume !!(0 != ~r~0); {20218#(< ~counter~0 45)} is VALID [2022-04-28 12:39:57,722 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19830#true} {20218#(< ~counter~0 45)} #94#return; {20218#(< ~counter~0 45)} is VALID [2022-04-28 12:39:57,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 12:39:57,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 12:39:57,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 12:39:57,723 INFO L272 TraceCheckUtils]: 19: Hoare triple {20218#(< ~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)); {19830#true} is VALID [2022-04-28 12:39:57,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {20218#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {20218#(< ~counter~0 45)} is VALID [2022-04-28 12:39:57,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {20243#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20218#(< ~counter~0 45)} is VALID [2022-04-28 12:39:57,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {20243#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20243#(< ~counter~0 44)} is VALID [2022-04-28 12:39:57,724 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19830#true} {20243#(< ~counter~0 44)} #92#return; {20243#(< ~counter~0 44)} is VALID [2022-04-28 12:39:57,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 12:39:57,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 12:39:57,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 12:39:57,724 INFO L272 TraceCheckUtils]: 11: Hoare triple {20243#(< ~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)); {19830#true} is VALID [2022-04-28 12:39:57,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19830#true} {20243#(< ~counter~0 44)} #90#return; {20243#(< ~counter~0 44)} is VALID [2022-04-28 12:39:57,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {19830#true} assume true; {19830#true} is VALID [2022-04-28 12:39:57,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {19830#true} assume !(0 == ~cond); {19830#true} is VALID [2022-04-28 12:39:57,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {19830#true} ~cond := #in~cond; {19830#true} is VALID [2022-04-28 12:39:57,725 INFO L272 TraceCheckUtils]: 6: Hoare triple {20243#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19830#true} is VALID [2022-04-28 12:39:57,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {20243#(< ~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; {20243#(< ~counter~0 44)} is VALID [2022-04-28 12:39:57,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {20243#(< ~counter~0 44)} call #t~ret9 := main(); {20243#(< ~counter~0 44)} is VALID [2022-04-28 12:39:57,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20243#(< ~counter~0 44)} {19830#true} #102#return; {20243#(< ~counter~0 44)} is VALID [2022-04-28 12:39:57,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {20243#(< ~counter~0 44)} assume true; {20243#(< ~counter~0 44)} is VALID [2022-04-28 12:39:57,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {19830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20243#(< ~counter~0 44)} is VALID [2022-04-28 12:39:57,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {19830#true} call ULTIMATE.init(); {19830#true} is VALID [2022-04-28 12:39:57,726 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-28 12:39:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:39:57,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104074809] [2022-04-28 12:39:57,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:39:57,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064959707] [2022-04-28 12:39:57,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064959707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:39:57,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:39:57,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 12:39:57,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:39:57,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1979735262] [2022-04-28 12:39:57,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1979735262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:57,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:57,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:39:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358894117] [2022-04-28 12:39:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:39:57,728 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-28 12:39:57,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:39:57,728 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-28 12:39:57,761 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-28 12:39:57,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:39:57,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:57,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:39:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:39:57,762 INFO L87 Difference]: Start difference. First operand 213 states and 276 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-28 12:39:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:58,222 INFO L93 Difference]: Finished difference Result 286 states and 378 transitions. [2022-04-28 12:39:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:39:58,222 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-28 12:39:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:39:58,223 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-28 12:39:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-28 12:39:58,224 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-28 12:39:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-28 12:39:58,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-28 12:39:58,337 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-28 12:39:58,341 INFO L225 Difference]: With dead ends: 286 [2022-04-28 12:39:58,341 INFO L226 Difference]: Without dead ends: 222 [2022-04-28 12:39:58,341 INFO L412 NwaCegarLoop]: 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-28 12:39:58,342 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:39:58,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 201 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:39:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-28 12:39:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-28 12:39:58,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:39:58,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:58,524 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:58,524 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:58,527 INFO L93 Difference]: Finished difference Result 222 states and 285 transitions. [2022-04-28 12:39:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 285 transitions. [2022-04-28 12:39:58,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:58,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:58,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 222 states. [2022-04-28 12:39:58,528 INFO L87 Difference]: Start difference. First operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 222 states. [2022-04-28 12:39:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:58,531 INFO L93 Difference]: Finished difference Result 222 states and 285 transitions. [2022-04-28 12:39:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 285 transitions. [2022-04-28 12:39:58,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:58,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:58,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:39:58,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:39:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 43 states have call successors, (43), 14 states have call predecessors, (43), 12 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:39:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 285 transitions. [2022-04-28 12:39:58,535 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 285 transitions. Word has length 75 [2022-04-28 12:39:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:39:58,535 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 285 transitions. [2022-04-28 12:39:58,536 INFO L496 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-28 12:39:58,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 285 transitions. [2022-04-28 12:40:09,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 282 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:40:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 285 transitions. [2022-04-28 12:40:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 12:40:09,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:40:09,335 INFO L195 NwaCegarLoop]: 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-28 12:40:09,378 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-28 12:40:09,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:40:09,536 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:40:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:40:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-28 12:40:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:40:09,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1508005329] [2022-04-28 12:40:09,536 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:40:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-28 12:40:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:40:09,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565195284] [2022-04-28 12:40:09,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:40:09,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:40:09,549 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:40:09,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345348593] [2022-04-28 12:40:09,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:40:09,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:40:09,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:40:09,551 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:40:09,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 12:40:09,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:40:09,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:40:09,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 12:40:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:40:09,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:40:10,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {21767#true} call ULTIMATE.init(); {21767#true} is VALID [2022-04-28 12:40:10,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {21767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {21775#(<= ~counter~0 0)} assume true; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21775#(<= ~counter~0 0)} {21767#true} #102#return; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {21775#(<= ~counter~0 0)} call #t~ret9 := main(); {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {21775#(<= ~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; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {21775#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {21775#(<= ~counter~0 0)} ~cond := #in~cond; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {21775#(<= ~counter~0 0)} assume !(0 == ~cond); {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {21775#(<= ~counter~0 0)} assume true; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21775#(<= ~counter~0 0)} {21775#(<= ~counter~0 0)} #90#return; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,017 INFO L272 TraceCheckUtils]: 11: Hoare triple {21775#(<= ~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)); {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {21775#(<= ~counter~0 0)} ~cond := #in~cond; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {21775#(<= ~counter~0 0)} assume !(0 == ~cond); {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {21775#(<= ~counter~0 0)} assume true; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21775#(<= ~counter~0 0)} {21775#(<= ~counter~0 0)} #92#return; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {21775#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21775#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:10,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {21775#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21824#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:10,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {21824#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {21824#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:10,020 INFO L272 TraceCheckUtils]: 19: Hoare triple {21824#(<= ~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)); {21824#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:10,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {21824#(<= ~counter~0 1)} ~cond := #in~cond; {21824#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:10,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {21824#(<= ~counter~0 1)} assume !(0 == ~cond); {21824#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:10,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {21824#(<= ~counter~0 1)} assume true; {21824#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:10,021 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21824#(<= ~counter~0 1)} {21824#(<= ~counter~0 1)} #94#return; {21824#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:10,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {21824#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21824#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:10,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {21824#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21849#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:10,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {21849#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {21849#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:10,023 INFO L272 TraceCheckUtils]: 27: Hoare triple {21849#(<= ~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)); {21849#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:10,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {21849#(<= ~counter~0 2)} ~cond := #in~cond; {21849#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:10,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {21849#(<= ~counter~0 2)} assume !(0 == ~cond); {21849#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:10,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {21849#(<= ~counter~0 2)} assume true; {21849#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:10,024 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21849#(<= ~counter~0 2)} {21849#(<= ~counter~0 2)} #96#return; {21849#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:10,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {21849#(<= ~counter~0 2)} assume !(~r~0 > 0); {21849#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:10,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {21849#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21874#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:10,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {21874#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {21874#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:10,026 INFO L272 TraceCheckUtils]: 35: Hoare triple {21874#(<= ~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)); {21874#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:10,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {21874#(<= ~counter~0 3)} ~cond := #in~cond; {21874#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:10,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {21874#(<= ~counter~0 3)} assume !(0 == ~cond); {21874#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:10,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {21874#(<= ~counter~0 3)} assume true; {21874#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:10,027 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21874#(<= ~counter~0 3)} {21874#(<= ~counter~0 3)} #98#return; {21874#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:10,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {21874#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21874#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:10,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {21874#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21899#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:10,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {21899#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {21899#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:10,029 INFO L272 TraceCheckUtils]: 43: Hoare triple {21899#(<= ~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)); {21899#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:10,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {21899#(<= ~counter~0 4)} ~cond := #in~cond; {21899#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:10,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {21899#(<= ~counter~0 4)} assume !(0 == ~cond); {21899#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:10,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {21899#(<= ~counter~0 4)} assume true; {21899#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:10,030 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21899#(<= ~counter~0 4)} {21899#(<= ~counter~0 4)} #98#return; {21899#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:10,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {21899#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21899#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:10,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {21899#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21924#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:10,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {21924#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {21924#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:10,031 INFO L272 TraceCheckUtils]: 51: Hoare triple {21924#(<= ~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)); {21924#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:10,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {21924#(<= ~counter~0 5)} ~cond := #in~cond; {21924#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:10,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {21924#(<= ~counter~0 5)} assume !(0 == ~cond); {21924#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:10,032 INFO L290 TraceCheckUtils]: 54: Hoare triple {21924#(<= ~counter~0 5)} assume true; {21924#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:10,033 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21924#(<= ~counter~0 5)} {21924#(<= ~counter~0 5)} #98#return; {21924#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:10,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {21924#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21924#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:10,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {21924#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21949#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:10,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {21949#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {21949#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:10,034 INFO L272 TraceCheckUtils]: 59: Hoare triple {21949#(<= ~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)); {21949#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:10,034 INFO L290 TraceCheckUtils]: 60: Hoare triple {21949#(<= ~counter~0 6)} ~cond := #in~cond; {21949#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:10,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {21949#(<= ~counter~0 6)} assume !(0 == ~cond); {21949#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:10,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {21949#(<= ~counter~0 6)} assume true; {21949#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:10,036 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21949#(<= ~counter~0 6)} {21949#(<= ~counter~0 6)} #98#return; {21949#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:10,036 INFO L290 TraceCheckUtils]: 64: Hoare triple {21949#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21949#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:10,036 INFO L290 TraceCheckUtils]: 65: Hoare triple {21949#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21974#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:10,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {21974#(<= ~counter~0 7)} assume !!(#t~post8 < 50);havoc #t~post8; {21974#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:10,037 INFO L272 TraceCheckUtils]: 67: Hoare triple {21974#(<= ~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)); {21974#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:10,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {21974#(<= ~counter~0 7)} ~cond := #in~cond; {21974#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:10,038 INFO L290 TraceCheckUtils]: 69: Hoare triple {21974#(<= ~counter~0 7)} assume !(0 == ~cond); {21974#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:10,038 INFO L290 TraceCheckUtils]: 70: Hoare triple {21974#(<= ~counter~0 7)} assume true; {21974#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:10,038 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21974#(<= ~counter~0 7)} {21974#(<= ~counter~0 7)} #98#return; {21974#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:10,039 INFO L290 TraceCheckUtils]: 72: Hoare triple {21974#(<= ~counter~0 7)} assume !(~r~0 < 0); {21974#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:10,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {21974#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21999#(<= |main_#t~post6| 7)} is VALID [2022-04-28 12:40:10,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {21999#(<= |main_#t~post6| 7)} assume !(#t~post6 < 50);havoc #t~post6; {21768#false} is VALID [2022-04-28 12:40:10,039 INFO L272 TraceCheckUtils]: 75: Hoare triple {21768#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21768#false} is VALID [2022-04-28 12:40:10,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {21768#false} ~cond := #in~cond; {21768#false} is VALID [2022-04-28 12:40:10,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {21768#false} assume 0 == ~cond; {21768#false} is VALID [2022-04-28 12:40:10,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {21768#false} assume !false; {21768#false} is VALID [2022-04-28 12:40:10,040 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-28 12:40:10,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:40:10,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {21768#false} assume !false; {21768#false} is VALID [2022-04-28 12:40:10,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {21768#false} assume 0 == ~cond; {21768#false} is VALID [2022-04-28 12:40:10,452 INFO L290 TraceCheckUtils]: 76: Hoare triple {21768#false} ~cond := #in~cond; {21768#false} is VALID [2022-04-28 12:40:10,452 INFO L272 TraceCheckUtils]: 75: Hoare triple {21768#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21768#false} is VALID [2022-04-28 12:40:10,452 INFO L290 TraceCheckUtils]: 74: Hoare triple {22027#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {21768#false} is VALID [2022-04-28 12:40:10,452 INFO L290 TraceCheckUtils]: 73: Hoare triple {22031#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22027#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:40:10,453 INFO L290 TraceCheckUtils]: 72: Hoare triple {22031#(< ~counter~0 50)} assume !(~r~0 < 0); {22031#(< ~counter~0 50)} is VALID [2022-04-28 12:40:10,453 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21767#true} {22031#(< ~counter~0 50)} #98#return; {22031#(< ~counter~0 50)} is VALID [2022-04-28 12:40:10,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,453 INFO L290 TraceCheckUtils]: 68: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,453 INFO L272 TraceCheckUtils]: 67: Hoare triple {22031#(< ~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)); {21767#true} is VALID [2022-04-28 12:40:10,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {22031#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {22031#(< ~counter~0 50)} is VALID [2022-04-28 12:40:10,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {22056#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22031#(< ~counter~0 50)} is VALID [2022-04-28 12:40:10,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {22056#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22056#(< ~counter~0 49)} is VALID [2022-04-28 12:40:10,455 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21767#true} {22056#(< ~counter~0 49)} #98#return; {22056#(< ~counter~0 49)} is VALID [2022-04-28 12:40:10,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,455 INFO L272 TraceCheckUtils]: 59: Hoare triple {22056#(< ~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)); {21767#true} is VALID [2022-04-28 12:40:10,455 INFO L290 TraceCheckUtils]: 58: Hoare triple {22056#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {22056#(< ~counter~0 49)} is VALID [2022-04-28 12:40:10,455 INFO L290 TraceCheckUtils]: 57: Hoare triple {22081#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22056#(< ~counter~0 49)} is VALID [2022-04-28 12:40:10,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {22081#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22081#(< ~counter~0 48)} is VALID [2022-04-28 12:40:10,456 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21767#true} {22081#(< ~counter~0 48)} #98#return; {22081#(< ~counter~0 48)} is VALID [2022-04-28 12:40:10,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,456 INFO L272 TraceCheckUtils]: 51: Hoare triple {22081#(< ~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)); {21767#true} is VALID [2022-04-28 12:40:10,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {22081#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {22081#(< ~counter~0 48)} is VALID [2022-04-28 12:40:10,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {22106#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22081#(< ~counter~0 48)} is VALID [2022-04-28 12:40:10,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {22106#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22106#(< ~counter~0 47)} is VALID [2022-04-28 12:40:10,457 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21767#true} {22106#(< ~counter~0 47)} #98#return; {22106#(< ~counter~0 47)} is VALID [2022-04-28 12:40:10,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,458 INFO L272 TraceCheckUtils]: 43: Hoare triple {22106#(< ~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)); {21767#true} is VALID [2022-04-28 12:40:10,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {22106#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {22106#(< ~counter~0 47)} is VALID [2022-04-28 12:40:10,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {22131#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22106#(< ~counter~0 47)} is VALID [2022-04-28 12:40:10,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {22131#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22131#(< ~counter~0 46)} is VALID [2022-04-28 12:40:10,459 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21767#true} {22131#(< ~counter~0 46)} #98#return; {22131#(< ~counter~0 46)} is VALID [2022-04-28 12:40:10,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,459 INFO L272 TraceCheckUtils]: 35: Hoare triple {22131#(< ~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)); {21767#true} is VALID [2022-04-28 12:40:10,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {22131#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {22131#(< ~counter~0 46)} is VALID [2022-04-28 12:40:10,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {22156#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22131#(< ~counter~0 46)} is VALID [2022-04-28 12:40:10,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {22156#(< ~counter~0 45)} assume !(~r~0 > 0); {22156#(< ~counter~0 45)} is VALID [2022-04-28 12:40:10,460 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21767#true} {22156#(< ~counter~0 45)} #96#return; {22156#(< ~counter~0 45)} is VALID [2022-04-28 12:40:10,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,460 INFO L272 TraceCheckUtils]: 27: Hoare triple {22156#(< ~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)); {21767#true} is VALID [2022-04-28 12:40:10,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {22156#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {22156#(< ~counter~0 45)} is VALID [2022-04-28 12:40:10,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {22181#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22156#(< ~counter~0 45)} is VALID [2022-04-28 12:40:10,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {22181#(< ~counter~0 44)} assume !!(0 != ~r~0); {22181#(< ~counter~0 44)} is VALID [2022-04-28 12:40:10,461 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21767#true} {22181#(< ~counter~0 44)} #94#return; {22181#(< ~counter~0 44)} is VALID [2022-04-28 12:40:10,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,462 INFO L272 TraceCheckUtils]: 19: Hoare triple {22181#(< ~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)); {21767#true} is VALID [2022-04-28 12:40:10,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {22181#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {22181#(< ~counter~0 44)} is VALID [2022-04-28 12:40:10,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {22206#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22181#(< ~counter~0 44)} is VALID [2022-04-28 12:40:10,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {22206#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22206#(< ~counter~0 43)} is VALID [2022-04-28 12:40:10,463 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21767#true} {22206#(< ~counter~0 43)} #92#return; {22206#(< ~counter~0 43)} is VALID [2022-04-28 12:40:10,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,463 INFO L272 TraceCheckUtils]: 11: Hoare triple {22206#(< ~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)); {21767#true} is VALID [2022-04-28 12:40:10,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21767#true} {22206#(< ~counter~0 43)} #90#return; {22206#(< ~counter~0 43)} is VALID [2022-04-28 12:40:10,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {21767#true} assume true; {21767#true} is VALID [2022-04-28 12:40:10,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {21767#true} assume !(0 == ~cond); {21767#true} is VALID [2022-04-28 12:40:10,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {21767#true} ~cond := #in~cond; {21767#true} is VALID [2022-04-28 12:40:10,463 INFO L272 TraceCheckUtils]: 6: Hoare triple {22206#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21767#true} is VALID [2022-04-28 12:40:10,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {22206#(< ~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; {22206#(< ~counter~0 43)} is VALID [2022-04-28 12:40:10,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {22206#(< ~counter~0 43)} call #t~ret9 := main(); {22206#(< ~counter~0 43)} is VALID [2022-04-28 12:40:10,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22206#(< ~counter~0 43)} {21767#true} #102#return; {22206#(< ~counter~0 43)} is VALID [2022-04-28 12:40:10,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {22206#(< ~counter~0 43)} assume true; {22206#(< ~counter~0 43)} is VALID [2022-04-28 12:40:10,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {21767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22206#(< ~counter~0 43)} is VALID [2022-04-28 12:40:10,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {21767#true} call ULTIMATE.init(); {21767#true} is VALID [2022-04-28 12:40:10,465 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-28 12:40:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:40:10,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565195284] [2022-04-28 12:40:10,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:40:10,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345348593] [2022-04-28 12:40:10,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345348593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:40:10,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:40:10,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 12:40:10,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:40:10,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1508005329] [2022-04-28 12:40:10,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1508005329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:40:10,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:40:10,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:40:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267609038] [2022-04-28 12:40:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:40:10,468 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-28 12:40:10,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:40:10,468 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-28 12:40:10,503 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-28 12:40:10,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:40:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:40:10,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:40:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:40:10,504 INFO L87 Difference]: Start difference. First operand 222 states and 285 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-28 12:40:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:11,160 INFO L93 Difference]: Finished difference Result 257 states and 329 transitions. [2022-04-28 12:40:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:40:11,160 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-28 12:40:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:40:11,161 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-28 12:40:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-28 12:40:11,162 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-28 12:40:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-28 12:40:11,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-28 12:40:11,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:40:11,241 INFO L225 Difference]: With dead ends: 257 [2022-04-28 12:40:11,241 INFO L226 Difference]: Without dead ends: 252 [2022-04-28 12:40:11,241 INFO L412 NwaCegarLoop]: 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-28 12:40:11,247 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:40:11,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 193 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:40:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-04-28 12:40:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 243. [2022-04-28 12:40:11,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:40:11,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand has 243 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 185 states have internal predecessors, (215), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 41 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:11,456 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand has 243 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 185 states have internal predecessors, (215), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 41 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:11,456 INFO L87 Difference]: Start difference. First operand 252 states. Second operand has 243 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 185 states have internal predecessors, (215), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 41 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:11,459 INFO L93 Difference]: Finished difference Result 252 states and 323 transitions. [2022-04-28 12:40:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 323 transitions. [2022-04-28 12:40:11,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:40:11,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:40:11,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 185 states have internal predecessors, (215), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 41 states have call predecessors, (48), 48 states have call successors, (48) Second operand 252 states. [2022-04-28 12:40:11,460 INFO L87 Difference]: Start difference. First operand has 243 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 185 states have internal predecessors, (215), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 41 states have call predecessors, (48), 48 states have call successors, (48) Second operand 252 states. [2022-04-28 12:40:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:11,464 INFO L93 Difference]: Finished difference Result 252 states and 323 transitions. [2022-04-28 12:40:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 323 transitions. [2022-04-28 12:40:11,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:40:11,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:40:11,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:40:11,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:40:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 185 states have internal predecessors, (215), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 41 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 313 transitions. [2022-04-28 12:40:11,476 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 313 transitions. Word has length 79 [2022-04-28 12:40:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:40:11,476 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 313 transitions. [2022-04-28 12:40:11,476 INFO L496 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-28 12:40:11,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 313 transitions. [2022-04-28 12:40:20,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 311 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:40:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 313 transitions. [2022-04-28 12:40:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 12:40:20,599 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:40:20,599 INFO L195 NwaCegarLoop]: 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-28 12:40:20,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 12:40:20,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:40:20,799 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:40:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:40:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-28 12:40:20,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:40:20,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [626454122] [2022-04-28 12:40:20,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:40:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-28 12:40:20,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:40:20,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461468733] [2022-04-28 12:40:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:40:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:40:20,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:40:20,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20696821] [2022-04-28 12:40:20,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:40:20,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:40:20,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:40:20,816 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:40:20,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 12:40:20,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:40:20,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:40:20,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 12:40:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:40:20,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:40:21,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {23772#true} call ULTIMATE.init(); {23772#true} is VALID [2022-04-28 12:40:21,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {23772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {23780#(<= ~counter~0 0)} assume true; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23780#(<= ~counter~0 0)} {23772#true} #102#return; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {23780#(<= ~counter~0 0)} call #t~ret9 := main(); {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {23780#(<= ~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; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {23780#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {23780#(<= ~counter~0 0)} ~cond := #in~cond; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {23780#(<= ~counter~0 0)} assume !(0 == ~cond); {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {23780#(<= ~counter~0 0)} assume true; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23780#(<= ~counter~0 0)} {23780#(<= ~counter~0 0)} #90#return; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,303 INFO L272 TraceCheckUtils]: 11: Hoare triple {23780#(<= ~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)); {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {23780#(<= ~counter~0 0)} ~cond := #in~cond; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {23780#(<= ~counter~0 0)} assume !(0 == ~cond); {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {23780#(<= ~counter~0 0)} assume true; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,304 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23780#(<= ~counter~0 0)} {23780#(<= ~counter~0 0)} #92#return; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {23780#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23780#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:21,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {23780#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23829#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:21,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {23829#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23829#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:21,306 INFO L272 TraceCheckUtils]: 19: Hoare triple {23829#(<= ~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)); {23829#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:21,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {23829#(<= ~counter~0 1)} ~cond := #in~cond; {23829#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:21,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {23829#(<= ~counter~0 1)} assume !(0 == ~cond); {23829#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:21,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {23829#(<= ~counter~0 1)} assume true; {23829#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:21,307 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23829#(<= ~counter~0 1)} {23829#(<= ~counter~0 1)} #94#return; {23829#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:21,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {23829#(<= ~counter~0 1)} assume !!(0 != ~r~0); {23829#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:21,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {23829#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23854#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:21,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {23854#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {23854#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:21,309 INFO L272 TraceCheckUtils]: 27: Hoare triple {23854#(<= ~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)); {23854#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:21,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {23854#(<= ~counter~0 2)} ~cond := #in~cond; {23854#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:21,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {23854#(<= ~counter~0 2)} assume !(0 == ~cond); {23854#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:21,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {23854#(<= ~counter~0 2)} assume true; {23854#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:21,313 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23854#(<= ~counter~0 2)} {23854#(<= ~counter~0 2)} #96#return; {23854#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:21,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {23854#(<= ~counter~0 2)} assume !(~r~0 > 0); {23854#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:21,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {23854#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23879#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:21,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {23879#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {23879#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:21,314 INFO L272 TraceCheckUtils]: 35: Hoare triple {23879#(<= ~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)); {23879#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:21,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {23879#(<= ~counter~0 3)} ~cond := #in~cond; {23879#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:21,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {23879#(<= ~counter~0 3)} assume !(0 == ~cond); {23879#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:21,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {23879#(<= ~counter~0 3)} assume true; {23879#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:21,315 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23879#(<= ~counter~0 3)} {23879#(<= ~counter~0 3)} #98#return; {23879#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:21,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {23879#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23879#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:21,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {23879#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23904#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:21,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {23904#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {23904#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:21,317 INFO L272 TraceCheckUtils]: 43: Hoare triple {23904#(<= ~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)); {23904#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:21,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {23904#(<= ~counter~0 4)} ~cond := #in~cond; {23904#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:21,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {23904#(<= ~counter~0 4)} assume !(0 == ~cond); {23904#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:21,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {23904#(<= ~counter~0 4)} assume true; {23904#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:21,318 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23904#(<= ~counter~0 4)} {23904#(<= ~counter~0 4)} #98#return; {23904#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:21,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {23904#(<= ~counter~0 4)} assume !(~r~0 < 0); {23904#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:21,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {23904#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23929#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:21,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {23929#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {23929#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:21,320 INFO L272 TraceCheckUtils]: 51: Hoare triple {23929#(<= ~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)); {23929#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:21,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {23929#(<= ~counter~0 5)} ~cond := #in~cond; {23929#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:21,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {23929#(<= ~counter~0 5)} assume !(0 == ~cond); {23929#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:21,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {23929#(<= ~counter~0 5)} assume true; {23929#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:21,321 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23929#(<= ~counter~0 5)} {23929#(<= ~counter~0 5)} #94#return; {23929#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:21,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {23929#(<= ~counter~0 5)} assume !!(0 != ~r~0); {23929#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:21,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {23929#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23954#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:21,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {23954#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {23954#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:21,324 INFO L272 TraceCheckUtils]: 59: Hoare triple {23954#(<= ~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)); {23954#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:21,324 INFO L290 TraceCheckUtils]: 60: Hoare triple {23954#(<= ~counter~0 6)} ~cond := #in~cond; {23954#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:21,324 INFO L290 TraceCheckUtils]: 61: Hoare triple {23954#(<= ~counter~0 6)} assume !(0 == ~cond); {23954#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:21,325 INFO L290 TraceCheckUtils]: 62: Hoare triple {23954#(<= ~counter~0 6)} assume true; {23954#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:21,325 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23954#(<= ~counter~0 6)} {23954#(<= ~counter~0 6)} #96#return; {23954#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:21,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {23954#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23954#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:21,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {23954#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23979#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:21,326 INFO L290 TraceCheckUtils]: 66: Hoare triple {23979#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {23979#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:21,327 INFO L272 TraceCheckUtils]: 67: Hoare triple {23979#(<= ~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)); {23979#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:21,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {23979#(<= ~counter~0 7)} ~cond := #in~cond; {23979#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:21,327 INFO L290 TraceCheckUtils]: 69: Hoare triple {23979#(<= ~counter~0 7)} assume !(0 == ~cond); {23979#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:21,327 INFO L290 TraceCheckUtils]: 70: Hoare triple {23979#(<= ~counter~0 7)} assume true; {23979#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:21,328 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23979#(<= ~counter~0 7)} {23979#(<= ~counter~0 7)} #96#return; {23979#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:21,328 INFO L290 TraceCheckUtils]: 72: Hoare triple {23979#(<= ~counter~0 7)} assume !(~r~0 > 0); {23979#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:21,328 INFO L290 TraceCheckUtils]: 73: Hoare triple {23979#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24004#(<= |main_#t~post8| 7)} is VALID [2022-04-28 12:40:21,328 INFO L290 TraceCheckUtils]: 74: Hoare triple {24004#(<= |main_#t~post8| 7)} assume !(#t~post8 < 50);havoc #t~post8; {23773#false} is VALID [2022-04-28 12:40:21,329 INFO L290 TraceCheckUtils]: 75: Hoare triple {23773#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23773#false} is VALID [2022-04-28 12:40:21,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {23773#false} assume !(#t~post6 < 50);havoc #t~post6; {23773#false} is VALID [2022-04-28 12:40:21,329 INFO L272 TraceCheckUtils]: 77: Hoare triple {23773#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23773#false} is VALID [2022-04-28 12:40:21,329 INFO L290 TraceCheckUtils]: 78: Hoare triple {23773#false} ~cond := #in~cond; {23773#false} is VALID [2022-04-28 12:40:21,329 INFO L290 TraceCheckUtils]: 79: Hoare triple {23773#false} assume 0 == ~cond; {23773#false} is VALID [2022-04-28 12:40:21,329 INFO L290 TraceCheckUtils]: 80: Hoare triple {23773#false} assume !false; {23773#false} is VALID [2022-04-28 12:40:21,329 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-28 12:40:21,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:40:21,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {23773#false} assume !false; {23773#false} is VALID [2022-04-28 12:40:21,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {23773#false} assume 0 == ~cond; {23773#false} is VALID [2022-04-28 12:40:21,719 INFO L290 TraceCheckUtils]: 78: Hoare triple {23773#false} ~cond := #in~cond; {23773#false} is VALID [2022-04-28 12:40:21,719 INFO L272 TraceCheckUtils]: 77: Hoare triple {23773#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23773#false} is VALID [2022-04-28 12:40:21,719 INFO L290 TraceCheckUtils]: 76: Hoare triple {23773#false} assume !(#t~post6 < 50);havoc #t~post6; {23773#false} is VALID [2022-04-28 12:40:21,719 INFO L290 TraceCheckUtils]: 75: Hoare triple {23773#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23773#false} is VALID [2022-04-28 12:40:21,719 INFO L290 TraceCheckUtils]: 74: Hoare triple {24044#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {23773#false} is VALID [2022-04-28 12:40:21,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {24048#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24044#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:40:21,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {24048#(< ~counter~0 50)} assume !(~r~0 > 0); {24048#(< ~counter~0 50)} is VALID [2022-04-28 12:40:21,721 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23772#true} {24048#(< ~counter~0 50)} #96#return; {24048#(< ~counter~0 50)} is VALID [2022-04-28 12:40:21,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,721 INFO L290 TraceCheckUtils]: 68: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,721 INFO L272 TraceCheckUtils]: 67: Hoare triple {24048#(< ~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)); {23772#true} is VALID [2022-04-28 12:40:21,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {24048#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {24048#(< ~counter~0 50)} is VALID [2022-04-28 12:40:21,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {24073#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24048#(< ~counter~0 50)} is VALID [2022-04-28 12:40:21,722 INFO L290 TraceCheckUtils]: 64: Hoare triple {24073#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24073#(< ~counter~0 49)} is VALID [2022-04-28 12:40:21,723 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23772#true} {24073#(< ~counter~0 49)} #96#return; {24073#(< ~counter~0 49)} is VALID [2022-04-28 12:40:21,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,723 INFO L272 TraceCheckUtils]: 59: Hoare triple {24073#(< ~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)); {23772#true} is VALID [2022-04-28 12:40:21,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {24073#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {24073#(< ~counter~0 49)} is VALID [2022-04-28 12:40:21,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {24098#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24073#(< ~counter~0 49)} is VALID [2022-04-28 12:40:21,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {24098#(< ~counter~0 48)} assume !!(0 != ~r~0); {24098#(< ~counter~0 48)} is VALID [2022-04-28 12:40:21,724 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23772#true} {24098#(< ~counter~0 48)} #94#return; {24098#(< ~counter~0 48)} is VALID [2022-04-28 12:40:21,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,725 INFO L272 TraceCheckUtils]: 51: Hoare triple {24098#(< ~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)); {23772#true} is VALID [2022-04-28 12:40:21,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {24098#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {24098#(< ~counter~0 48)} is VALID [2022-04-28 12:40:21,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {24123#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24098#(< ~counter~0 48)} is VALID [2022-04-28 12:40:21,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {24123#(< ~counter~0 47)} assume !(~r~0 < 0); {24123#(< ~counter~0 47)} is VALID [2022-04-28 12:40:21,726 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23772#true} {24123#(< ~counter~0 47)} #98#return; {24123#(< ~counter~0 47)} is VALID [2022-04-28 12:40:21,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,726 INFO L272 TraceCheckUtils]: 43: Hoare triple {24123#(< ~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)); {23772#true} is VALID [2022-04-28 12:40:21,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {24123#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {24123#(< ~counter~0 47)} is VALID [2022-04-28 12:40:21,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {24148#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24123#(< ~counter~0 47)} is VALID [2022-04-28 12:40:21,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {24148#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24148#(< ~counter~0 46)} is VALID [2022-04-28 12:40:21,728 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23772#true} {24148#(< ~counter~0 46)} #98#return; {24148#(< ~counter~0 46)} is VALID [2022-04-28 12:40:21,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,728 INFO L272 TraceCheckUtils]: 35: Hoare triple {24148#(< ~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)); {23772#true} is VALID [2022-04-28 12:40:21,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {24148#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {24148#(< ~counter~0 46)} is VALID [2022-04-28 12:40:21,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {24173#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24148#(< ~counter~0 46)} is VALID [2022-04-28 12:40:21,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {24173#(< ~counter~0 45)} assume !(~r~0 > 0); {24173#(< ~counter~0 45)} is VALID [2022-04-28 12:40:21,729 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23772#true} {24173#(< ~counter~0 45)} #96#return; {24173#(< ~counter~0 45)} is VALID [2022-04-28 12:40:21,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,730 INFO L272 TraceCheckUtils]: 27: Hoare triple {24173#(< ~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)); {23772#true} is VALID [2022-04-28 12:40:21,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {24173#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {24173#(< ~counter~0 45)} is VALID [2022-04-28 12:40:21,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {24198#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24173#(< ~counter~0 45)} is VALID [2022-04-28 12:40:21,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {24198#(< ~counter~0 44)} assume !!(0 != ~r~0); {24198#(< ~counter~0 44)} is VALID [2022-04-28 12:40:21,731 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23772#true} {24198#(< ~counter~0 44)} #94#return; {24198#(< ~counter~0 44)} is VALID [2022-04-28 12:40:21,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,731 INFO L272 TraceCheckUtils]: 19: Hoare triple {24198#(< ~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)); {23772#true} is VALID [2022-04-28 12:40:21,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {24198#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {24198#(< ~counter~0 44)} is VALID [2022-04-28 12:40:21,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {24223#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24198#(< ~counter~0 44)} is VALID [2022-04-28 12:40:21,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {24223#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {24223#(< ~counter~0 43)} is VALID [2022-04-28 12:40:21,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23772#true} {24223#(< ~counter~0 43)} #92#return; {24223#(< ~counter~0 43)} is VALID [2022-04-28 12:40:21,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,733 INFO L272 TraceCheckUtils]: 11: Hoare triple {24223#(< ~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)); {23772#true} is VALID [2022-04-28 12:40:21,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23772#true} {24223#(< ~counter~0 43)} #90#return; {24223#(< ~counter~0 43)} is VALID [2022-04-28 12:40:21,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {23772#true} assume true; {23772#true} is VALID [2022-04-28 12:40:21,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {23772#true} assume !(0 == ~cond); {23772#true} is VALID [2022-04-28 12:40:21,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {23772#true} ~cond := #in~cond; {23772#true} is VALID [2022-04-28 12:40:21,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {24223#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23772#true} is VALID [2022-04-28 12:40:21,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {24223#(< ~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; {24223#(< ~counter~0 43)} is VALID [2022-04-28 12:40:21,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {24223#(< ~counter~0 43)} call #t~ret9 := main(); {24223#(< ~counter~0 43)} is VALID [2022-04-28 12:40:21,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24223#(< ~counter~0 43)} {23772#true} #102#return; {24223#(< ~counter~0 43)} is VALID [2022-04-28 12:40:21,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {24223#(< ~counter~0 43)} assume true; {24223#(< ~counter~0 43)} is VALID [2022-04-28 12:40:21,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {23772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24223#(< ~counter~0 43)} is VALID [2022-04-28 12:40:21,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {23772#true} call ULTIMATE.init(); {23772#true} is VALID [2022-04-28 12:40:21,736 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-28 12:40:21,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:40:21,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461468733] [2022-04-28 12:40:21,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:40:21,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20696821] [2022-04-28 12:40:21,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20696821] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:40:21,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:40:21,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 12:40:21,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:40:21,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [626454122] [2022-04-28 12:40:21,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [626454122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:40:21,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:40:21,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:40:21,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790311190] [2022-04-28 12:40:21,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:40:21,737 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-28 12:40:21,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:40:21,737 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-28 12:40:21,790 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-28 12:40:21,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:40:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:40:21,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:40:21,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:40:21,791 INFO L87 Difference]: Start difference. First operand 243 states and 313 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-28 12:40:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:22,372 INFO L93 Difference]: Finished difference Result 342 states and 455 transitions. [2022-04-28 12:40:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:40:22,372 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-28 12:40:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:40:22,372 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-28 12:40:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-28 12:40:22,376 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-28 12:40:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-28 12:40:22,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-28 12:40:22,484 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-28 12:40:22,488 INFO L225 Difference]: With dead ends: 342 [2022-04-28 12:40:22,488 INFO L226 Difference]: Without dead ends: 254 [2022-04-28 12:40:22,488 INFO L412 NwaCegarLoop]: 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-28 12:40:22,489 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 91 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:40:22,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 191 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:40:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-28 12:40:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2022-04-28 12:40:22,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:40:22,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 248 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 189 states have internal predecessors, (221), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:22,723 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 248 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 189 states have internal predecessors, (221), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:22,723 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 248 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 189 states have internal predecessors, (221), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:22,726 INFO L93 Difference]: Finished difference Result 254 states and 325 transitions. [2022-04-28 12:40:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 325 transitions. [2022-04-28 12:40:22,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:40:22,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:40:22,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 189 states have internal predecessors, (221), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) Second operand 254 states. [2022-04-28 12:40:22,728 INFO L87 Difference]: Start difference. First operand has 248 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 189 states have internal predecessors, (221), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) Second operand 254 states. [2022-04-28 12:40:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:22,731 INFO L93 Difference]: Finished difference Result 254 states and 325 transitions. [2022-04-28 12:40:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 325 transitions. [2022-04-28 12:40:22,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:40:22,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:40:22,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:40:22,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:40:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 189 states have internal predecessors, (221), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 319 transitions. [2022-04-28 12:40:22,736 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 319 transitions. Word has length 81 [2022-04-28 12:40:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:40:22,736 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 319 transitions. [2022-04-28 12:40:22,736 INFO L496 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-28 12:40:22,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 248 states and 319 transitions. [2022-04-28 12:40:35,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 315 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 12:40:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 319 transitions. [2022-04-28 12:40:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 12:40:35,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:40:35,447 INFO L195 NwaCegarLoop]: 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-28 12:40:35,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 12:40:35,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:40:35,648 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:40:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:40:35,648 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-28 12:40:35,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:40:35,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [689750388] [2022-04-28 12:40:35,649 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:40:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-28 12:40:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:40:35,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739941525] [2022-04-28 12:40:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:40:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:40:35,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:40:35,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740400856] [2022-04-28 12:40:35,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:40:35,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:40:35,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:40:35,660 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:40:35,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 12:40:35,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:40:35,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:40:35,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 12:40:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:40:35,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:40:36,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {25975#true} call ULTIMATE.init(); {25975#true} is VALID [2022-04-28 12:40:36,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {25975#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {25983#(<= ~counter~0 0)} assume true; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25983#(<= ~counter~0 0)} {25975#true} #102#return; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {25983#(<= ~counter~0 0)} call #t~ret9 := main(); {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {25983#(<= ~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; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {25983#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {25983#(<= ~counter~0 0)} ~cond := #in~cond; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {25983#(<= ~counter~0 0)} assume !(0 == ~cond); {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {25983#(<= ~counter~0 0)} assume true; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25983#(<= ~counter~0 0)} {25983#(<= ~counter~0 0)} #90#return; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,141 INFO L272 TraceCheckUtils]: 11: Hoare triple {25983#(<= ~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)); {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {25983#(<= ~counter~0 0)} ~cond := #in~cond; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {25983#(<= ~counter~0 0)} assume !(0 == ~cond); {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {25983#(<= ~counter~0 0)} assume true; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,142 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25983#(<= ~counter~0 0)} {25983#(<= ~counter~0 0)} #92#return; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {25983#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {25983#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:36,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {25983#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26032#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:36,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {26032#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {26032#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:36,143 INFO L272 TraceCheckUtils]: 19: Hoare triple {26032#(<= ~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)); {26032#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:36,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {26032#(<= ~counter~0 1)} ~cond := #in~cond; {26032#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:36,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {26032#(<= ~counter~0 1)} assume !(0 == ~cond); {26032#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:36,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {26032#(<= ~counter~0 1)} assume true; {26032#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:36,145 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26032#(<= ~counter~0 1)} {26032#(<= ~counter~0 1)} #94#return; {26032#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:36,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {26032#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26032#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:36,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {26032#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26057#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:36,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {26057#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {26057#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:36,146 INFO L272 TraceCheckUtils]: 27: Hoare triple {26057#(<= ~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)); {26057#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:36,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {26057#(<= ~counter~0 2)} ~cond := #in~cond; {26057#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:36,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {26057#(<= ~counter~0 2)} assume !(0 == ~cond); {26057#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:36,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {26057#(<= ~counter~0 2)} assume true; {26057#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:36,147 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26057#(<= ~counter~0 2)} {26057#(<= ~counter~0 2)} #96#return; {26057#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:36,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {26057#(<= ~counter~0 2)} assume !(~r~0 > 0); {26057#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:36,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {26057#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26082#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:36,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {26082#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {26082#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:36,149 INFO L272 TraceCheckUtils]: 35: Hoare triple {26082#(<= ~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)); {26082#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:36,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {26082#(<= ~counter~0 3)} ~cond := #in~cond; {26082#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:36,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {26082#(<= ~counter~0 3)} assume !(0 == ~cond); {26082#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:36,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {26082#(<= ~counter~0 3)} assume true; {26082#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:36,150 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26082#(<= ~counter~0 3)} {26082#(<= ~counter~0 3)} #98#return; {26082#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:36,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {26082#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26082#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:36,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {26082#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26107#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:36,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {26107#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {26107#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:36,151 INFO L272 TraceCheckUtils]: 43: Hoare triple {26107#(<= ~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)); {26107#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:36,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {26107#(<= ~counter~0 4)} ~cond := #in~cond; {26107#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:36,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {26107#(<= ~counter~0 4)} assume !(0 == ~cond); {26107#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:36,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {26107#(<= ~counter~0 4)} assume true; {26107#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:36,152 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26107#(<= ~counter~0 4)} {26107#(<= ~counter~0 4)} #98#return; {26107#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:36,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {26107#(<= ~counter~0 4)} assume !(~r~0 < 0); {26107#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:36,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {26107#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26132#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:36,153 INFO L290 TraceCheckUtils]: 50: Hoare triple {26132#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {26132#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:36,154 INFO L272 TraceCheckUtils]: 51: Hoare triple {26132#(<= ~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)); {26132#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:36,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {26132#(<= ~counter~0 5)} ~cond := #in~cond; {26132#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:36,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {26132#(<= ~counter~0 5)} assume !(0 == ~cond); {26132#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:36,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {26132#(<= ~counter~0 5)} assume true; {26132#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:36,155 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26132#(<= ~counter~0 5)} {26132#(<= ~counter~0 5)} #94#return; {26132#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:36,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {26132#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26132#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:36,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {26132#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26157#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:36,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {26157#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {26157#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:36,156 INFO L272 TraceCheckUtils]: 59: Hoare triple {26157#(<= ~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)); {26157#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:36,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {26157#(<= ~counter~0 6)} ~cond := #in~cond; {26157#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:36,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {26157#(<= ~counter~0 6)} assume !(0 == ~cond); {26157#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:36,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {26157#(<= ~counter~0 6)} assume true; {26157#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:36,158 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26157#(<= ~counter~0 6)} {26157#(<= ~counter~0 6)} #96#return; {26157#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:36,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {26157#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26157#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:36,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {26157#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26182#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:36,158 INFO L290 TraceCheckUtils]: 66: Hoare triple {26182#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {26182#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:36,159 INFO L272 TraceCheckUtils]: 67: Hoare triple {26182#(<= ~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)); {26182#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:36,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {26182#(<= ~counter~0 7)} ~cond := #in~cond; {26182#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:36,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {26182#(<= ~counter~0 7)} assume !(0 == ~cond); {26182#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:36,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {26182#(<= ~counter~0 7)} assume true; {26182#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:36,160 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26182#(<= ~counter~0 7)} {26182#(<= ~counter~0 7)} #96#return; {26182#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:36,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {26182#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26182#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {26182#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26207#(<= |main_#t~post7| 7)} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {26207#(<= |main_#t~post7| 7)} assume !(#t~post7 < 50);havoc #t~post7; {25976#false} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {25976#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {25976#false} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {25976#false} assume !(#t~post8 < 50);havoc #t~post8; {25976#false} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 77: Hoare triple {25976#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25976#false} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 78: Hoare triple {25976#false} assume !(#t~post6 < 50);havoc #t~post6; {25976#false} is VALID [2022-04-28 12:40:36,161 INFO L272 TraceCheckUtils]: 79: Hoare triple {25976#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {25976#false} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 80: Hoare triple {25976#false} ~cond := #in~cond; {25976#false} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 81: Hoare triple {25976#false} assume 0 == ~cond; {25976#false} is VALID [2022-04-28 12:40:36,161 INFO L290 TraceCheckUtils]: 82: Hoare triple {25976#false} assume !false; {25976#false} is VALID [2022-04-28 12:40:36,162 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-28 12:40:36,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:40:36,543 INFO L290 TraceCheckUtils]: 82: Hoare triple {25976#false} assume !false; {25976#false} is VALID [2022-04-28 12:40:36,543 INFO L290 TraceCheckUtils]: 81: Hoare triple {25976#false} assume 0 == ~cond; {25976#false} is VALID [2022-04-28 12:40:36,543 INFO L290 TraceCheckUtils]: 80: Hoare triple {25976#false} ~cond := #in~cond; {25976#false} is VALID [2022-04-28 12:40:36,543 INFO L272 TraceCheckUtils]: 79: Hoare triple {25976#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {25976#false} is VALID [2022-04-28 12:40:36,543 INFO L290 TraceCheckUtils]: 78: Hoare triple {25976#false} assume !(#t~post6 < 50);havoc #t~post6; {25976#false} is VALID [2022-04-28 12:40:36,543 INFO L290 TraceCheckUtils]: 77: Hoare triple {25976#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25976#false} is VALID [2022-04-28 12:40:36,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {25976#false} assume !(#t~post8 < 50);havoc #t~post8; {25976#false} is VALID [2022-04-28 12:40:36,543 INFO L290 TraceCheckUtils]: 75: Hoare triple {25976#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {25976#false} is VALID [2022-04-28 12:40:36,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {26259#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {25976#false} is VALID [2022-04-28 12:40:36,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {26263#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26259#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:40:36,544 INFO L290 TraceCheckUtils]: 72: Hoare triple {26263#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26263#(< ~counter~0 50)} is VALID [2022-04-28 12:40:36,545 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25975#true} {26263#(< ~counter~0 50)} #96#return; {26263#(< ~counter~0 50)} is VALID [2022-04-28 12:40:36,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,545 INFO L290 TraceCheckUtils]: 69: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,545 INFO L290 TraceCheckUtils]: 68: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,545 INFO L272 TraceCheckUtils]: 67: Hoare triple {26263#(< ~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)); {25975#true} is VALID [2022-04-28 12:40:36,545 INFO L290 TraceCheckUtils]: 66: Hoare triple {26263#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {26263#(< ~counter~0 50)} is VALID [2022-04-28 12:40:36,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {26288#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26263#(< ~counter~0 50)} is VALID [2022-04-28 12:40:36,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {26288#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26288#(< ~counter~0 49)} is VALID [2022-04-28 12:40:36,547 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {25975#true} {26288#(< ~counter~0 49)} #96#return; {26288#(< ~counter~0 49)} is VALID [2022-04-28 12:40:36,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,547 INFO L290 TraceCheckUtils]: 61: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,547 INFO L290 TraceCheckUtils]: 60: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,547 INFO L272 TraceCheckUtils]: 59: Hoare triple {26288#(< ~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)); {25975#true} is VALID [2022-04-28 12:40:36,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {26288#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {26288#(< ~counter~0 49)} is VALID [2022-04-28 12:40:36,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {26313#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26288#(< ~counter~0 49)} is VALID [2022-04-28 12:40:36,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {26313#(< ~counter~0 48)} assume !!(0 != ~r~0); {26313#(< ~counter~0 48)} is VALID [2022-04-28 12:40:36,549 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25975#true} {26313#(< ~counter~0 48)} #94#return; {26313#(< ~counter~0 48)} is VALID [2022-04-28 12:40:36,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,549 INFO L272 TraceCheckUtils]: 51: Hoare triple {26313#(< ~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)); {25975#true} is VALID [2022-04-28 12:40:36,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {26313#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {26313#(< ~counter~0 48)} is VALID [2022-04-28 12:40:36,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {26338#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26313#(< ~counter~0 48)} is VALID [2022-04-28 12:40:36,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {26338#(< ~counter~0 47)} assume !(~r~0 < 0); {26338#(< ~counter~0 47)} is VALID [2022-04-28 12:40:36,550 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25975#true} {26338#(< ~counter~0 47)} #98#return; {26338#(< ~counter~0 47)} is VALID [2022-04-28 12:40:36,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,551 INFO L272 TraceCheckUtils]: 43: Hoare triple {26338#(< ~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)); {25975#true} is VALID [2022-04-28 12:40:36,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {26338#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {26338#(< ~counter~0 47)} is VALID [2022-04-28 12:40:36,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {26363#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26338#(< ~counter~0 47)} is VALID [2022-04-28 12:40:36,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {26363#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26363#(< ~counter~0 46)} is VALID [2022-04-28 12:40:36,552 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {25975#true} {26363#(< ~counter~0 46)} #98#return; {26363#(< ~counter~0 46)} is VALID [2022-04-28 12:40:36,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,553 INFO L272 TraceCheckUtils]: 35: Hoare triple {26363#(< ~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)); {25975#true} is VALID [2022-04-28 12:40:36,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {26363#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {26363#(< ~counter~0 46)} is VALID [2022-04-28 12:40:36,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {26388#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26363#(< ~counter~0 46)} is VALID [2022-04-28 12:40:36,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {26388#(< ~counter~0 45)} assume !(~r~0 > 0); {26388#(< ~counter~0 45)} is VALID [2022-04-28 12:40:36,554 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25975#true} {26388#(< ~counter~0 45)} #96#return; {26388#(< ~counter~0 45)} is VALID [2022-04-28 12:40:36,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,554 INFO L272 TraceCheckUtils]: 27: Hoare triple {26388#(< ~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)); {25975#true} is VALID [2022-04-28 12:40:36,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {26388#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {26388#(< ~counter~0 45)} is VALID [2022-04-28 12:40:36,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {26413#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26388#(< ~counter~0 45)} is VALID [2022-04-28 12:40:36,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {26413#(< ~counter~0 44)} assume !!(0 != ~r~0); {26413#(< ~counter~0 44)} is VALID [2022-04-28 12:40:36,556 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25975#true} {26413#(< ~counter~0 44)} #94#return; {26413#(< ~counter~0 44)} is VALID [2022-04-28 12:40:36,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,556 INFO L272 TraceCheckUtils]: 19: Hoare triple {26413#(< ~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)); {25975#true} is VALID [2022-04-28 12:40:36,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {26413#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {26413#(< ~counter~0 44)} is VALID [2022-04-28 12:40:36,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {26438#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26413#(< ~counter~0 44)} is VALID [2022-04-28 12:40:36,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {26438#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26438#(< ~counter~0 43)} is VALID [2022-04-28 12:40:36,558 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25975#true} {26438#(< ~counter~0 43)} #92#return; {26438#(< ~counter~0 43)} is VALID [2022-04-28 12:40:36,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,558 INFO L272 TraceCheckUtils]: 11: Hoare triple {26438#(< ~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)); {25975#true} is VALID [2022-04-28 12:40:36,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25975#true} {26438#(< ~counter~0 43)} #90#return; {26438#(< ~counter~0 43)} is VALID [2022-04-28 12:40:36,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {25975#true} assume true; {25975#true} is VALID [2022-04-28 12:40:36,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {25975#true} assume !(0 == ~cond); {25975#true} is VALID [2022-04-28 12:40:36,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {25975#true} ~cond := #in~cond; {25975#true} is VALID [2022-04-28 12:40:36,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {26438#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {25975#true} is VALID [2022-04-28 12:40:36,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {26438#(< ~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; {26438#(< ~counter~0 43)} is VALID [2022-04-28 12:40:36,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {26438#(< ~counter~0 43)} call #t~ret9 := main(); {26438#(< ~counter~0 43)} is VALID [2022-04-28 12:40:36,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26438#(< ~counter~0 43)} {25975#true} #102#return; {26438#(< ~counter~0 43)} is VALID [2022-04-28 12:40:36,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {26438#(< ~counter~0 43)} assume true; {26438#(< ~counter~0 43)} is VALID [2022-04-28 12:40:36,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {25975#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26438#(< ~counter~0 43)} is VALID [2022-04-28 12:40:36,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {25975#true} call ULTIMATE.init(); {25975#true} is VALID [2022-04-28 12:40:36,561 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-28 12:40:36,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:40:36,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739941525] [2022-04-28 12:40:36,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:40:36,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740400856] [2022-04-28 12:40:36,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740400856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:40:36,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:40:36,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 12:40:36,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:40:36,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [689750388] [2022-04-28 12:40:36,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [689750388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:40:36,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:40:36,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:40:36,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755277122] [2022-04-28 12:40:36,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:40:36,562 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-28 12:40:36,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:40:36,562 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-28 12:40:36,616 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-28 12:40:36,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:40:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:40:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:40:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:40:36,617 INFO L87 Difference]: Start difference. First operand 248 states and 319 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-28 12:40:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:37,215 INFO L93 Difference]: Finished difference Result 321 states and 421 transitions. [2022-04-28 12:40:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 12:40:37,216 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-28 12:40:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:40:37,216 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-28 12:40:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 12:40:37,217 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-28 12:40:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 12:40:37,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-28 12:40:37,302 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-28 12:40:37,305 INFO L225 Difference]: With dead ends: 321 [2022-04-28 12:40:37,305 INFO L226 Difference]: Without dead ends: 257 [2022-04-28 12:40:37,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:40:37,306 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:40:37,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 203 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:40:37,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-28 12:40:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-04-28 12:40:37,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:40:37,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 257 states, 192 states have (on average 1.1979166666666667) internal successors, (230), 195 states have internal predecessors, (230), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:37,576 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 257 states, 192 states have (on average 1.1979166666666667) internal successors, (230), 195 states have internal predecessors, (230), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:37,577 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 257 states, 192 states have (on average 1.1979166666666667) internal successors, (230), 195 states have internal predecessors, (230), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:37,580 INFO L93 Difference]: Finished difference Result 257 states and 328 transitions. [2022-04-28 12:40:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 328 transitions. [2022-04-28 12:40:37,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:40:37,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:40:37,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 192 states have (on average 1.1979166666666667) internal successors, (230), 195 states have internal predecessors, (230), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) Second operand 257 states. [2022-04-28 12:40:37,581 INFO L87 Difference]: Start difference. First operand has 257 states, 192 states have (on average 1.1979166666666667) internal successors, (230), 195 states have internal predecessors, (230), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) Second operand 257 states. [2022-04-28 12:40:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:37,584 INFO L93 Difference]: Finished difference Result 257 states and 328 transitions. [2022-04-28 12:40:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 328 transitions. [2022-04-28 12:40:37,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:40:37,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:40:37,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:40:37,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:40:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 192 states have (on average 1.1979166666666667) internal successors, (230), 195 states have internal predecessors, (230), 50 states have call successors, (50), 16 states have call predecessors, (50), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-28 12:40:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 328 transitions. [2022-04-28 12:40:37,589 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 328 transitions. Word has length 83 [2022-04-28 12:40:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:40:37,589 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 328 transitions. [2022-04-28 12:40:37,589 INFO L496 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-28 12:40:37,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 328 transitions. [2022-04-28 12:40:46,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 326 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:40:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 328 transitions. [2022-04-28 12:40:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 12:40:46,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:40:46,785 INFO L195 NwaCegarLoop]: 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-28 12:40:46,803 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-28 12:40:46,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:40:46,985 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:40:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:40:46,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-28 12:40:46,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:40:46,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1321401967] [2022-04-28 12:40:46,986 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:40:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-28 12:40:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:40:46,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298766290] [2022-04-28 12:40:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:40:46,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:40:46,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:40:46,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167388278] [2022-04-28 12:40:46,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:40:46,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:40:46,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:40:46,997 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:40:46,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 12:40:47,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:40:47,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:40:47,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:40:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:40:47,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:40:47,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {28174#true} call ULTIMATE.init(); {28174#true} is VALID [2022-04-28 12:40:47,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {28174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {28182#(<= ~counter~0 0)} assume true; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28182#(<= ~counter~0 0)} {28174#true} #102#return; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {28182#(<= ~counter~0 0)} call #t~ret9 := main(); {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {28182#(<= ~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; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {28182#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {28182#(<= ~counter~0 0)} ~cond := #in~cond; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {28182#(<= ~counter~0 0)} assume !(0 == ~cond); {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {28182#(<= ~counter~0 0)} assume true; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28182#(<= ~counter~0 0)} {28182#(<= ~counter~0 0)} #90#return; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,415 INFO L272 TraceCheckUtils]: 11: Hoare triple {28182#(<= ~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)); {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {28182#(<= ~counter~0 0)} ~cond := #in~cond; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {28182#(<= ~counter~0 0)} assume !(0 == ~cond); {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {28182#(<= ~counter~0 0)} assume true; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,416 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28182#(<= ~counter~0 0)} {28182#(<= ~counter~0 0)} #92#return; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {28182#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28182#(<= ~counter~0 0)} is VALID [2022-04-28 12:40:47,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {28182#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28231#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:47,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {28231#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {28231#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:47,418 INFO L272 TraceCheckUtils]: 19: Hoare triple {28231#(<= ~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)); {28231#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:47,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {28231#(<= ~counter~0 1)} ~cond := #in~cond; {28231#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:47,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {28231#(<= ~counter~0 1)} assume !(0 == ~cond); {28231#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:47,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {28231#(<= ~counter~0 1)} assume true; {28231#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:47,419 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28231#(<= ~counter~0 1)} {28231#(<= ~counter~0 1)} #94#return; {28231#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:47,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {28231#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28231#(<= ~counter~0 1)} is VALID [2022-04-28 12:40:47,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {28231#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28256#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:47,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {28256#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {28256#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:47,420 INFO L272 TraceCheckUtils]: 27: Hoare triple {28256#(<= ~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)); {28256#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:47,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {28256#(<= ~counter~0 2)} ~cond := #in~cond; {28256#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:47,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {28256#(<= ~counter~0 2)} assume !(0 == ~cond); {28256#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:47,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {28256#(<= ~counter~0 2)} assume true; {28256#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:47,421 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28256#(<= ~counter~0 2)} {28256#(<= ~counter~0 2)} #96#return; {28256#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:47,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {28256#(<= ~counter~0 2)} assume !(~r~0 > 0); {28256#(<= ~counter~0 2)} is VALID [2022-04-28 12:40:47,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {28256#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28281#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:47,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {28281#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {28281#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:47,422 INFO L272 TraceCheckUtils]: 35: Hoare triple {28281#(<= ~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)); {28281#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:47,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {28281#(<= ~counter~0 3)} ~cond := #in~cond; {28281#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:47,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {28281#(<= ~counter~0 3)} assume !(0 == ~cond); {28281#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:47,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {28281#(<= ~counter~0 3)} assume true; {28281#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:47,423 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28281#(<= ~counter~0 3)} {28281#(<= ~counter~0 3)} #98#return; {28281#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:47,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {28281#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28281#(<= ~counter~0 3)} is VALID [2022-04-28 12:40:47,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {28281#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28306#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:47,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {28306#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {28306#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:47,424 INFO L272 TraceCheckUtils]: 43: Hoare triple {28306#(<= ~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)); {28306#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:47,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {28306#(<= ~counter~0 4)} ~cond := #in~cond; {28306#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:47,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {28306#(<= ~counter~0 4)} assume !(0 == ~cond); {28306#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:47,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {28306#(<= ~counter~0 4)} assume true; {28306#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:47,425 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28306#(<= ~counter~0 4)} {28306#(<= ~counter~0 4)} #98#return; {28306#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:47,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {28306#(<= ~counter~0 4)} assume !(~r~0 < 0); {28306#(<= ~counter~0 4)} is VALID [2022-04-28 12:40:47,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {28306#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28331#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:47,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {28331#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {28331#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:47,426 INFO L272 TraceCheckUtils]: 51: Hoare triple {28331#(<= ~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)); {28331#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:47,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {28331#(<= ~counter~0 5)} ~cond := #in~cond; {28331#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:47,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {28331#(<= ~counter~0 5)} assume !(0 == ~cond); {28331#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:47,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {28331#(<= ~counter~0 5)} assume true; {28331#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:47,427 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28331#(<= ~counter~0 5)} {28331#(<= ~counter~0 5)} #94#return; {28331#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:47,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {28331#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28331#(<= ~counter~0 5)} is VALID [2022-04-28 12:40:47,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {28331#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28356#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:47,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {28356#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {28356#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:47,429 INFO L272 TraceCheckUtils]: 59: Hoare triple {28356#(<= ~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)); {28356#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:47,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {28356#(<= ~counter~0 6)} ~cond := #in~cond; {28356#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:47,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {28356#(<= ~counter~0 6)} assume !(0 == ~cond); {28356#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:47,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {28356#(<= ~counter~0 6)} assume true; {28356#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:47,430 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28356#(<= ~counter~0 6)} {28356#(<= ~counter~0 6)} #96#return; {28356#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:47,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {28356#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28356#(<= ~counter~0 6)} is VALID [2022-04-28 12:40:47,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {28356#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28381#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:47,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {28381#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {28381#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:47,431 INFO L272 TraceCheckUtils]: 67: Hoare triple {28381#(<= ~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)); {28381#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:47,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {28381#(<= ~counter~0 7)} ~cond := #in~cond; {28381#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:47,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {28381#(<= ~counter~0 7)} assume !(0 == ~cond); {28381#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:47,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {28381#(<= ~counter~0 7)} assume true; {28381#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:47,432 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28381#(<= ~counter~0 7)} {28381#(<= ~counter~0 7)} #96#return; {28381#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:47,447 INFO L290 TraceCheckUtils]: 72: Hoare triple {28381#(<= ~counter~0 7)} assume !(~r~0 > 0); {28381#(<= ~counter~0 7)} is VALID [2022-04-28 12:40:47,448 INFO L290 TraceCheckUtils]: 73: Hoare triple {28381#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28406#(<= ~counter~0 8)} is VALID [2022-04-28 12:40:47,448 INFO L290 TraceCheckUtils]: 74: Hoare triple {28406#(<= ~counter~0 8)} assume !!(#t~post8 < 50);havoc #t~post8; {28406#(<= ~counter~0 8)} is VALID [2022-04-28 12:40:47,448 INFO L272 TraceCheckUtils]: 75: Hoare triple {28406#(<= ~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)); {28406#(<= ~counter~0 8)} is VALID [2022-04-28 12:40:47,448 INFO L290 TraceCheckUtils]: 76: Hoare triple {28406#(<= ~counter~0 8)} ~cond := #in~cond; {28406#(<= ~counter~0 8)} is VALID [2022-04-28 12:40:47,449 INFO L290 TraceCheckUtils]: 77: Hoare triple {28406#(<= ~counter~0 8)} assume !(0 == ~cond); {28406#(<= ~counter~0 8)} is VALID [2022-04-28 12:40:47,449 INFO L290 TraceCheckUtils]: 78: Hoare triple {28406#(<= ~counter~0 8)} assume true; {28406#(<= ~counter~0 8)} is VALID [2022-04-28 12:40:47,449 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28406#(<= ~counter~0 8)} {28406#(<= ~counter~0 8)} #98#return; {28406#(<= ~counter~0 8)} is VALID [2022-04-28 12:40:47,449 INFO L290 TraceCheckUtils]: 80: Hoare triple {28406#(<= ~counter~0 8)} assume !(~r~0 < 0); {28406#(<= ~counter~0 8)} is VALID [2022-04-28 12:40:47,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {28406#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28431#(<= |main_#t~post6| 8)} is VALID [2022-04-28 12:40:47,450 INFO L290 TraceCheckUtils]: 82: Hoare triple {28431#(<= |main_#t~post6| 8)} assume !(#t~post6 < 50);havoc #t~post6; {28175#false} is VALID [2022-04-28 12:40:47,450 INFO L272 TraceCheckUtils]: 83: Hoare triple {28175#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28175#false} is VALID [2022-04-28 12:40:47,450 INFO L290 TraceCheckUtils]: 84: Hoare triple {28175#false} ~cond := #in~cond; {28175#false} is VALID [2022-04-28 12:40:47,450 INFO L290 TraceCheckUtils]: 85: Hoare triple {28175#false} assume 0 == ~cond; {28175#false} is VALID [2022-04-28 12:40:47,450 INFO L290 TraceCheckUtils]: 86: Hoare triple {28175#false} assume !false; {28175#false} is VALID [2022-04-28 12:40:47,450 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-28 12:40:47,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:40:47,789 INFO L290 TraceCheckUtils]: 86: Hoare triple {28175#false} assume !false; {28175#false} is VALID [2022-04-28 12:40:47,789 INFO L290 TraceCheckUtils]: 85: Hoare triple {28175#false} assume 0 == ~cond; {28175#false} is VALID [2022-04-28 12:40:47,789 INFO L290 TraceCheckUtils]: 84: Hoare triple {28175#false} ~cond := #in~cond; {28175#false} is VALID [2022-04-28 12:40:47,789 INFO L272 TraceCheckUtils]: 83: Hoare triple {28175#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28175#false} is VALID [2022-04-28 12:40:47,789 INFO L290 TraceCheckUtils]: 82: Hoare triple {28459#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {28175#false} is VALID [2022-04-28 12:40:47,789 INFO L290 TraceCheckUtils]: 81: Hoare triple {28463#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28459#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:40:47,790 INFO L290 TraceCheckUtils]: 80: Hoare triple {28463#(< ~counter~0 50)} assume !(~r~0 < 0); {28463#(< ~counter~0 50)} is VALID [2022-04-28 12:40:47,790 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28174#true} {28463#(< ~counter~0 50)} #98#return; {28463#(< ~counter~0 50)} is VALID [2022-04-28 12:40:47,790 INFO L290 TraceCheckUtils]: 78: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,790 INFO L290 TraceCheckUtils]: 77: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,790 INFO L290 TraceCheckUtils]: 76: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,790 INFO L272 TraceCheckUtils]: 75: Hoare triple {28463#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,790 INFO L290 TraceCheckUtils]: 74: Hoare triple {28463#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {28463#(< ~counter~0 50)} is VALID [2022-04-28 12:40:47,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {28488#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28463#(< ~counter~0 50)} is VALID [2022-04-28 12:40:47,791 INFO L290 TraceCheckUtils]: 72: Hoare triple {28488#(< ~counter~0 49)} assume !(~r~0 > 0); {28488#(< ~counter~0 49)} is VALID [2022-04-28 12:40:47,792 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28174#true} {28488#(< ~counter~0 49)} #96#return; {28488#(< ~counter~0 49)} is VALID [2022-04-28 12:40:47,792 INFO L290 TraceCheckUtils]: 70: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,792 INFO L290 TraceCheckUtils]: 69: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,792 INFO L290 TraceCheckUtils]: 68: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,792 INFO L272 TraceCheckUtils]: 67: Hoare triple {28488#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {28488#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {28488#(< ~counter~0 49)} is VALID [2022-04-28 12:40:47,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {28513#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28488#(< ~counter~0 49)} is VALID [2022-04-28 12:40:47,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {28513#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28513#(< ~counter~0 48)} is VALID [2022-04-28 12:40:47,793 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28174#true} {28513#(< ~counter~0 48)} #96#return; {28513#(< ~counter~0 48)} is VALID [2022-04-28 12:40:47,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,793 INFO L290 TraceCheckUtils]: 60: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,793 INFO L272 TraceCheckUtils]: 59: Hoare triple {28513#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {28513#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {28513#(< ~counter~0 48)} is VALID [2022-04-28 12:40:47,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {28538#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28513#(< ~counter~0 48)} is VALID [2022-04-28 12:40:47,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {28538#(< ~counter~0 47)} assume !!(0 != ~r~0); {28538#(< ~counter~0 47)} is VALID [2022-04-28 12:40:47,794 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28174#true} {28538#(< ~counter~0 47)} #94#return; {28538#(< ~counter~0 47)} is VALID [2022-04-28 12:40:47,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,795 INFO L272 TraceCheckUtils]: 51: Hoare triple {28538#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {28538#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {28538#(< ~counter~0 47)} is VALID [2022-04-28 12:40:47,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {28563#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28538#(< ~counter~0 47)} is VALID [2022-04-28 12:40:47,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {28563#(< ~counter~0 46)} assume !(~r~0 < 0); {28563#(< ~counter~0 46)} is VALID [2022-04-28 12:40:47,796 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28174#true} {28563#(< ~counter~0 46)} #98#return; {28563#(< ~counter~0 46)} is VALID [2022-04-28 12:40:47,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,796 INFO L272 TraceCheckUtils]: 43: Hoare triple {28563#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {28563#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {28563#(< ~counter~0 46)} is VALID [2022-04-28 12:40:47,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {28588#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28563#(< ~counter~0 46)} is VALID [2022-04-28 12:40:47,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {28588#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28588#(< ~counter~0 45)} is VALID [2022-04-28 12:40:47,797 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28174#true} {28588#(< ~counter~0 45)} #98#return; {28588#(< ~counter~0 45)} is VALID [2022-04-28 12:40:47,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,797 INFO L272 TraceCheckUtils]: 35: Hoare triple {28588#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {28588#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {28588#(< ~counter~0 45)} is VALID [2022-04-28 12:40:47,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {28613#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28588#(< ~counter~0 45)} is VALID [2022-04-28 12:40:47,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {28613#(< ~counter~0 44)} assume !(~r~0 > 0); {28613#(< ~counter~0 44)} is VALID [2022-04-28 12:40:47,799 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28174#true} {28613#(< ~counter~0 44)} #96#return; {28613#(< ~counter~0 44)} is VALID [2022-04-28 12:40:47,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,799 INFO L272 TraceCheckUtils]: 27: Hoare triple {28613#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {28613#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {28613#(< ~counter~0 44)} is VALID [2022-04-28 12:40:47,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {28638#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28613#(< ~counter~0 44)} is VALID [2022-04-28 12:40:47,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {28638#(< ~counter~0 43)} assume !!(0 != ~r~0); {28638#(< ~counter~0 43)} is VALID [2022-04-28 12:40:47,800 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28174#true} {28638#(< ~counter~0 43)} #94#return; {28638#(< ~counter~0 43)} is VALID [2022-04-28 12:40:47,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,800 INFO L272 TraceCheckUtils]: 19: Hoare triple {28638#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {28638#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {28638#(< ~counter~0 43)} is VALID [2022-04-28 12:40:47,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {28663#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28638#(< ~counter~0 43)} is VALID [2022-04-28 12:40:47,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {28663#(< ~counter~0 42)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28663#(< ~counter~0 42)} is VALID [2022-04-28 12:40:47,801 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28174#true} {28663#(< ~counter~0 42)} #92#return; {28663#(< ~counter~0 42)} is VALID [2022-04-28 12:40:47,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,802 INFO L272 TraceCheckUtils]: 11: Hoare triple {28663#(< ~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)); {28174#true} is VALID [2022-04-28 12:40:47,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28174#true} {28663#(< ~counter~0 42)} #90#return; {28663#(< ~counter~0 42)} is VALID [2022-04-28 12:40:47,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {28174#true} assume true; {28174#true} is VALID [2022-04-28 12:40:47,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {28174#true} assume !(0 == ~cond); {28174#true} is VALID [2022-04-28 12:40:47,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {28174#true} ~cond := #in~cond; {28174#true} is VALID [2022-04-28 12:40:47,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {28663#(< ~counter~0 42)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28174#true} is VALID [2022-04-28 12:40:47,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {28663#(< ~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; {28663#(< ~counter~0 42)} is VALID [2022-04-28 12:40:47,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {28663#(< ~counter~0 42)} call #t~ret9 := main(); {28663#(< ~counter~0 42)} is VALID [2022-04-28 12:40:47,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28663#(< ~counter~0 42)} {28174#true} #102#return; {28663#(< ~counter~0 42)} is VALID [2022-04-28 12:40:47,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {28663#(< ~counter~0 42)} assume true; {28663#(< ~counter~0 42)} is VALID [2022-04-28 12:40:47,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {28174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28663#(< ~counter~0 42)} is VALID [2022-04-28 12:40:47,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {28174#true} call ULTIMATE.init(); {28174#true} is VALID [2022-04-28 12:40:47,804 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-28 12:40:47,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:40:47,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298766290] [2022-04-28 12:40:47,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:40:47,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167388278] [2022-04-28 12:40:47,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167388278] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:40:47,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:40:47,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 12:40:47,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:40:47,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1321401967] [2022-04-28 12:40:47,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1321401967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:40:47,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:40:47,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 12:40:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453374340] [2022-04-28 12:40:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:40:47,805 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-28 12:40:47,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:40:47,809 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-28 12:40:47,844 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-28 12:40:47,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 12:40:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:40:47,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 12:40:47,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 12:40:47,845 INFO L87 Difference]: Start difference. First operand 257 states and 328 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-28 12:40:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:48,335 INFO L93 Difference]: Finished difference Result 292 states and 372 transitions. [2022-04-28 12:40:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 12:40:48,335 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-28 12:40:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:40:48,335 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-28 12:40:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 12:40:48,348 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-28 12:40:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 12:40:48,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-28 12:40:48,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:40:48,476 INFO L225 Difference]: With dead ends: 292 [2022-04-28 12:40:48,476 INFO L226 Difference]: Without dead ends: 287 [2022-04-28 12:40:48,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-28 12:40:48,477 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 106 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:40:48,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 211 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:40:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-28 12:40:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 278. [2022-04-28 12:40:48,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:40:48,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 278 states, 204 states have (on average 1.196078431372549) internal successors, (244), 212 states have internal predecessors, (244), 57 states have call successors, (57), 18 states have call predecessors, (57), 16 states have return successors, (55), 47 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:40:48,718 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 278 states, 204 states have (on average 1.196078431372549) internal successors, (244), 212 states have internal predecessors, (244), 57 states have call successors, (57), 18 states have call predecessors, (57), 16 states have return successors, (55), 47 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:40:48,718 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 278 states, 204 states have (on average 1.196078431372549) internal successors, (244), 212 states have internal predecessors, (244), 57 states have call successors, (57), 18 states have call predecessors, (57), 16 states have return successors, (55), 47 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:40:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:48,722 INFO L93 Difference]: Finished difference Result 287 states and 366 transitions. [2022-04-28 12:40:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 366 transitions. [2022-04-28 12:40:48,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:40:48,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:40:48,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 278 states, 204 states have (on average 1.196078431372549) internal successors, (244), 212 states have internal predecessors, (244), 57 states have call successors, (57), 18 states have call predecessors, (57), 16 states have return successors, (55), 47 states have call predecessors, (55), 55 states have call successors, (55) Second operand 287 states. [2022-04-28 12:40:48,723 INFO L87 Difference]: Start difference. First operand has 278 states, 204 states have (on average 1.196078431372549) internal successors, (244), 212 states have internal predecessors, (244), 57 states have call successors, (57), 18 states have call predecessors, (57), 16 states have return successors, (55), 47 states have call predecessors, (55), 55 states have call successors, (55) Second operand 287 states. [2022-04-28 12:40:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:40:48,727 INFO L93 Difference]: Finished difference Result 287 states and 366 transitions. [2022-04-28 12:40:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 366 transitions. [2022-04-28 12:40:48,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:40:48,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:40:48,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:40:48,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:40:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 204 states have (on average 1.196078431372549) internal successors, (244), 212 states have internal predecessors, (244), 57 states have call successors, (57), 18 states have call predecessors, (57), 16 states have return successors, (55), 47 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:40:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 356 transitions. [2022-04-28 12:40:48,732 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 356 transitions. Word has length 87 [2022-04-28 12:40:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:40:48,732 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 356 transitions. [2022-04-28 12:40:48,732 INFO L496 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-28 12:40:48,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 278 states and 356 transitions. [2022-04-28 12:41:02,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 354 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:41:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 356 transitions. [2022-04-28 12:41:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 12:41:02,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:41:02,410 INFO L195 NwaCegarLoop]: 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-28 12:41:02,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 12:41:02,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:41:02,610 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:41:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:41:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-28 12:41:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:41:02,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [581237641] [2022-04-28 12:41:02,611 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:41:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-28 12:41:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:41:02,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969706235] [2022-04-28 12:41:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:41:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:41:02,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:41:02,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363239114] [2022-04-28 12:41:02,634 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:41:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:41:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:41:02,643 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-28 12:41:02,644 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-28 12:41:02,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:41:02,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:41:02,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 12:41:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:41:02,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:41:02,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {30441#true} call ULTIMATE.init(); {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {30441#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30441#true} {30441#true} #102#return; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {30441#true} call #t~ret9 := main(); {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {30441#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; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {30441#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30441#true} {30441#true} #90#return; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L272 TraceCheckUtils]: 11: Hoare triple {30441#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)); {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,956 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30441#true} {30441#true} #92#return; {30441#true} is VALID [2022-04-28 12:41:02,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {30441#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {30494#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,957 INFO L272 TraceCheckUtils]: 19: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:02,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,958 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #94#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {30494#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {30494#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,959 INFO L272 TraceCheckUtils]: 27: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:02,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,959 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #96#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {30494#(<= main_~v~0 1)} assume !(~r~0 > 0); {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {30494#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,960 INFO L272 TraceCheckUtils]: 35: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:02,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,961 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #98#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {30494#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {30494#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,962 INFO L272 TraceCheckUtils]: 43: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:02,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,962 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #98#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {30494#(<= main_~v~0 1)} assume !(~r~0 < 0); {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {30494#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,963 INFO L272 TraceCheckUtils]: 51: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:02,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,964 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #94#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {30494#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {30494#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,965 INFO L272 TraceCheckUtils]: 59: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:02,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,966 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #96#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:02,966 INFO L290 TraceCheckUtils]: 64: Hoare triple {30494#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:02,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {30639#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:02,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {30639#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:02,967 INFO L272 TraceCheckUtils]: 67: Hoare triple {30639#(< 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)); {30441#true} is VALID [2022-04-28 12:41:02,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,968 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {30441#true} {30639#(< 0 (+ main_~r~0 1))} #96#return; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:02,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {30639#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:02,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {30639#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:02,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {30639#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:02,969 INFO L272 TraceCheckUtils]: 75: Hoare triple {30639#(< 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)); {30441#true} is VALID [2022-04-28 12:41:02,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:02,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:02,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:02,970 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {30441#true} {30639#(< 0 (+ main_~r~0 1))} #98#return; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:02,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {30639#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30442#false} is VALID [2022-04-28 12:41:02,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {30442#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30442#false} is VALID [2022-04-28 12:41:02,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {30442#false} assume !(#t~post8 < 50);havoc #t~post8; {30442#false} is VALID [2022-04-28 12:41:02,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {30442#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30442#false} is VALID [2022-04-28 12:41:02,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {30442#false} assume !(#t~post6 < 50);havoc #t~post6; {30442#false} is VALID [2022-04-28 12:41:02,971 INFO L272 TraceCheckUtils]: 85: Hoare triple {30442#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {30442#false} is VALID [2022-04-28 12:41:02,971 INFO L290 TraceCheckUtils]: 86: Hoare triple {30442#false} ~cond := #in~cond; {30442#false} is VALID [2022-04-28 12:41:02,971 INFO L290 TraceCheckUtils]: 87: Hoare triple {30442#false} assume 0 == ~cond; {30442#false} is VALID [2022-04-28 12:41:02,971 INFO L290 TraceCheckUtils]: 88: Hoare triple {30442#false} assume !false; {30442#false} is VALID [2022-04-28 12:41:02,971 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-28 12:41:02,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:41:03,227 INFO L290 TraceCheckUtils]: 88: Hoare triple {30442#false} assume !false; {30442#false} is VALID [2022-04-28 12:41:03,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {30442#false} assume 0 == ~cond; {30442#false} is VALID [2022-04-28 12:41:03,227 INFO L290 TraceCheckUtils]: 86: Hoare triple {30442#false} ~cond := #in~cond; {30442#false} is VALID [2022-04-28 12:41:03,228 INFO L272 TraceCheckUtils]: 85: Hoare triple {30442#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {30442#false} is VALID [2022-04-28 12:41:03,228 INFO L290 TraceCheckUtils]: 84: Hoare triple {30442#false} assume !(#t~post6 < 50);havoc #t~post6; {30442#false} is VALID [2022-04-28 12:41:03,228 INFO L290 TraceCheckUtils]: 83: Hoare triple {30442#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30442#false} is VALID [2022-04-28 12:41:03,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {30442#false} assume !(#t~post8 < 50);havoc #t~post8; {30442#false} is VALID [2022-04-28 12:41:03,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {30442#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30442#false} is VALID [2022-04-28 12:41:03,229 INFO L290 TraceCheckUtils]: 80: Hoare triple {30639#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30442#false} is VALID [2022-04-28 12:41:03,229 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {30441#true} {30639#(< 0 (+ main_~r~0 1))} #98#return; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:03,229 INFO L290 TraceCheckUtils]: 78: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,229 INFO L290 TraceCheckUtils]: 76: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,229 INFO L272 TraceCheckUtils]: 75: Hoare triple {30639#(< 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)); {30441#true} is VALID [2022-04-28 12:41:03,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {30639#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:03,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {30639#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:03,230 INFO L290 TraceCheckUtils]: 72: Hoare triple {30639#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:03,230 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {30441#true} {30639#(< 0 (+ main_~r~0 1))} #96#return; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:03,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,231 INFO L272 TraceCheckUtils]: 67: Hoare triple {30639#(< 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)); {30441#true} is VALID [2022-04-28 12:41:03,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {30639#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:03,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {30639#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:03,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {30494#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {30639#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 12:41:03,232 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #96#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,232 INFO L272 TraceCheckUtils]: 59: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:03,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,233 INFO L290 TraceCheckUtils]: 57: Hoare triple {30494#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {30494#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,234 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #94#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,234 INFO L272 TraceCheckUtils]: 51: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:03,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {30494#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {30494#(<= main_~v~0 1)} assume !(~r~0 < 0); {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,235 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #98#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,235 INFO L272 TraceCheckUtils]: 43: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:03,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {30494#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {30494#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,236 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #98#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,237 INFO L272 TraceCheckUtils]: 35: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:03,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {30494#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {30494#(<= main_~v~0 1)} assume !(~r~0 > 0); {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,238 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #96#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,238 INFO L272 TraceCheckUtils]: 27: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:03,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {30494#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {30494#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,239 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {30441#true} {30494#(<= main_~v~0 1)} #94#return; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,240 INFO L272 TraceCheckUtils]: 19: Hoare triple {30494#(<= 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)); {30441#true} is VALID [2022-04-28 12:41:03,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {30494#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {30494#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {30441#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {30494#(<= main_~v~0 1)} is VALID [2022-04-28 12:41:03,240 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30441#true} {30441#true} #92#return; {30441#true} is VALID [2022-04-28 12:41:03,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {30441#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)); {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30441#true} {30441#true} #90#return; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {30441#true} assume !(0 == ~cond); {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {30441#true} ~cond := #in~cond; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {30441#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {30441#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; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {30441#true} call #t~ret9 := main(); {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30441#true} {30441#true} #102#return; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {30441#true} assume true; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {30441#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30441#true} is VALID [2022-04-28 12:41:03,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {30441#true} call ULTIMATE.init(); {30441#true} is VALID [2022-04-28 12:41:03,241 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-28 12:41:03,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:41:03,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969706235] [2022-04-28 12:41:03,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:41:03,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363239114] [2022-04-28 12:41:03,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363239114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:41:03,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:41:03,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-28 12:41:03,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:41:03,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [581237641] [2022-04-28 12:41:03,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [581237641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:41:03,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:41:03,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:41:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102540874] [2022-04-28 12:41:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:41:03,243 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-28 12:41:03,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:41:03,243 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-28 12:41:03,277 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-28 12:41:03,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:41:03,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:41:03,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:41:03,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:41:03,278 INFO L87 Difference]: Start difference. First operand 278 states and 356 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-28 12:41:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:03,733 INFO L93 Difference]: Finished difference Result 427 states and 558 transitions. [2022-04-28 12:41:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:41:03,733 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-28 12:41:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:41:03,733 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-28 12:41:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-28 12:41:03,734 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-28 12:41:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-28 12:41:03,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-28 12:41:03,858 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-28 12:41:03,864 INFO L225 Difference]: With dead ends: 427 [2022-04-28 12:41:03,864 INFO L226 Difference]: Without dead ends: 321 [2022-04-28 12:41:03,864 INFO L412 NwaCegarLoop]: 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-28 12:41:03,865 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:41:03,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:41:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-28 12:41:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 316. [2022-04-28 12:41:04,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:41:04,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 316 states, 234 states have (on average 1.205128205128205) internal successors, (282), 240 states have internal predecessors, (282), 65 states have call successors, (65), 18 states have call predecessors, (65), 16 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 12:41:04,299 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 316 states, 234 states have (on average 1.205128205128205) internal successors, (282), 240 states have internal predecessors, (282), 65 states have call successors, (65), 18 states have call predecessors, (65), 16 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 12:41:04,300 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 316 states, 234 states have (on average 1.205128205128205) internal successors, (282), 240 states have internal predecessors, (282), 65 states have call successors, (65), 18 states have call predecessors, (65), 16 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 12:41:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:04,304 INFO L93 Difference]: Finished difference Result 321 states and 416 transitions. [2022-04-28 12:41:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 416 transitions. [2022-04-28 12:41:04,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:41:04,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:41:04,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 234 states have (on average 1.205128205128205) internal successors, (282), 240 states have internal predecessors, (282), 65 states have call successors, (65), 18 states have call predecessors, (65), 16 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 321 states. [2022-04-28 12:41:04,305 INFO L87 Difference]: Start difference. First operand has 316 states, 234 states have (on average 1.205128205128205) internal successors, (282), 240 states have internal predecessors, (282), 65 states have call successors, (65), 18 states have call predecessors, (65), 16 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 321 states. [2022-04-28 12:41:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:04,310 INFO L93 Difference]: Finished difference Result 321 states and 416 transitions. [2022-04-28 12:41:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 416 transitions. [2022-04-28 12:41:04,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:41:04,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:41:04,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:41:04,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:41:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 234 states have (on average 1.205128205128205) internal successors, (282), 240 states have internal predecessors, (282), 65 states have call successors, (65), 18 states have call predecessors, (65), 16 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 12:41:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 410 transitions. [2022-04-28 12:41:04,317 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 410 transitions. Word has length 89 [2022-04-28 12:41:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:41:04,317 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 410 transitions. [2022-04-28 12:41:04,317 INFO L496 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-28 12:41:04,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 316 states and 410 transitions. [2022-04-28 12:41:18,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 407 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:41:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 410 transitions. [2022-04-28 12:41:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 12:41:18,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:41:18,415 INFO L195 NwaCegarLoop]: 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-28 12:41:18,443 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-28 12:41:18,615 WARN L477 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-28 12:41:18,615 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:41:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:41:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-28 12:41:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:41:18,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021732740] [2022-04-28 12:41:18,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:41:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-28 12:41:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:41:18,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180339073] [2022-04-28 12:41:18,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:41:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:41:18,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:41:18,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063248808] [2022-04-28 12:41:18,636 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:41:18,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:41:18,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:41:18,637 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-28 12:41:18,671 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-28 12:41:18,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 12:41:18,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:41:18,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 12:41:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:41:18,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:41:19,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {33108#true} call ULTIMATE.init(); {33108#true} is VALID [2022-04-28 12:41:19,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {33108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {33116#(<= ~counter~0 0)} assume true; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33116#(<= ~counter~0 0)} {33108#true} #102#return; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {33116#(<= ~counter~0 0)} call #t~ret9 := main(); {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {33116#(<= ~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; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {33116#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {33116#(<= ~counter~0 0)} ~cond := #in~cond; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {33116#(<= ~counter~0 0)} assume !(0 == ~cond); {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {33116#(<= ~counter~0 0)} assume true; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33116#(<= ~counter~0 0)} {33116#(<= ~counter~0 0)} #90#return; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,194 INFO L272 TraceCheckUtils]: 11: Hoare triple {33116#(<= ~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)); {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {33116#(<= ~counter~0 0)} ~cond := #in~cond; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {33116#(<= ~counter~0 0)} assume !(0 == ~cond); {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {33116#(<= ~counter~0 0)} assume true; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,195 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33116#(<= ~counter~0 0)} {33116#(<= ~counter~0 0)} #92#return; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {33116#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {33116#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:19,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {33116#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33165#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:19,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {33165#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {33165#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:19,197 INFO L272 TraceCheckUtils]: 19: Hoare triple {33165#(<= ~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)); {33165#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:19,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {33165#(<= ~counter~0 1)} ~cond := #in~cond; {33165#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:19,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {33165#(<= ~counter~0 1)} assume !(0 == ~cond); {33165#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:19,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {33165#(<= ~counter~0 1)} assume true; {33165#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:19,198 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33165#(<= ~counter~0 1)} {33165#(<= ~counter~0 1)} #94#return; {33165#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:19,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {33165#(<= ~counter~0 1)} assume !!(0 != ~r~0); {33165#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:19,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {33165#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33190#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:19,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {33190#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {33190#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:19,200 INFO L272 TraceCheckUtils]: 27: Hoare triple {33190#(<= ~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)); {33190#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:19,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {33190#(<= ~counter~0 2)} ~cond := #in~cond; {33190#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:19,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {33190#(<= ~counter~0 2)} assume !(0 == ~cond); {33190#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:19,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {33190#(<= ~counter~0 2)} assume true; {33190#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:19,201 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33190#(<= ~counter~0 2)} {33190#(<= ~counter~0 2)} #96#return; {33190#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:19,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {33190#(<= ~counter~0 2)} assume !(~r~0 > 0); {33190#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:19,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {33190#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33215#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:19,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {33215#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {33215#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:19,203 INFO L272 TraceCheckUtils]: 35: Hoare triple {33215#(<= ~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)); {33215#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:19,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {33215#(<= ~counter~0 3)} ~cond := #in~cond; {33215#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:19,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {33215#(<= ~counter~0 3)} assume !(0 == ~cond); {33215#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:19,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {33215#(<= ~counter~0 3)} assume true; {33215#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:19,204 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33215#(<= ~counter~0 3)} {33215#(<= ~counter~0 3)} #98#return; {33215#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:19,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {33215#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {33215#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:19,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {33215#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33240#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:19,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {33240#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {33240#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:19,205 INFO L272 TraceCheckUtils]: 43: Hoare triple {33240#(<= ~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)); {33240#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:19,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {33240#(<= ~counter~0 4)} ~cond := #in~cond; {33240#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:19,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {33240#(<= ~counter~0 4)} assume !(0 == ~cond); {33240#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:19,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {33240#(<= ~counter~0 4)} assume true; {33240#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:19,207 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33240#(<= ~counter~0 4)} {33240#(<= ~counter~0 4)} #98#return; {33240#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:19,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {33240#(<= ~counter~0 4)} assume !(~r~0 < 0); {33240#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:19,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {33240#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33265#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:19,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {33265#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {33265#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:19,208 INFO L272 TraceCheckUtils]: 51: Hoare triple {33265#(<= ~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)); {33265#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:19,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {33265#(<= ~counter~0 5)} ~cond := #in~cond; {33265#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:19,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {33265#(<= ~counter~0 5)} assume !(0 == ~cond); {33265#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:19,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {33265#(<= ~counter~0 5)} assume true; {33265#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:19,209 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {33265#(<= ~counter~0 5)} {33265#(<= ~counter~0 5)} #94#return; {33265#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:19,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {33265#(<= ~counter~0 5)} assume !!(0 != ~r~0); {33265#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:19,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {33265#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33290#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:19,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {33290#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {33290#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:19,211 INFO L272 TraceCheckUtils]: 59: Hoare triple {33290#(<= ~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)); {33290#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:19,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {33290#(<= ~counter~0 6)} ~cond := #in~cond; {33290#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:19,212 INFO L290 TraceCheckUtils]: 61: Hoare triple {33290#(<= ~counter~0 6)} assume !(0 == ~cond); {33290#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:19,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {33290#(<= ~counter~0 6)} assume true; {33290#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:19,212 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {33290#(<= ~counter~0 6)} {33290#(<= ~counter~0 6)} #96#return; {33290#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:19,213 INFO L290 TraceCheckUtils]: 64: Hoare triple {33290#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33290#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:19,213 INFO L290 TraceCheckUtils]: 65: Hoare triple {33290#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33315#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:19,213 INFO L290 TraceCheckUtils]: 66: Hoare triple {33315#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {33315#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:19,214 INFO L272 TraceCheckUtils]: 67: Hoare triple {33315#(<= ~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)); {33315#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:19,214 INFO L290 TraceCheckUtils]: 68: Hoare triple {33315#(<= ~counter~0 7)} ~cond := #in~cond; {33315#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:19,214 INFO L290 TraceCheckUtils]: 69: Hoare triple {33315#(<= ~counter~0 7)} assume !(0 == ~cond); {33315#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:19,215 INFO L290 TraceCheckUtils]: 70: Hoare triple {33315#(<= ~counter~0 7)} assume true; {33315#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:19,215 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33315#(<= ~counter~0 7)} {33315#(<= ~counter~0 7)} #96#return; {33315#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:19,215 INFO L290 TraceCheckUtils]: 72: Hoare triple {33315#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33315#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:19,216 INFO L290 TraceCheckUtils]: 73: Hoare triple {33315#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33340#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:19,216 INFO L290 TraceCheckUtils]: 74: Hoare triple {33340#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {33340#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:19,217 INFO L272 TraceCheckUtils]: 75: Hoare triple {33340#(<= ~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)); {33340#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:19,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {33340#(<= ~counter~0 8)} ~cond := #in~cond; {33340#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:19,217 INFO L290 TraceCheckUtils]: 77: Hoare triple {33340#(<= ~counter~0 8)} assume !(0 == ~cond); {33340#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:19,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {33340#(<= ~counter~0 8)} assume true; {33340#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:19,218 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33340#(<= ~counter~0 8)} {33340#(<= ~counter~0 8)} #96#return; {33340#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:19,218 INFO L290 TraceCheckUtils]: 80: Hoare triple {33340#(<= ~counter~0 8)} assume !(~r~0 > 0); {33340#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:19,219 INFO L290 TraceCheckUtils]: 81: Hoare triple {33340#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33365#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:19,219 INFO L290 TraceCheckUtils]: 82: Hoare triple {33365#(<= ~counter~0 9)} assume !(#t~post8 < 50);havoc #t~post8; {33365#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:19,219 INFO L290 TraceCheckUtils]: 83: Hoare triple {33365#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33372#(<= |main_#t~post6| 9)} is VALID [2022-04-28 12:41:19,220 INFO L290 TraceCheckUtils]: 84: Hoare triple {33372#(<= |main_#t~post6| 9)} assume !(#t~post6 < 50);havoc #t~post6; {33109#false} is VALID [2022-04-28 12:41:19,220 INFO L272 TraceCheckUtils]: 85: Hoare triple {33109#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33109#false} is VALID [2022-04-28 12:41:19,220 INFO L290 TraceCheckUtils]: 86: Hoare triple {33109#false} ~cond := #in~cond; {33109#false} is VALID [2022-04-28 12:41:19,220 INFO L290 TraceCheckUtils]: 87: Hoare triple {33109#false} assume 0 == ~cond; {33109#false} is VALID [2022-04-28 12:41:19,220 INFO L290 TraceCheckUtils]: 88: Hoare triple {33109#false} assume !false; {33109#false} is VALID [2022-04-28 12:41:19,220 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-28 12:41:19,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:41:19,724 INFO L290 TraceCheckUtils]: 88: Hoare triple {33109#false} assume !false; {33109#false} is VALID [2022-04-28 12:41:19,724 INFO L290 TraceCheckUtils]: 87: Hoare triple {33109#false} assume 0 == ~cond; {33109#false} is VALID [2022-04-28 12:41:19,724 INFO L290 TraceCheckUtils]: 86: Hoare triple {33109#false} ~cond := #in~cond; {33109#false} is VALID [2022-04-28 12:41:19,724 INFO L272 TraceCheckUtils]: 85: Hoare triple {33109#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33109#false} is VALID [2022-04-28 12:41:19,724 INFO L290 TraceCheckUtils]: 84: Hoare triple {33400#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {33109#false} is VALID [2022-04-28 12:41:19,724 INFO L290 TraceCheckUtils]: 83: Hoare triple {33404#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33400#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:41:19,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {33404#(< ~counter~0 50)} assume !(#t~post8 < 50);havoc #t~post8; {33404#(< ~counter~0 50)} is VALID [2022-04-28 12:41:19,726 INFO L290 TraceCheckUtils]: 81: Hoare triple {33411#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33404#(< ~counter~0 50)} is VALID [2022-04-28 12:41:19,726 INFO L290 TraceCheckUtils]: 80: Hoare triple {33411#(< ~counter~0 49)} assume !(~r~0 > 0); {33411#(< ~counter~0 49)} is VALID [2022-04-28 12:41:19,726 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33108#true} {33411#(< ~counter~0 49)} #96#return; {33411#(< ~counter~0 49)} is VALID [2022-04-28 12:41:19,727 INFO L290 TraceCheckUtils]: 78: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,727 INFO L290 TraceCheckUtils]: 77: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,727 INFO L290 TraceCheckUtils]: 76: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,727 INFO L272 TraceCheckUtils]: 75: Hoare triple {33411#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {33411#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {33411#(< ~counter~0 49)} is VALID [2022-04-28 12:41:19,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {33436#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33411#(< ~counter~0 49)} is VALID [2022-04-28 12:41:19,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {33436#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33436#(< ~counter~0 48)} is VALID [2022-04-28 12:41:19,728 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33108#true} {33436#(< ~counter~0 48)} #96#return; {33436#(< ~counter~0 48)} is VALID [2022-04-28 12:41:19,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,728 INFO L290 TraceCheckUtils]: 68: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,729 INFO L272 TraceCheckUtils]: 67: Hoare triple {33436#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {33436#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {33436#(< ~counter~0 48)} is VALID [2022-04-28 12:41:19,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {33461#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33436#(< ~counter~0 48)} is VALID [2022-04-28 12:41:19,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {33461#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33461#(< ~counter~0 47)} is VALID [2022-04-28 12:41:19,730 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {33108#true} {33461#(< ~counter~0 47)} #96#return; {33461#(< ~counter~0 47)} is VALID [2022-04-28 12:41:19,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,730 INFO L272 TraceCheckUtils]: 59: Hoare triple {33461#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {33461#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {33461#(< ~counter~0 47)} is VALID [2022-04-28 12:41:19,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {33486#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33461#(< ~counter~0 47)} is VALID [2022-04-28 12:41:19,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {33486#(< ~counter~0 46)} assume !!(0 != ~r~0); {33486#(< ~counter~0 46)} is VALID [2022-04-28 12:41:19,732 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {33108#true} {33486#(< ~counter~0 46)} #94#return; {33486#(< ~counter~0 46)} is VALID [2022-04-28 12:41:19,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,732 INFO L272 TraceCheckUtils]: 51: Hoare triple {33486#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {33486#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {33486#(< ~counter~0 46)} is VALID [2022-04-28 12:41:19,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {33511#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33486#(< ~counter~0 46)} is VALID [2022-04-28 12:41:19,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {33511#(< ~counter~0 45)} assume !(~r~0 < 0); {33511#(< ~counter~0 45)} is VALID [2022-04-28 12:41:19,734 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33108#true} {33511#(< ~counter~0 45)} #98#return; {33511#(< ~counter~0 45)} is VALID [2022-04-28 12:41:19,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,734 INFO L272 TraceCheckUtils]: 43: Hoare triple {33511#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {33511#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {33511#(< ~counter~0 45)} is VALID [2022-04-28 12:41:19,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {33536#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33511#(< ~counter~0 45)} is VALID [2022-04-28 12:41:19,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {33536#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {33536#(< ~counter~0 44)} is VALID [2022-04-28 12:41:19,736 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33108#true} {33536#(< ~counter~0 44)} #98#return; {33536#(< ~counter~0 44)} is VALID [2022-04-28 12:41:19,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,736 INFO L272 TraceCheckUtils]: 35: Hoare triple {33536#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {33536#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {33536#(< ~counter~0 44)} is VALID [2022-04-28 12:41:19,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {33561#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33536#(< ~counter~0 44)} is VALID [2022-04-28 12:41:19,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {33561#(< ~counter~0 43)} assume !(~r~0 > 0); {33561#(< ~counter~0 43)} is VALID [2022-04-28 12:41:19,737 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33108#true} {33561#(< ~counter~0 43)} #96#return; {33561#(< ~counter~0 43)} is VALID [2022-04-28 12:41:19,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,738 INFO L272 TraceCheckUtils]: 27: Hoare triple {33561#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {33561#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {33561#(< ~counter~0 43)} is VALID [2022-04-28 12:41:19,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {33586#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33561#(< ~counter~0 43)} is VALID [2022-04-28 12:41:19,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {33586#(< ~counter~0 42)} assume !!(0 != ~r~0); {33586#(< ~counter~0 42)} is VALID [2022-04-28 12:41:19,739 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33108#true} {33586#(< ~counter~0 42)} #94#return; {33586#(< ~counter~0 42)} is VALID [2022-04-28 12:41:19,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,739 INFO L272 TraceCheckUtils]: 19: Hoare triple {33586#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {33586#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {33586#(< ~counter~0 42)} is VALID [2022-04-28 12:41:19,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {33611#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33586#(< ~counter~0 42)} is VALID [2022-04-28 12:41:19,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {33611#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {33611#(< ~counter~0 41)} is VALID [2022-04-28 12:41:19,741 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33108#true} {33611#(< ~counter~0 41)} #92#return; {33611#(< ~counter~0 41)} is VALID [2022-04-28 12:41:19,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,741 INFO L272 TraceCheckUtils]: 11: Hoare triple {33611#(< ~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)); {33108#true} is VALID [2022-04-28 12:41:19,741 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33108#true} {33611#(< ~counter~0 41)} #90#return; {33611#(< ~counter~0 41)} is VALID [2022-04-28 12:41:19,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {33108#true} assume true; {33108#true} is VALID [2022-04-28 12:41:19,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {33108#true} assume !(0 == ~cond); {33108#true} is VALID [2022-04-28 12:41:19,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {33108#true} ~cond := #in~cond; {33108#true} is VALID [2022-04-28 12:41:19,742 INFO L272 TraceCheckUtils]: 6: Hoare triple {33611#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33108#true} is VALID [2022-04-28 12:41:19,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {33611#(< ~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; {33611#(< ~counter~0 41)} is VALID [2022-04-28 12:41:19,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {33611#(< ~counter~0 41)} call #t~ret9 := main(); {33611#(< ~counter~0 41)} is VALID [2022-04-28 12:41:19,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33611#(< ~counter~0 41)} {33108#true} #102#return; {33611#(< ~counter~0 41)} is VALID [2022-04-28 12:41:19,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {33611#(< ~counter~0 41)} assume true; {33611#(< ~counter~0 41)} is VALID [2022-04-28 12:41:19,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {33108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33611#(< ~counter~0 41)} is VALID [2022-04-28 12:41:19,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {33108#true} call ULTIMATE.init(); {33108#true} is VALID [2022-04-28 12:41:19,744 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-28 12:41:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:41:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180339073] [2022-04-28 12:41:19,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:41:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063248808] [2022-04-28 12:41:19,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063248808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:41:19,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:41:19,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 12:41:19,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:41:19,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021732740] [2022-04-28 12:41:19,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021732740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:41:19,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:41:19,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:41:19,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082251209] [2022-04-28 12:41:19,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:41:19,745 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-28 12:41:19,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:41:19,746 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-28 12:41:19,805 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-28 12:41:19,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:41:19,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:41:19,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:41:19,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 12:41:19,805 INFO L87 Difference]: Start difference. First operand 316 states and 410 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-28 12:41:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:20,977 INFO L93 Difference]: Finished difference Result 386 states and 504 transitions. [2022-04-28 12:41:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 12:41:20,977 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-28 12:41:20,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:41:20,977 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-28 12:41:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 12:41:20,979 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-28 12:41:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 12:41:20,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-28 12:41:21,121 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-28 12:41:21,132 INFO L225 Difference]: With dead ends: 386 [2022-04-28 12:41:21,132 INFO L226 Difference]: Without dead ends: 381 [2022-04-28 12:41:21,133 INFO L412 NwaCegarLoop]: 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-28 12:41:21,136 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 186 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:41:21,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 229 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:41:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-28 12:41:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 366. [2022-04-28 12:41:21,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:41:21,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 366 states, 273 states have (on average 1.216117216117216) internal successors, (332), 279 states have internal predecessors, (332), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:21,698 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 366 states, 273 states have (on average 1.216117216117216) internal successors, (332), 279 states have internal predecessors, (332), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:21,711 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 366 states, 273 states have (on average 1.216117216117216) internal successors, (332), 279 states have internal predecessors, (332), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:21,733 INFO L93 Difference]: Finished difference Result 381 states and 495 transitions. [2022-04-28 12:41:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 495 transitions. [2022-04-28 12:41:21,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:41:21,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:41:21,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 366 states, 273 states have (on average 1.216117216117216) internal successors, (332), 279 states have internal predecessors, (332), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 381 states. [2022-04-28 12:41:21,734 INFO L87 Difference]: Start difference. First operand has 366 states, 273 states have (on average 1.216117216117216) internal successors, (332), 279 states have internal predecessors, (332), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 381 states. [2022-04-28 12:41:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:21,740 INFO L93 Difference]: Finished difference Result 381 states and 495 transitions. [2022-04-28 12:41:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 495 transitions. [2022-04-28 12:41:21,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:41:21,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:41:21,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:41:21,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:41:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 273 states have (on average 1.216117216117216) internal successors, (332), 279 states have internal predecessors, (332), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 478 transitions. [2022-04-28 12:41:21,747 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 478 transitions. Word has length 89 [2022-04-28 12:41:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:41:21,748 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 478 transitions. [2022-04-28 12:41:21,748 INFO L496 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-28 12:41:21,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 366 states and 478 transitions. [2022-04-28 12:41:31,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 477 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:41:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 478 transitions. [2022-04-28 12:41:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 12:41:31,392 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:41:31,392 INFO L195 NwaCegarLoop]: 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-28 12:41:31,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 12:41:31,594 WARN L477 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-28 12:41:31,594 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:41:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:41:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-28 12:41:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:41:31,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1877578810] [2022-04-28 12:41:31,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:41:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-28 12:41:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:41:31,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370063215] [2022-04-28 12:41:31,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:41:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:41:31,604 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:41:31,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320230286] [2022-04-28 12:41:31,605 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:41:31,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:41:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:41:31,606 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-28 12:41:31,607 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-28 12:41:31,761 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 12:41:31,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:41:31,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:41:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:41:31,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:41:32,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {35943#true} call ULTIMATE.init(); {35943#true} is VALID [2022-04-28 12:41:32,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {35943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {35951#(<= ~counter~0 0)} assume true; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35951#(<= ~counter~0 0)} {35943#true} #102#return; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {35951#(<= ~counter~0 0)} call #t~ret9 := main(); {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {35951#(<= ~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; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,196 INFO L272 TraceCheckUtils]: 6: Hoare triple {35951#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {35951#(<= ~counter~0 0)} ~cond := #in~cond; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {35951#(<= ~counter~0 0)} assume !(0 == ~cond); {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {35951#(<= ~counter~0 0)} assume true; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35951#(<= ~counter~0 0)} {35951#(<= ~counter~0 0)} #90#return; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {35951#(<= ~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)); {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {35951#(<= ~counter~0 0)} ~cond := #in~cond; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {35951#(<= ~counter~0 0)} assume !(0 == ~cond); {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {35951#(<= ~counter~0 0)} assume true; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,199 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35951#(<= ~counter~0 0)} {35951#(<= ~counter~0 0)} #92#return; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {35951#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {35951#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:32,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {35951#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36000#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:32,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {36000#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {36000#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:32,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {36000#(<= ~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)); {36000#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:32,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {36000#(<= ~counter~0 1)} ~cond := #in~cond; {36000#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:32,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {36000#(<= ~counter~0 1)} assume !(0 == ~cond); {36000#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:32,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {36000#(<= ~counter~0 1)} assume true; {36000#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:32,202 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {36000#(<= ~counter~0 1)} {36000#(<= ~counter~0 1)} #94#return; {36000#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:32,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {36000#(<= ~counter~0 1)} assume !!(0 != ~r~0); {36000#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:32,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {36000#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36025#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:32,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {36025#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {36025#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:32,204 INFO L272 TraceCheckUtils]: 27: Hoare triple {36025#(<= ~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)); {36025#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:32,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {36025#(<= ~counter~0 2)} ~cond := #in~cond; {36025#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:32,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {36025#(<= ~counter~0 2)} assume !(0 == ~cond); {36025#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:32,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {36025#(<= ~counter~0 2)} assume true; {36025#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:32,205 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {36025#(<= ~counter~0 2)} {36025#(<= ~counter~0 2)} #96#return; {36025#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:32,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {36025#(<= ~counter~0 2)} assume !(~r~0 > 0); {36025#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:32,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {36025#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36050#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:32,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {36050#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {36050#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:32,207 INFO L272 TraceCheckUtils]: 35: Hoare triple {36050#(<= ~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)); {36050#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:32,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {36050#(<= ~counter~0 3)} ~cond := #in~cond; {36050#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:32,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {36050#(<= ~counter~0 3)} assume !(0 == ~cond); {36050#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:32,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {36050#(<= ~counter~0 3)} assume true; {36050#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:32,209 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {36050#(<= ~counter~0 3)} {36050#(<= ~counter~0 3)} #98#return; {36050#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:32,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {36050#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {36050#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:32,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {36050#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36075#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:32,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {36075#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {36075#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:32,213 INFO L272 TraceCheckUtils]: 43: Hoare triple {36075#(<= ~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)); {36075#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:32,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {36075#(<= ~counter~0 4)} ~cond := #in~cond; {36075#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:32,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {36075#(<= ~counter~0 4)} assume !(0 == ~cond); {36075#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:32,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {36075#(<= ~counter~0 4)} assume true; {36075#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:32,214 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36075#(<= ~counter~0 4)} {36075#(<= ~counter~0 4)} #98#return; {36075#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:32,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {36075#(<= ~counter~0 4)} assume !(~r~0 < 0); {36075#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:32,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {36075#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36100#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:32,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {36100#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {36100#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:32,216 INFO L272 TraceCheckUtils]: 51: Hoare triple {36100#(<= ~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)); {36100#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:32,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {36100#(<= ~counter~0 5)} ~cond := #in~cond; {36100#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:32,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {36100#(<= ~counter~0 5)} assume !(0 == ~cond); {36100#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:32,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {36100#(<= ~counter~0 5)} assume true; {36100#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:32,217 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {36100#(<= ~counter~0 5)} {36100#(<= ~counter~0 5)} #94#return; {36100#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:32,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {36100#(<= ~counter~0 5)} assume !!(0 != ~r~0); {36100#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:32,218 INFO L290 TraceCheckUtils]: 57: Hoare triple {36100#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36125#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:32,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {36125#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {36125#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:32,219 INFO L272 TraceCheckUtils]: 59: Hoare triple {36125#(<= ~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)); {36125#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:32,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {36125#(<= ~counter~0 6)} ~cond := #in~cond; {36125#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:32,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {36125#(<= ~counter~0 6)} assume !(0 == ~cond); {36125#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:32,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {36125#(<= ~counter~0 6)} assume true; {36125#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:32,220 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {36125#(<= ~counter~0 6)} {36125#(<= ~counter~0 6)} #96#return; {36125#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:32,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {36125#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36125#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:32,221 INFO L290 TraceCheckUtils]: 65: Hoare triple {36125#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36150#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:32,221 INFO L290 TraceCheckUtils]: 66: Hoare triple {36150#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {36150#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:32,222 INFO L272 TraceCheckUtils]: 67: Hoare triple {36150#(<= ~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)); {36150#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:32,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {36150#(<= ~counter~0 7)} ~cond := #in~cond; {36150#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:32,222 INFO L290 TraceCheckUtils]: 69: Hoare triple {36150#(<= ~counter~0 7)} assume !(0 == ~cond); {36150#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:32,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {36150#(<= ~counter~0 7)} assume true; {36150#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:32,223 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {36150#(<= ~counter~0 7)} {36150#(<= ~counter~0 7)} #96#return; {36150#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:32,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {36150#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36150#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:32,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {36150#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36175#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:32,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {36175#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {36175#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:32,224 INFO L272 TraceCheckUtils]: 75: Hoare triple {36175#(<= ~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)); {36175#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:32,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {36175#(<= ~counter~0 8)} ~cond := #in~cond; {36175#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:32,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {36175#(<= ~counter~0 8)} assume !(0 == ~cond); {36175#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:32,225 INFO L290 TraceCheckUtils]: 78: Hoare triple {36175#(<= ~counter~0 8)} assume true; {36175#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:32,226 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {36175#(<= ~counter~0 8)} {36175#(<= ~counter~0 8)} #96#return; {36175#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:32,226 INFO L290 TraceCheckUtils]: 80: Hoare triple {36175#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36175#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:32,226 INFO L290 TraceCheckUtils]: 81: Hoare triple {36175#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36200#(<= |main_#t~post7| 8)} is VALID [2022-04-28 12:41:32,227 INFO L290 TraceCheckUtils]: 82: Hoare triple {36200#(<= |main_#t~post7| 8)} assume !(#t~post7 < 50);havoc #t~post7; {35944#false} is VALID [2022-04-28 12:41:32,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {35944#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {35944#false} is VALID [2022-04-28 12:41:32,227 INFO L290 TraceCheckUtils]: 84: Hoare triple {35944#false} assume !(#t~post8 < 50);havoc #t~post8; {35944#false} is VALID [2022-04-28 12:41:32,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {35944#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35944#false} is VALID [2022-04-28 12:41:32,227 INFO L290 TraceCheckUtils]: 86: Hoare triple {35944#false} assume !(#t~post6 < 50);havoc #t~post6; {35944#false} is VALID [2022-04-28 12:41:32,227 INFO L272 TraceCheckUtils]: 87: Hoare triple {35944#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {35944#false} is VALID [2022-04-28 12:41:32,227 INFO L290 TraceCheckUtils]: 88: Hoare triple {35944#false} ~cond := #in~cond; {35944#false} is VALID [2022-04-28 12:41:32,227 INFO L290 TraceCheckUtils]: 89: Hoare triple {35944#false} assume 0 == ~cond; {35944#false} is VALID [2022-04-28 12:41:32,227 INFO L290 TraceCheckUtils]: 90: Hoare triple {35944#false} assume !false; {35944#false} is VALID [2022-04-28 12:41:32,227 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-28 12:41:32,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:41:32,704 INFO L290 TraceCheckUtils]: 90: Hoare triple {35944#false} assume !false; {35944#false} is VALID [2022-04-28 12:41:32,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {35944#false} assume 0 == ~cond; {35944#false} is VALID [2022-04-28 12:41:32,704 INFO L290 TraceCheckUtils]: 88: Hoare triple {35944#false} ~cond := #in~cond; {35944#false} is VALID [2022-04-28 12:41:32,704 INFO L272 TraceCheckUtils]: 87: Hoare triple {35944#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {35944#false} is VALID [2022-04-28 12:41:32,704 INFO L290 TraceCheckUtils]: 86: Hoare triple {35944#false} assume !(#t~post6 < 50);havoc #t~post6; {35944#false} is VALID [2022-04-28 12:41:32,704 INFO L290 TraceCheckUtils]: 85: Hoare triple {35944#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35944#false} is VALID [2022-04-28 12:41:32,705 INFO L290 TraceCheckUtils]: 84: Hoare triple {35944#false} assume !(#t~post8 < 50);havoc #t~post8; {35944#false} is VALID [2022-04-28 12:41:32,705 INFO L290 TraceCheckUtils]: 83: Hoare triple {35944#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {35944#false} is VALID [2022-04-28 12:41:32,705 INFO L290 TraceCheckUtils]: 82: Hoare triple {36252#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {35944#false} is VALID [2022-04-28 12:41:32,705 INFO L290 TraceCheckUtils]: 81: Hoare triple {36256#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36252#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:41:32,705 INFO L290 TraceCheckUtils]: 80: Hoare triple {36256#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36256#(< ~counter~0 50)} is VALID [2022-04-28 12:41:32,706 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {35943#true} {36256#(< ~counter~0 50)} #96#return; {36256#(< ~counter~0 50)} is VALID [2022-04-28 12:41:32,706 INFO L290 TraceCheckUtils]: 78: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,706 INFO L290 TraceCheckUtils]: 77: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,706 INFO L290 TraceCheckUtils]: 76: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,706 INFO L272 TraceCheckUtils]: 75: Hoare triple {36256#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,706 INFO L290 TraceCheckUtils]: 74: Hoare triple {36256#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {36256#(< ~counter~0 50)} is VALID [2022-04-28 12:41:32,707 INFO L290 TraceCheckUtils]: 73: Hoare triple {36281#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36256#(< ~counter~0 50)} is VALID [2022-04-28 12:41:32,707 INFO L290 TraceCheckUtils]: 72: Hoare triple {36281#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36281#(< ~counter~0 49)} is VALID [2022-04-28 12:41:32,708 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35943#true} {36281#(< ~counter~0 49)} #96#return; {36281#(< ~counter~0 49)} is VALID [2022-04-28 12:41:32,708 INFO L290 TraceCheckUtils]: 70: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,708 INFO L290 TraceCheckUtils]: 69: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,708 INFO L290 TraceCheckUtils]: 68: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,708 INFO L272 TraceCheckUtils]: 67: Hoare triple {36281#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {36281#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {36281#(< ~counter~0 49)} is VALID [2022-04-28 12:41:32,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {36306#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36281#(< ~counter~0 49)} is VALID [2022-04-28 12:41:32,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {36306#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36306#(< ~counter~0 48)} is VALID [2022-04-28 12:41:32,709 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35943#true} {36306#(< ~counter~0 48)} #96#return; {36306#(< ~counter~0 48)} is VALID [2022-04-28 12:41:32,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,710 INFO L272 TraceCheckUtils]: 59: Hoare triple {36306#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {36306#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {36306#(< ~counter~0 48)} is VALID [2022-04-28 12:41:32,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {36331#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36306#(< ~counter~0 48)} is VALID [2022-04-28 12:41:32,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {36331#(< ~counter~0 47)} assume !!(0 != ~r~0); {36331#(< ~counter~0 47)} is VALID [2022-04-28 12:41:32,711 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35943#true} {36331#(< ~counter~0 47)} #94#return; {36331#(< ~counter~0 47)} is VALID [2022-04-28 12:41:32,711 INFO L290 TraceCheckUtils]: 54: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,711 INFO L290 TraceCheckUtils]: 53: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,711 INFO L272 TraceCheckUtils]: 51: Hoare triple {36331#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {36331#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {36331#(< ~counter~0 47)} is VALID [2022-04-28 12:41:32,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {36356#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36331#(< ~counter~0 47)} is VALID [2022-04-28 12:41:32,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {36356#(< ~counter~0 46)} assume !(~r~0 < 0); {36356#(< ~counter~0 46)} is VALID [2022-04-28 12:41:32,713 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35943#true} {36356#(< ~counter~0 46)} #98#return; {36356#(< ~counter~0 46)} is VALID [2022-04-28 12:41:32,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,713 INFO L272 TraceCheckUtils]: 43: Hoare triple {36356#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {36356#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {36356#(< ~counter~0 46)} is VALID [2022-04-28 12:41:32,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {36381#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36356#(< ~counter~0 46)} is VALID [2022-04-28 12:41:32,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {36381#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {36381#(< ~counter~0 45)} is VALID [2022-04-28 12:41:32,714 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {35943#true} {36381#(< ~counter~0 45)} #98#return; {36381#(< ~counter~0 45)} is VALID [2022-04-28 12:41:32,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,714 INFO L272 TraceCheckUtils]: 35: Hoare triple {36381#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {36381#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {36381#(< ~counter~0 45)} is VALID [2022-04-28 12:41:32,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {36406#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36381#(< ~counter~0 45)} is VALID [2022-04-28 12:41:32,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {36406#(< ~counter~0 44)} assume !(~r~0 > 0); {36406#(< ~counter~0 44)} is VALID [2022-04-28 12:41:32,716 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {35943#true} {36406#(< ~counter~0 44)} #96#return; {36406#(< ~counter~0 44)} is VALID [2022-04-28 12:41:32,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,716 INFO L272 TraceCheckUtils]: 27: Hoare triple {36406#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {36406#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {36406#(< ~counter~0 44)} is VALID [2022-04-28 12:41:32,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {36431#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36406#(< ~counter~0 44)} is VALID [2022-04-28 12:41:32,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {36431#(< ~counter~0 43)} assume !!(0 != ~r~0); {36431#(< ~counter~0 43)} is VALID [2022-04-28 12:41:32,717 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {35943#true} {36431#(< ~counter~0 43)} #94#return; {36431#(< ~counter~0 43)} is VALID [2022-04-28 12:41:32,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,717 INFO L272 TraceCheckUtils]: 19: Hoare triple {36431#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {36431#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {36431#(< ~counter~0 43)} is VALID [2022-04-28 12:41:32,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {36456#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36431#(< ~counter~0 43)} is VALID [2022-04-28 12:41:32,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {36456#(< ~counter~0 42)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36456#(< ~counter~0 42)} is VALID [2022-04-28 12:41:32,719 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35943#true} {36456#(< ~counter~0 42)} #92#return; {36456#(< ~counter~0 42)} is VALID [2022-04-28 12:41:32,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,719 INFO L272 TraceCheckUtils]: 11: Hoare triple {36456#(< ~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)); {35943#true} is VALID [2022-04-28 12:41:32,719 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35943#true} {36456#(< ~counter~0 42)} #90#return; {36456#(< ~counter~0 42)} is VALID [2022-04-28 12:41:32,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {35943#true} assume true; {35943#true} is VALID [2022-04-28 12:41:32,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {35943#true} assume !(0 == ~cond); {35943#true} is VALID [2022-04-28 12:41:32,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {35943#true} ~cond := #in~cond; {35943#true} is VALID [2022-04-28 12:41:32,720 INFO L272 TraceCheckUtils]: 6: Hoare triple {36456#(< ~counter~0 42)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {35943#true} is VALID [2022-04-28 12:41:32,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {36456#(< ~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; {36456#(< ~counter~0 42)} is VALID [2022-04-28 12:41:32,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {36456#(< ~counter~0 42)} call #t~ret9 := main(); {36456#(< ~counter~0 42)} is VALID [2022-04-28 12:41:32,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36456#(< ~counter~0 42)} {35943#true} #102#return; {36456#(< ~counter~0 42)} is VALID [2022-04-28 12:41:32,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {36456#(< ~counter~0 42)} assume true; {36456#(< ~counter~0 42)} is VALID [2022-04-28 12:41:32,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {35943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36456#(< ~counter~0 42)} is VALID [2022-04-28 12:41:32,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {35943#true} call ULTIMATE.init(); {35943#true} is VALID [2022-04-28 12:41:32,722 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-28 12:41:32,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:41:32,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370063215] [2022-04-28 12:41:32,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:41:32,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320230286] [2022-04-28 12:41:32,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320230286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:41:32,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:41:32,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 12:41:32,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:41:32,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1877578810] [2022-04-28 12:41:32,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1877578810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:41:32,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:41:32,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 12:41:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200268975] [2022-04-28 12:41:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:41:32,723 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-28 12:41:32,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:41:32,723 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-28 12:41:32,785 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-28 12:41:32,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 12:41:32,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:41:32,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 12:41:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 12:41:32,786 INFO L87 Difference]: Start difference. First operand 366 states and 478 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-28 12:41:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:33,845 INFO L93 Difference]: Finished difference Result 455 states and 606 transitions. [2022-04-28 12:41:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 12:41:33,845 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-28 12:41:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:41:33,845 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-28 12:41:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 12:41:33,847 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-28 12:41:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 12:41:33,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-28 12:41:33,991 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-28 12:41:33,997 INFO L225 Difference]: With dead ends: 455 [2022-04-28 12:41:33,997 INFO L226 Difference]: Without dead ends: 366 [2022-04-28 12:41:33,997 INFO L412 NwaCegarLoop]: 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-28 12:41:33,999 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 117 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:41:33,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 205 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:41:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-28 12:41:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-04-28 12:41:34,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:41:34,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 366 states, 273 states have (on average 1.2014652014652014) internal successors, (328), 279 states have internal predecessors, (328), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:34,486 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 366 states, 273 states have (on average 1.2014652014652014) internal successors, (328), 279 states have internal predecessors, (328), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:34,486 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 366 states, 273 states have (on average 1.2014652014652014) internal successors, (328), 279 states have internal predecessors, (328), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:34,491 INFO L93 Difference]: Finished difference Result 366 states and 474 transitions. [2022-04-28 12:41:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 474 transitions. [2022-04-28 12:41:34,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:41:34,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:41:34,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 366 states, 273 states have (on average 1.2014652014652014) internal successors, (328), 279 states have internal predecessors, (328), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 366 states. [2022-04-28 12:41:34,493 INFO L87 Difference]: Start difference. First operand has 366 states, 273 states have (on average 1.2014652014652014) internal successors, (328), 279 states have internal predecessors, (328), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 366 states. [2022-04-28 12:41:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:34,498 INFO L93 Difference]: Finished difference Result 366 states and 474 transitions. [2022-04-28 12:41:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 474 transitions. [2022-04-28 12:41:34,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:41:34,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:41:34,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:41:34,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:41:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 273 states have (on average 1.2014652014652014) internal successors, (328), 279 states have internal predecessors, (328), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 474 transitions. [2022-04-28 12:41:34,506 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 474 transitions. Word has length 91 [2022-04-28 12:41:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:41:34,506 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 474 transitions. [2022-04-28 12:41:34,506 INFO L496 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-28 12:41:34,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 366 states and 474 transitions. [2022-04-28 12:41:50,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 470 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 12:41:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 474 transitions. [2022-04-28 12:41:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 12:41:50,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:41:50,578 INFO L195 NwaCegarLoop]: 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-28 12:41:50,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 12:41:50,778 WARN L477 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-28 12:41:50,778 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:41:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:41:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-28 12:41:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:41:50,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1984023004] [2022-04-28 12:41:50,779 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:41:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-28 12:41:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:41:50,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236312076] [2022-04-28 12:41:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:41:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:41:50,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:41:50,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649497356] [2022-04-28 12:41:50,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:41:50,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:41:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:41:50,792 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-28 12:41:50,793 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-28 12:41:50,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:41:50,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:41:50,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 12:41:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:41:50,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:41:51,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {38898#true} call ULTIMATE.init(); {38898#true} is VALID [2022-04-28 12:41:51,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {38898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {38906#(<= ~counter~0 0)} assume true; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38906#(<= ~counter~0 0)} {38898#true} #102#return; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {38906#(<= ~counter~0 0)} call #t~ret9 := main(); {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {38906#(<= ~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; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {38906#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {38906#(<= ~counter~0 0)} ~cond := #in~cond; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {38906#(<= ~counter~0 0)} assume !(0 == ~cond); {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {38906#(<= ~counter~0 0)} assume true; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38906#(<= ~counter~0 0)} {38906#(<= ~counter~0 0)} #90#return; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,356 INFO L272 TraceCheckUtils]: 11: Hoare triple {38906#(<= ~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)); {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {38906#(<= ~counter~0 0)} ~cond := #in~cond; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {38906#(<= ~counter~0 0)} assume !(0 == ~cond); {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {38906#(<= ~counter~0 0)} assume true; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,358 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38906#(<= ~counter~0 0)} {38906#(<= ~counter~0 0)} #92#return; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {38906#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38906#(<= ~counter~0 0)} is VALID [2022-04-28 12:41:51,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {38906#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38955#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:51,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {38955#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {38955#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:51,360 INFO L272 TraceCheckUtils]: 19: Hoare triple {38955#(<= ~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)); {38955#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:51,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {38955#(<= ~counter~0 1)} ~cond := #in~cond; {38955#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:51,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {38955#(<= ~counter~0 1)} assume !(0 == ~cond); {38955#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:51,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {38955#(<= ~counter~0 1)} assume true; {38955#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:51,361 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38955#(<= ~counter~0 1)} {38955#(<= ~counter~0 1)} #94#return; {38955#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:51,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {38955#(<= ~counter~0 1)} assume !!(0 != ~r~0); {38955#(<= ~counter~0 1)} is VALID [2022-04-28 12:41:51,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {38955#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38980#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:51,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {38980#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {38980#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:51,363 INFO L272 TraceCheckUtils]: 27: Hoare triple {38980#(<= ~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)); {38980#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:51,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {38980#(<= ~counter~0 2)} ~cond := #in~cond; {38980#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:51,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {38980#(<= ~counter~0 2)} assume !(0 == ~cond); {38980#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:51,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {38980#(<= ~counter~0 2)} assume true; {38980#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:51,364 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38980#(<= ~counter~0 2)} {38980#(<= ~counter~0 2)} #96#return; {38980#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:51,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {38980#(<= ~counter~0 2)} assume !(~r~0 > 0); {38980#(<= ~counter~0 2)} is VALID [2022-04-28 12:41:51,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {38980#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39005#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:51,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {39005#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {39005#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:51,365 INFO L272 TraceCheckUtils]: 35: Hoare triple {39005#(<= ~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)); {39005#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:51,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {39005#(<= ~counter~0 3)} ~cond := #in~cond; {39005#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:51,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {39005#(<= ~counter~0 3)} assume !(0 == ~cond); {39005#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:51,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {39005#(<= ~counter~0 3)} assume true; {39005#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:51,367 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {39005#(<= ~counter~0 3)} {39005#(<= ~counter~0 3)} #98#return; {39005#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:51,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {39005#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39005#(<= ~counter~0 3)} is VALID [2022-04-28 12:41:51,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {39005#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39030#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:51,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {39030#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {39030#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:51,368 INFO L272 TraceCheckUtils]: 43: Hoare triple {39030#(<= ~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)); {39030#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:51,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {39030#(<= ~counter~0 4)} ~cond := #in~cond; {39030#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:51,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {39030#(<= ~counter~0 4)} assume !(0 == ~cond); {39030#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:51,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {39030#(<= ~counter~0 4)} assume true; {39030#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:51,369 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {39030#(<= ~counter~0 4)} {39030#(<= ~counter~0 4)} #98#return; {39030#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:51,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {39030#(<= ~counter~0 4)} assume !(~r~0 < 0); {39030#(<= ~counter~0 4)} is VALID [2022-04-28 12:41:51,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {39030#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39055#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:51,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {39055#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {39055#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:51,371 INFO L272 TraceCheckUtils]: 51: Hoare triple {39055#(<= ~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)); {39055#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:51,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {39055#(<= ~counter~0 5)} ~cond := #in~cond; {39055#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:51,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {39055#(<= ~counter~0 5)} assume !(0 == ~cond); {39055#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:51,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {39055#(<= ~counter~0 5)} assume true; {39055#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:51,372 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {39055#(<= ~counter~0 5)} {39055#(<= ~counter~0 5)} #94#return; {39055#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:51,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {39055#(<= ~counter~0 5)} assume !!(0 != ~r~0); {39055#(<= ~counter~0 5)} is VALID [2022-04-28 12:41:51,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {39055#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39080#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:51,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {39080#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {39080#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:51,374 INFO L272 TraceCheckUtils]: 59: Hoare triple {39080#(<= ~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)); {39080#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:51,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {39080#(<= ~counter~0 6)} ~cond := #in~cond; {39080#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:51,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {39080#(<= ~counter~0 6)} assume !(0 == ~cond); {39080#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:51,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {39080#(<= ~counter~0 6)} assume true; {39080#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:51,375 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {39080#(<= ~counter~0 6)} {39080#(<= ~counter~0 6)} #96#return; {39080#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:51,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {39080#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39080#(<= ~counter~0 6)} is VALID [2022-04-28 12:41:51,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {39080#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39105#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:51,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {39105#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {39105#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:51,377 INFO L272 TraceCheckUtils]: 67: Hoare triple {39105#(<= ~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)); {39105#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:51,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {39105#(<= ~counter~0 7)} ~cond := #in~cond; {39105#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:51,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {39105#(<= ~counter~0 7)} assume !(0 == ~cond); {39105#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:51,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {39105#(<= ~counter~0 7)} assume true; {39105#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:51,378 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39105#(<= ~counter~0 7)} {39105#(<= ~counter~0 7)} #96#return; {39105#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:51,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {39105#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39105#(<= ~counter~0 7)} is VALID [2022-04-28 12:41:51,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {39105#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39130#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:51,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {39130#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {39130#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:51,380 INFO L272 TraceCheckUtils]: 75: Hoare triple {39130#(<= ~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)); {39130#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:51,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {39130#(<= ~counter~0 8)} ~cond := #in~cond; {39130#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:51,380 INFO L290 TraceCheckUtils]: 77: Hoare triple {39130#(<= ~counter~0 8)} assume !(0 == ~cond); {39130#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:51,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {39130#(<= ~counter~0 8)} assume true; {39130#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:51,381 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {39130#(<= ~counter~0 8)} {39130#(<= ~counter~0 8)} #96#return; {39130#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:51,381 INFO L290 TraceCheckUtils]: 80: Hoare triple {39130#(<= ~counter~0 8)} assume !(~r~0 > 0); {39130#(<= ~counter~0 8)} is VALID [2022-04-28 12:41:51,382 INFO L290 TraceCheckUtils]: 81: Hoare triple {39130#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39155#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:51,382 INFO L290 TraceCheckUtils]: 82: Hoare triple {39155#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {39155#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:51,382 INFO L272 TraceCheckUtils]: 83: Hoare triple {39155#(<= ~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)); {39155#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:51,383 INFO L290 TraceCheckUtils]: 84: Hoare triple {39155#(<= ~counter~0 9)} ~cond := #in~cond; {39155#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:51,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {39155#(<= ~counter~0 9)} assume !(0 == ~cond); {39155#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:51,383 INFO L290 TraceCheckUtils]: 86: Hoare triple {39155#(<= ~counter~0 9)} assume true; {39155#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:51,384 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {39155#(<= ~counter~0 9)} {39155#(<= ~counter~0 9)} #98#return; {39155#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:51,384 INFO L290 TraceCheckUtils]: 88: Hoare triple {39155#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39155#(<= ~counter~0 9)} is VALID [2022-04-28 12:41:51,384 INFO L290 TraceCheckUtils]: 89: Hoare triple {39155#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39180#(<= |main_#t~post8| 9)} is VALID [2022-04-28 12:41:51,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {39180#(<= |main_#t~post8| 9)} assume !(#t~post8 < 50);havoc #t~post8; {38899#false} is VALID [2022-04-28 12:41:51,385 INFO L290 TraceCheckUtils]: 91: Hoare triple {38899#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38899#false} is VALID [2022-04-28 12:41:51,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {38899#false} assume !(#t~post6 < 50);havoc #t~post6; {38899#false} is VALID [2022-04-28 12:41:51,385 INFO L272 TraceCheckUtils]: 93: Hoare triple {38899#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38899#false} is VALID [2022-04-28 12:41:51,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {38899#false} ~cond := #in~cond; {38899#false} is VALID [2022-04-28 12:41:51,385 INFO L290 TraceCheckUtils]: 95: Hoare triple {38899#false} assume 0 == ~cond; {38899#false} is VALID [2022-04-28 12:41:51,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {38899#false} assume !false; {38899#false} is VALID [2022-04-28 12:41:51,385 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-28 12:41:51,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:41:51,722 INFO L290 TraceCheckUtils]: 96: Hoare triple {38899#false} assume !false; {38899#false} is VALID [2022-04-28 12:41:51,722 INFO L290 TraceCheckUtils]: 95: Hoare triple {38899#false} assume 0 == ~cond; {38899#false} is VALID [2022-04-28 12:41:51,722 INFO L290 TraceCheckUtils]: 94: Hoare triple {38899#false} ~cond := #in~cond; {38899#false} is VALID [2022-04-28 12:41:51,722 INFO L272 TraceCheckUtils]: 93: Hoare triple {38899#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38899#false} is VALID [2022-04-28 12:41:51,722 INFO L290 TraceCheckUtils]: 92: Hoare triple {38899#false} assume !(#t~post6 < 50);havoc #t~post6; {38899#false} is VALID [2022-04-28 12:41:51,722 INFO L290 TraceCheckUtils]: 91: Hoare triple {38899#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38899#false} is VALID [2022-04-28 12:41:51,722 INFO L290 TraceCheckUtils]: 90: Hoare triple {39220#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {38899#false} is VALID [2022-04-28 12:41:51,723 INFO L290 TraceCheckUtils]: 89: Hoare triple {39224#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39220#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:41:51,723 INFO L290 TraceCheckUtils]: 88: Hoare triple {39224#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39224#(< ~counter~0 50)} is VALID [2022-04-28 12:41:51,723 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38898#true} {39224#(< ~counter~0 50)} #98#return; {39224#(< ~counter~0 50)} is VALID [2022-04-28 12:41:51,723 INFO L290 TraceCheckUtils]: 86: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,723 INFO L290 TraceCheckUtils]: 85: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,723 INFO L290 TraceCheckUtils]: 84: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,723 INFO L272 TraceCheckUtils]: 83: Hoare triple {39224#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,724 INFO L290 TraceCheckUtils]: 82: Hoare triple {39224#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {39224#(< ~counter~0 50)} is VALID [2022-04-28 12:41:51,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {39249#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39224#(< ~counter~0 50)} is VALID [2022-04-28 12:41:51,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {39249#(< ~counter~0 49)} assume !(~r~0 > 0); {39249#(< ~counter~0 49)} is VALID [2022-04-28 12:41:51,725 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {38898#true} {39249#(< ~counter~0 49)} #96#return; {39249#(< ~counter~0 49)} is VALID [2022-04-28 12:41:51,725 INFO L290 TraceCheckUtils]: 78: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,725 INFO L290 TraceCheckUtils]: 77: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,725 INFO L272 TraceCheckUtils]: 75: Hoare triple {39249#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,725 INFO L290 TraceCheckUtils]: 74: Hoare triple {39249#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {39249#(< ~counter~0 49)} is VALID [2022-04-28 12:41:51,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {39274#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39249#(< ~counter~0 49)} is VALID [2022-04-28 12:41:51,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {39274#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39274#(< ~counter~0 48)} is VALID [2022-04-28 12:41:51,726 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38898#true} {39274#(< ~counter~0 48)} #96#return; {39274#(< ~counter~0 48)} is VALID [2022-04-28 12:41:51,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,726 INFO L272 TraceCheckUtils]: 67: Hoare triple {39274#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {39274#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {39274#(< ~counter~0 48)} is VALID [2022-04-28 12:41:51,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {39299#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39274#(< ~counter~0 48)} is VALID [2022-04-28 12:41:51,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {39299#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39299#(< ~counter~0 47)} is VALID [2022-04-28 12:41:51,727 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38898#true} {39299#(< ~counter~0 47)} #96#return; {39299#(< ~counter~0 47)} is VALID [2022-04-28 12:41:51,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,728 INFO L272 TraceCheckUtils]: 59: Hoare triple {39299#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {39299#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {39299#(< ~counter~0 47)} is VALID [2022-04-28 12:41:51,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {39324#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39299#(< ~counter~0 47)} is VALID [2022-04-28 12:41:51,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {39324#(< ~counter~0 46)} assume !!(0 != ~r~0); {39324#(< ~counter~0 46)} is VALID [2022-04-28 12:41:51,729 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {38898#true} {39324#(< ~counter~0 46)} #94#return; {39324#(< ~counter~0 46)} is VALID [2022-04-28 12:41:51,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,729 INFO L272 TraceCheckUtils]: 51: Hoare triple {39324#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {39324#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {39324#(< ~counter~0 46)} is VALID [2022-04-28 12:41:51,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {39349#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39324#(< ~counter~0 46)} is VALID [2022-04-28 12:41:51,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {39349#(< ~counter~0 45)} assume !(~r~0 < 0); {39349#(< ~counter~0 45)} is VALID [2022-04-28 12:41:51,730 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38898#true} {39349#(< ~counter~0 45)} #98#return; {39349#(< ~counter~0 45)} is VALID [2022-04-28 12:41:51,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,730 INFO L272 TraceCheckUtils]: 43: Hoare triple {39349#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {39349#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {39349#(< ~counter~0 45)} is VALID [2022-04-28 12:41:51,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {39374#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39349#(< ~counter~0 45)} is VALID [2022-04-28 12:41:51,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {39374#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39374#(< ~counter~0 44)} is VALID [2022-04-28 12:41:51,731 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38898#true} {39374#(< ~counter~0 44)} #98#return; {39374#(< ~counter~0 44)} is VALID [2022-04-28 12:41:51,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,731 INFO L272 TraceCheckUtils]: 35: Hoare triple {39374#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {39374#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {39374#(< ~counter~0 44)} is VALID [2022-04-28 12:41:51,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {39399#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39374#(< ~counter~0 44)} is VALID [2022-04-28 12:41:51,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {39399#(< ~counter~0 43)} assume !(~r~0 > 0); {39399#(< ~counter~0 43)} is VALID [2022-04-28 12:41:51,732 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38898#true} {39399#(< ~counter~0 43)} #96#return; {39399#(< ~counter~0 43)} is VALID [2022-04-28 12:41:51,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,733 INFO L272 TraceCheckUtils]: 27: Hoare triple {39399#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {39399#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {39399#(< ~counter~0 43)} is VALID [2022-04-28 12:41:51,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {39424#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39399#(< ~counter~0 43)} is VALID [2022-04-28 12:41:51,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {39424#(< ~counter~0 42)} assume !!(0 != ~r~0); {39424#(< ~counter~0 42)} is VALID [2022-04-28 12:41:51,734 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38898#true} {39424#(< ~counter~0 42)} #94#return; {39424#(< ~counter~0 42)} is VALID [2022-04-28 12:41:51,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,734 INFO L272 TraceCheckUtils]: 19: Hoare triple {39424#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {39424#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {39424#(< ~counter~0 42)} is VALID [2022-04-28 12:41:51,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {39449#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39424#(< ~counter~0 42)} is VALID [2022-04-28 12:41:51,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {39449#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {39449#(< ~counter~0 41)} is VALID [2022-04-28 12:41:51,735 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38898#true} {39449#(< ~counter~0 41)} #92#return; {39449#(< ~counter~0 41)} is VALID [2022-04-28 12:41:51,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,735 INFO L272 TraceCheckUtils]: 11: Hoare triple {39449#(< ~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)); {38898#true} is VALID [2022-04-28 12:41:51,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38898#true} {39449#(< ~counter~0 41)} #90#return; {39449#(< ~counter~0 41)} is VALID [2022-04-28 12:41:51,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {38898#true} assume true; {38898#true} is VALID [2022-04-28 12:41:51,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {38898#true} assume !(0 == ~cond); {38898#true} is VALID [2022-04-28 12:41:51,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {38898#true} ~cond := #in~cond; {38898#true} is VALID [2022-04-28 12:41:51,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {39449#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {38898#true} is VALID [2022-04-28 12:41:51,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {39449#(< ~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; {39449#(< ~counter~0 41)} is VALID [2022-04-28 12:41:51,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {39449#(< ~counter~0 41)} call #t~ret9 := main(); {39449#(< ~counter~0 41)} is VALID [2022-04-28 12:41:51,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39449#(< ~counter~0 41)} {38898#true} #102#return; {39449#(< ~counter~0 41)} is VALID [2022-04-28 12:41:51,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {39449#(< ~counter~0 41)} assume true; {39449#(< ~counter~0 41)} is VALID [2022-04-28 12:41:51,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {38898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {39449#(< ~counter~0 41)} is VALID [2022-04-28 12:41:51,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {38898#true} call ULTIMATE.init(); {38898#true} is VALID [2022-04-28 12:41:51,737 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-28 12:41:51,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:41:51,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236312076] [2022-04-28 12:41:51,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:41:51,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649497356] [2022-04-28 12:41:51,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649497356] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:41:51,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:41:51,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 12:41:51,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:41:51,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1984023004] [2022-04-28 12:41:51,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1984023004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:41:51,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:41:51,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:41:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129050006] [2022-04-28 12:41:51,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:41:51,738 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-28 12:41:51,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:41:51,739 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-28 12:41:51,780 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-28 12:41:51,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:41:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:41:51,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:41:51,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 12:41:51,780 INFO L87 Difference]: Start difference. First operand 366 states and 474 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-28 12:41:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:52,763 INFO L93 Difference]: Finished difference Result 495 states and 661 transitions. [2022-04-28 12:41:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 12:41:52,763 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-28 12:41:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:41:52,764 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-28 12:41:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-28 12:41:52,765 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-28 12:41:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-28 12:41:52,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-28 12:41:52,883 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-28 12:41:52,890 INFO L225 Difference]: With dead ends: 495 [2022-04-28 12:41:52,890 INFO L226 Difference]: Without dead ends: 376 [2022-04-28 12:41:52,891 INFO L412 NwaCegarLoop]: 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-28 12:41:52,891 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 133 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:41:52,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 230 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:41:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-04-28 12:41:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2022-04-28 12:41:53,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:41:53,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 368 states, 275 states have (on average 1.1963636363636363) internal successors, (329), 279 states have internal predecessors, (329), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:53,272 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 368 states, 275 states have (on average 1.1963636363636363) internal successors, (329), 279 states have internal predecessors, (329), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:53,272 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 368 states, 275 states have (on average 1.1963636363636363) internal successors, (329), 279 states have internal predecessors, (329), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:53,277 INFO L93 Difference]: Finished difference Result 376 states and 483 transitions. [2022-04-28 12:41:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 483 transitions. [2022-04-28 12:41:53,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:41:53,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:41:53,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 275 states have (on average 1.1963636363636363) internal successors, (329), 279 states have internal predecessors, (329), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 376 states. [2022-04-28 12:41:53,279 INFO L87 Difference]: Start difference. First operand has 368 states, 275 states have (on average 1.1963636363636363) internal successors, (329), 279 states have internal predecessors, (329), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 376 states. [2022-04-28 12:41:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:41:53,284 INFO L93 Difference]: Finished difference Result 376 states and 483 transitions. [2022-04-28 12:41:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 483 transitions. [2022-04-28 12:41:53,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:41:53,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:41:53,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:41:53,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:41:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 275 states have (on average 1.1963636363636363) internal successors, (329), 279 states have internal predecessors, (329), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:41:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 475 transitions. [2022-04-28 12:41:53,292 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 475 transitions. Word has length 97 [2022-04-28 12:41:53,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:41:53,292 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 475 transitions. [2022-04-28 12:41:53,292 INFO L496 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-28 12:41:53,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 368 states and 475 transitions. [2022-04-28 12:42:01,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 475 transitions. [2022-04-28 12:42:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 12:42:01,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:01,365 INFO L195 NwaCegarLoop]: 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-28 12:42:01,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 12:42:01,565 WARN L477 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-28 12:42:01,566 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:01,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-28 12:42:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:01,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [175607753] [2022-04-28 12:42:01,566 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-28 12:42:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:01,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515444918] [2022-04-28 12:42:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:01,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:01,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752994899] [2022-04-28 12:42:01,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:42:01,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:01,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:01,591 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-28 12:42:01,595 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-28 12:42:01,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:42:01,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:01,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 12:42:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:01,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:01,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {41995#true} call ULTIMATE.init(); {41995#true} is VALID [2022-04-28 12:42:01,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {41995#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41995#true} is VALID [2022-04-28 12:42:01,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41995#true} {41995#true} #102#return; {41995#true} is VALID [2022-04-28 12:42:01,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {41995#true} call #t~ret9 := main(); {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {41995#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; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {41995#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41995#true} {41995#true} #90#return; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {41995#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)); {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41995#true} {41995#true} #92#return; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {41995#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {41995#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {41995#true} assume !!(#t~post6 < 50);havoc #t~post6; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L272 TraceCheckUtils]: 19: Hoare triple {41995#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)); {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {41995#true} {41995#true} #94#return; {41995#true} is VALID [2022-04-28 12:42:01,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {41995#true} assume !!(0 != ~r~0); {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {41995#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {41995#true} assume !!(#t~post7 < 50);havoc #t~post7; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L272 TraceCheckUtils]: 27: Hoare triple {41995#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)); {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {41995#true} {41995#true} #96#return; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {41995#true} assume !(~r~0 > 0); {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {41995#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {41995#true} assume !!(#t~post8 < 50);havoc #t~post8; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L272 TraceCheckUtils]: 35: Hoare triple {41995#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)); {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {41995#true} {41995#true} #98#return; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {41995#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {41995#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41995#true} is VALID [2022-04-28 12:42:01,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {41995#true} assume !!(#t~post8 < 50);havoc #t~post8; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L272 TraceCheckUtils]: 43: Hoare triple {41995#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)); {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {41995#true} {41995#true} #98#return; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {41995#true} assume !(~r~0 < 0); {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {41995#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 50: Hoare triple {41995#true} assume !!(#t~post6 < 50);havoc #t~post6; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L272 TraceCheckUtils]: 51: Hoare triple {41995#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)); {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {41995#true} {41995#true} #94#return; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {41995#true} assume !!(0 != ~r~0); {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {41995#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {41995#true} assume !!(#t~post7 < 50);havoc #t~post7; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L272 TraceCheckUtils]: 59: Hoare triple {41995#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)); {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41995#true} {41995#true} #96#return; {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 64: Hoare triple {41995#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 65: Hoare triple {41995#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 66: Hoare triple {41995#true} assume !!(#t~post7 < 50);havoc #t~post7; {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L272 TraceCheckUtils]: 67: Hoare triple {41995#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)); {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 68: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 69: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 70: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41995#true} {41995#true} #96#return; {41995#true} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 72: Hoare triple {41995#true} assume !(~r~0 > 0); {42216#(not (< 0 main_~r~0))} is VALID [2022-04-28 12:42:01,916 INFO L290 TraceCheckUtils]: 73: Hoare triple {42216#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42216#(not (< 0 main_~r~0))} is VALID [2022-04-28 12:42:01,917 INFO L290 TraceCheckUtils]: 74: Hoare triple {42216#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {42216#(not (< 0 main_~r~0))} is VALID [2022-04-28 12:42:01,917 INFO L272 TraceCheckUtils]: 75: Hoare triple {42216#(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)); {41995#true} is VALID [2022-04-28 12:42:01,917 INFO L290 TraceCheckUtils]: 76: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,917 INFO L290 TraceCheckUtils]: 77: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,917 INFO L290 TraceCheckUtils]: 78: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,917 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {41995#true} {42216#(not (< 0 main_~r~0))} #98#return; {42216#(not (< 0 main_~r~0))} is VALID [2022-04-28 12:42:01,918 INFO L290 TraceCheckUtils]: 80: Hoare triple {42216#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {42241#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 12:42:01,918 INFO L290 TraceCheckUtils]: 81: Hoare triple {42241#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42241#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 12:42:01,918 INFO L290 TraceCheckUtils]: 82: Hoare triple {42241#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {42241#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 12:42:01,919 INFO L272 TraceCheckUtils]: 83: Hoare triple {42241#(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)); {41995#true} is VALID [2022-04-28 12:42:01,919 INFO L290 TraceCheckUtils]: 84: Hoare triple {41995#true} ~cond := #in~cond; {41995#true} is VALID [2022-04-28 12:42:01,919 INFO L290 TraceCheckUtils]: 85: Hoare triple {41995#true} assume !(0 == ~cond); {41995#true} is VALID [2022-04-28 12:42:01,919 INFO L290 TraceCheckUtils]: 86: Hoare triple {41995#true} assume true; {41995#true} is VALID [2022-04-28 12:42:01,919 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {41995#true} {42241#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {42241#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 12:42:01,919 INFO L290 TraceCheckUtils]: 88: Hoare triple {42241#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 89: Hoare triple {41996#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 90: Hoare triple {41996#false} assume !(#t~post7 < 50);havoc #t~post7; {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 91: Hoare triple {41996#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {41996#false} assume !(#t~post8 < 50);havoc #t~post8; {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {41996#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 94: Hoare triple {41996#false} assume !(#t~post6 < 50);havoc #t~post6; {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L272 TraceCheckUtils]: 95: Hoare triple {41996#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 96: Hoare triple {41996#false} ~cond := #in~cond; {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 97: Hoare triple {41996#false} assume 0 == ~cond; {41996#false} is VALID [2022-04-28 12:42:01,920 INFO L290 TraceCheckUtils]: 98: Hoare triple {41996#false} assume !false; {41996#false} is VALID [2022-04-28 12:42:01,920 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-28 12:42:01,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:42:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:01,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515444918] [2022-04-28 12:42:01,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:01,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752994899] [2022-04-28 12:42:01,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752994899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:01,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:01,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:42:01,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:01,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [175607753] [2022-04-28 12:42:01,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [175607753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:01,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:01,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:42:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487288175] [2022-04-28 12:42:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:01,921 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-28 12:42:01,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:01,922 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-28 12:42:01,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:01,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:42:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:42:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:42:01,963 INFO L87 Difference]: Start difference. First operand 368 states and 475 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-28 12:42:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:02,651 INFO L93 Difference]: Finished difference Result 528 states and 693 transitions. [2022-04-28 12:42:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:42:02,652 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-28 12:42:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:02,652 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-28 12:42:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 12:42:02,652 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-28 12:42:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 12:42:02,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 12:42:02,721 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-28 12:42:02,728 INFO L225 Difference]: With dead ends: 528 [2022-04-28 12:42:02,728 INFO L226 Difference]: Without dead ends: 386 [2022-04-28 12:42:02,729 INFO L412 NwaCegarLoop]: 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-28 12:42:02,729 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:02,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:42:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-04-28 12:42:03,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 376. [2022-04-28 12:42:03,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:03,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 376 states, 283 states have (on average 1.2014134275618376) internal successors, (340), 287 states have internal predecessors, (340), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:42:03,316 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 376 states, 283 states have (on average 1.2014134275618376) internal successors, (340), 287 states have internal predecessors, (340), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:42:03,316 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 376 states, 283 states have (on average 1.2014134275618376) internal successors, (340), 287 states have internal predecessors, (340), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:42:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:03,322 INFO L93 Difference]: Finished difference Result 386 states and 499 transitions. [2022-04-28 12:42:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 499 transitions. [2022-04-28 12:42:03,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:03,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:03,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 283 states have (on average 1.2014134275618376) internal successors, (340), 287 states have internal predecessors, (340), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 386 states. [2022-04-28 12:42:03,323 INFO L87 Difference]: Start difference. First operand has 376 states, 283 states have (on average 1.2014134275618376) internal successors, (340), 287 states have internal predecessors, (340), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 386 states. [2022-04-28 12:42:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:03,330 INFO L93 Difference]: Finished difference Result 386 states and 499 transitions. [2022-04-28 12:42:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 499 transitions. [2022-04-28 12:42:03,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:03,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:03,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:03,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 283 states have (on average 1.2014134275618376) internal successors, (340), 287 states have internal predecessors, (340), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:42:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 486 transitions. [2022-04-28 12:42:03,337 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 486 transitions. Word has length 99 [2022-04-28 12:42:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:03,338 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 486 transitions. [2022-04-28 12:42:03,338 INFO L496 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-28 12:42:03,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 376 states and 486 transitions. [2022-04-28 12:42:17,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 483 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 486 transitions. [2022-04-28 12:42:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 12:42:17,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:17,767 INFO L195 NwaCegarLoop]: 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-28 12:42:17,785 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-28 12:42:17,967 WARN L477 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-28 12:42:17,968 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-28 12:42:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:17,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1541280398] [2022-04-28 12:42:17,968 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-28 12:42:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:17,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748951554] [2022-04-28 12:42:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:17,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:17,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141183249] [2022-04-28 12:42:17,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:42:17,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:17,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:17,997 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-28 12:42:17,997 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-28 12:42:18,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:42:18,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:18,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 12:42:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:18,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:18,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {44875#true} call ULTIMATE.init(); {44875#true} is VALID [2022-04-28 12:42:18,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {44875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {44883#(<= ~counter~0 0)} assume true; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44883#(<= ~counter~0 0)} {44875#true} #102#return; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {44883#(<= ~counter~0 0)} call #t~ret9 := main(); {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {44883#(<= ~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; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {44883#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {44883#(<= ~counter~0 0)} ~cond := #in~cond; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {44883#(<= ~counter~0 0)} assume !(0 == ~cond); {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {44883#(<= ~counter~0 0)} assume true; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,510 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44883#(<= ~counter~0 0)} {44883#(<= ~counter~0 0)} #90#return; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,511 INFO L272 TraceCheckUtils]: 11: Hoare triple {44883#(<= ~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)); {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {44883#(<= ~counter~0 0)} ~cond := #in~cond; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {44883#(<= ~counter~0 0)} assume !(0 == ~cond); {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {44883#(<= ~counter~0 0)} assume true; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,515 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44883#(<= ~counter~0 0)} {44883#(<= ~counter~0 0)} #92#return; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {44883#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {44883#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:18,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {44883#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44932#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:18,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {44932#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {44932#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:18,517 INFO L272 TraceCheckUtils]: 19: Hoare triple {44932#(<= ~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)); {44932#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:18,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {44932#(<= ~counter~0 1)} ~cond := #in~cond; {44932#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:18,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {44932#(<= ~counter~0 1)} assume !(0 == ~cond); {44932#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:18,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {44932#(<= ~counter~0 1)} assume true; {44932#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:18,519 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {44932#(<= ~counter~0 1)} {44932#(<= ~counter~0 1)} #94#return; {44932#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:18,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {44932#(<= ~counter~0 1)} assume !!(0 != ~r~0); {44932#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:18,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {44932#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44957#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:18,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {44957#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {44957#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:18,521 INFO L272 TraceCheckUtils]: 27: Hoare triple {44957#(<= ~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)); {44957#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:18,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {44957#(<= ~counter~0 2)} ~cond := #in~cond; {44957#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:18,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {44957#(<= ~counter~0 2)} assume !(0 == ~cond); {44957#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:18,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {44957#(<= ~counter~0 2)} assume true; {44957#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:18,522 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {44957#(<= ~counter~0 2)} {44957#(<= ~counter~0 2)} #96#return; {44957#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:18,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {44957#(<= ~counter~0 2)} assume !(~r~0 > 0); {44957#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:18,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {44957#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44982#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:18,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {44982#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {44982#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:18,524 INFO L272 TraceCheckUtils]: 35: Hoare triple {44982#(<= ~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)); {44982#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:18,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {44982#(<= ~counter~0 3)} ~cond := #in~cond; {44982#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:18,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {44982#(<= ~counter~0 3)} assume !(0 == ~cond); {44982#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:18,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {44982#(<= ~counter~0 3)} assume true; {44982#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:18,525 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {44982#(<= ~counter~0 3)} {44982#(<= ~counter~0 3)} #98#return; {44982#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:18,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {44982#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44982#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:18,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {44982#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45007#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:18,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {45007#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {45007#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:18,527 INFO L272 TraceCheckUtils]: 43: Hoare triple {45007#(<= ~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)); {45007#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:18,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {45007#(<= ~counter~0 4)} ~cond := #in~cond; {45007#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:18,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {45007#(<= ~counter~0 4)} assume !(0 == ~cond); {45007#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:18,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {45007#(<= ~counter~0 4)} assume true; {45007#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:18,529 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {45007#(<= ~counter~0 4)} {45007#(<= ~counter~0 4)} #98#return; {45007#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:18,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {45007#(<= ~counter~0 4)} assume !(~r~0 < 0); {45007#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:18,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {45007#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45032#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:18,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {45032#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {45032#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:18,530 INFO L272 TraceCheckUtils]: 51: Hoare triple {45032#(<= ~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)); {45032#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:18,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {45032#(<= ~counter~0 5)} ~cond := #in~cond; {45032#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:18,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {45032#(<= ~counter~0 5)} assume !(0 == ~cond); {45032#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:18,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {45032#(<= ~counter~0 5)} assume true; {45032#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:18,532 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {45032#(<= ~counter~0 5)} {45032#(<= ~counter~0 5)} #94#return; {45032#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:18,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {45032#(<= ~counter~0 5)} assume !!(0 != ~r~0); {45032#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:18,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {45032#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45057#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:18,533 INFO L290 TraceCheckUtils]: 58: Hoare triple {45057#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {45057#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:18,534 INFO L272 TraceCheckUtils]: 59: Hoare triple {45057#(<= ~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)); {45057#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:18,534 INFO L290 TraceCheckUtils]: 60: Hoare triple {45057#(<= ~counter~0 6)} ~cond := #in~cond; {45057#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:18,534 INFO L290 TraceCheckUtils]: 61: Hoare triple {45057#(<= ~counter~0 6)} assume !(0 == ~cond); {45057#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:18,534 INFO L290 TraceCheckUtils]: 62: Hoare triple {45057#(<= ~counter~0 6)} assume true; {45057#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:18,535 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {45057#(<= ~counter~0 6)} {45057#(<= ~counter~0 6)} #96#return; {45057#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:18,535 INFO L290 TraceCheckUtils]: 64: Hoare triple {45057#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45057#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:18,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {45057#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45082#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:18,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {45082#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {45082#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:18,537 INFO L272 TraceCheckUtils]: 67: Hoare triple {45082#(<= ~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)); {45082#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:18,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {45082#(<= ~counter~0 7)} ~cond := #in~cond; {45082#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:18,537 INFO L290 TraceCheckUtils]: 69: Hoare triple {45082#(<= ~counter~0 7)} assume !(0 == ~cond); {45082#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:18,538 INFO L290 TraceCheckUtils]: 70: Hoare triple {45082#(<= ~counter~0 7)} assume true; {45082#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:18,538 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {45082#(<= ~counter~0 7)} {45082#(<= ~counter~0 7)} #96#return; {45082#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:18,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {45082#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45082#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:18,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {45082#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45107#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:18,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {45107#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {45107#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:18,540 INFO L272 TraceCheckUtils]: 75: Hoare triple {45107#(<= ~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)); {45107#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:18,540 INFO L290 TraceCheckUtils]: 76: Hoare triple {45107#(<= ~counter~0 8)} ~cond := #in~cond; {45107#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:18,541 INFO L290 TraceCheckUtils]: 77: Hoare triple {45107#(<= ~counter~0 8)} assume !(0 == ~cond); {45107#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:18,541 INFO L290 TraceCheckUtils]: 78: Hoare triple {45107#(<= ~counter~0 8)} assume true; {45107#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:18,542 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {45107#(<= ~counter~0 8)} {45107#(<= ~counter~0 8)} #96#return; {45107#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:18,542 INFO L290 TraceCheckUtils]: 80: Hoare triple {45107#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45107#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:18,542 INFO L290 TraceCheckUtils]: 81: Hoare triple {45107#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45132#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:18,543 INFO L290 TraceCheckUtils]: 82: Hoare triple {45132#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {45132#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:18,543 INFO L272 TraceCheckUtils]: 83: Hoare triple {45132#(<= ~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)); {45132#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:18,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {45132#(<= ~counter~0 9)} ~cond := #in~cond; {45132#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:18,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {45132#(<= ~counter~0 9)} assume !(0 == ~cond); {45132#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:18,544 INFO L290 TraceCheckUtils]: 86: Hoare triple {45132#(<= ~counter~0 9)} assume true; {45132#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:18,545 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45132#(<= ~counter~0 9)} {45132#(<= ~counter~0 9)} #96#return; {45132#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:18,545 INFO L290 TraceCheckUtils]: 88: Hoare triple {45132#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45132#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:18,545 INFO L290 TraceCheckUtils]: 89: Hoare triple {45132#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45157#(<= |main_#t~post7| 9)} is VALID [2022-04-28 12:42:18,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {45157#(<= |main_#t~post7| 9)} assume !(#t~post7 < 50);havoc #t~post7; {44876#false} is VALID [2022-04-28 12:42:18,546 INFO L290 TraceCheckUtils]: 91: Hoare triple {44876#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44876#false} is VALID [2022-04-28 12:42:18,546 INFO L290 TraceCheckUtils]: 92: Hoare triple {44876#false} assume !(#t~post8 < 50);havoc #t~post8; {44876#false} is VALID [2022-04-28 12:42:18,546 INFO L290 TraceCheckUtils]: 93: Hoare triple {44876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44876#false} is VALID [2022-04-28 12:42:18,546 INFO L290 TraceCheckUtils]: 94: Hoare triple {44876#false} assume !(#t~post6 < 50);havoc #t~post6; {44876#false} is VALID [2022-04-28 12:42:18,546 INFO L272 TraceCheckUtils]: 95: Hoare triple {44876#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44876#false} is VALID [2022-04-28 12:42:18,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {44876#false} ~cond := #in~cond; {44876#false} is VALID [2022-04-28 12:42:18,546 INFO L290 TraceCheckUtils]: 97: Hoare triple {44876#false} assume 0 == ~cond; {44876#false} is VALID [2022-04-28 12:42:18,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {44876#false} assume !false; {44876#false} is VALID [2022-04-28 12:42:18,547 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-28 12:42:18,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:42:18,982 INFO L290 TraceCheckUtils]: 98: Hoare triple {44876#false} assume !false; {44876#false} is VALID [2022-04-28 12:42:18,982 INFO L290 TraceCheckUtils]: 97: Hoare triple {44876#false} assume 0 == ~cond; {44876#false} is VALID [2022-04-28 12:42:18,982 INFO L290 TraceCheckUtils]: 96: Hoare triple {44876#false} ~cond := #in~cond; {44876#false} is VALID [2022-04-28 12:42:18,982 INFO L272 TraceCheckUtils]: 95: Hoare triple {44876#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44876#false} is VALID [2022-04-28 12:42:18,982 INFO L290 TraceCheckUtils]: 94: Hoare triple {44876#false} assume !(#t~post6 < 50);havoc #t~post6; {44876#false} is VALID [2022-04-28 12:42:18,982 INFO L290 TraceCheckUtils]: 93: Hoare triple {44876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44876#false} is VALID [2022-04-28 12:42:18,982 INFO L290 TraceCheckUtils]: 92: Hoare triple {44876#false} assume !(#t~post8 < 50);havoc #t~post8; {44876#false} is VALID [2022-04-28 12:42:18,983 INFO L290 TraceCheckUtils]: 91: Hoare triple {44876#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44876#false} is VALID [2022-04-28 12:42:18,983 INFO L290 TraceCheckUtils]: 90: Hoare triple {45209#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {44876#false} is VALID [2022-04-28 12:42:18,983 INFO L290 TraceCheckUtils]: 89: Hoare triple {45213#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45209#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:42:18,983 INFO L290 TraceCheckUtils]: 88: Hoare triple {45213#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45213#(< ~counter~0 50)} is VALID [2022-04-28 12:42:18,984 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {44875#true} {45213#(< ~counter~0 50)} #96#return; {45213#(< ~counter~0 50)} is VALID [2022-04-28 12:42:18,984 INFO L290 TraceCheckUtils]: 86: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:18,984 INFO L290 TraceCheckUtils]: 85: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:18,984 INFO L290 TraceCheckUtils]: 84: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:18,984 INFO L272 TraceCheckUtils]: 83: Hoare triple {45213#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:18,984 INFO L290 TraceCheckUtils]: 82: Hoare triple {45213#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {45213#(< ~counter~0 50)} is VALID [2022-04-28 12:42:18,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {45238#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45213#(< ~counter~0 50)} is VALID [2022-04-28 12:42:18,986 INFO L290 TraceCheckUtils]: 80: Hoare triple {45238#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45238#(< ~counter~0 49)} is VALID [2022-04-28 12:42:18,986 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {44875#true} {45238#(< ~counter~0 49)} #96#return; {45238#(< ~counter~0 49)} is VALID [2022-04-28 12:42:18,986 INFO L290 TraceCheckUtils]: 78: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:18,986 INFO L290 TraceCheckUtils]: 77: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:18,986 INFO L290 TraceCheckUtils]: 76: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:18,986 INFO L272 TraceCheckUtils]: 75: Hoare triple {45238#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:18,987 INFO L290 TraceCheckUtils]: 74: Hoare triple {45238#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {45238#(< ~counter~0 49)} is VALID [2022-04-28 12:42:18,987 INFO L290 TraceCheckUtils]: 73: Hoare triple {45263#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45238#(< ~counter~0 49)} is VALID [2022-04-28 12:42:18,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {45263#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45263#(< ~counter~0 48)} is VALID [2022-04-28 12:42:18,988 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {44875#true} {45263#(< ~counter~0 48)} #96#return; {45263#(< ~counter~0 48)} is VALID [2022-04-28 12:42:18,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:18,988 INFO L290 TraceCheckUtils]: 69: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:18,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:18,988 INFO L272 TraceCheckUtils]: 67: Hoare triple {45263#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:18,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {45263#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {45263#(< ~counter~0 48)} is VALID [2022-04-28 12:42:18,989 INFO L290 TraceCheckUtils]: 65: Hoare triple {45288#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45263#(< ~counter~0 48)} is VALID [2022-04-28 12:42:18,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {45288#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45288#(< ~counter~0 47)} is VALID [2022-04-28 12:42:18,990 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {44875#true} {45288#(< ~counter~0 47)} #96#return; {45288#(< ~counter~0 47)} is VALID [2022-04-28 12:42:18,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:18,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:18,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:18,995 INFO L272 TraceCheckUtils]: 59: Hoare triple {45288#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:18,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {45288#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {45288#(< ~counter~0 47)} is VALID [2022-04-28 12:42:18,998 INFO L290 TraceCheckUtils]: 57: Hoare triple {45313#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45288#(< ~counter~0 47)} is VALID [2022-04-28 12:42:18,998 INFO L290 TraceCheckUtils]: 56: Hoare triple {45313#(< ~counter~0 46)} assume !!(0 != ~r~0); {45313#(< ~counter~0 46)} is VALID [2022-04-28 12:42:18,999 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {44875#true} {45313#(< ~counter~0 46)} #94#return; {45313#(< ~counter~0 46)} is VALID [2022-04-28 12:42:18,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:18,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:18,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:18,999 INFO L272 TraceCheckUtils]: 51: Hoare triple {45313#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:18,999 INFO L290 TraceCheckUtils]: 50: Hoare triple {45313#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {45313#(< ~counter~0 46)} is VALID [2022-04-28 12:42:19,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {45338#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45313#(< ~counter~0 46)} is VALID [2022-04-28 12:42:19,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {45338#(< ~counter~0 45)} assume !(~r~0 < 0); {45338#(< ~counter~0 45)} is VALID [2022-04-28 12:42:19,001 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44875#true} {45338#(< ~counter~0 45)} #98#return; {45338#(< ~counter~0 45)} is VALID [2022-04-28 12:42:19,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:19,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:19,001 INFO L290 TraceCheckUtils]: 44: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:19,001 INFO L272 TraceCheckUtils]: 43: Hoare triple {45338#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:19,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {45338#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {45338#(< ~counter~0 45)} is VALID [2022-04-28 12:42:19,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {45363#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45338#(< ~counter~0 45)} is VALID [2022-04-28 12:42:19,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {45363#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {45363#(< ~counter~0 44)} is VALID [2022-04-28 12:42:19,003 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {44875#true} {45363#(< ~counter~0 44)} #98#return; {45363#(< ~counter~0 44)} is VALID [2022-04-28 12:42:19,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:19,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:19,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:19,003 INFO L272 TraceCheckUtils]: 35: Hoare triple {45363#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:19,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {45363#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {45363#(< ~counter~0 44)} is VALID [2022-04-28 12:42:19,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {45388#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45363#(< ~counter~0 44)} is VALID [2022-04-28 12:42:19,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {45388#(< ~counter~0 43)} assume !(~r~0 > 0); {45388#(< ~counter~0 43)} is VALID [2022-04-28 12:42:19,005 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {44875#true} {45388#(< ~counter~0 43)} #96#return; {45388#(< ~counter~0 43)} is VALID [2022-04-28 12:42:19,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:19,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:19,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:19,005 INFO L272 TraceCheckUtils]: 27: Hoare triple {45388#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:19,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {45388#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {45388#(< ~counter~0 43)} is VALID [2022-04-28 12:42:19,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {45413#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45388#(< ~counter~0 43)} is VALID [2022-04-28 12:42:19,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {45413#(< ~counter~0 42)} assume !!(0 != ~r~0); {45413#(< ~counter~0 42)} is VALID [2022-04-28 12:42:19,007 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {44875#true} {45413#(< ~counter~0 42)} #94#return; {45413#(< ~counter~0 42)} is VALID [2022-04-28 12:42:19,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:19,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:19,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:19,007 INFO L272 TraceCheckUtils]: 19: Hoare triple {45413#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:19,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {45413#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {45413#(< ~counter~0 42)} is VALID [2022-04-28 12:42:19,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {45438#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45413#(< ~counter~0 42)} is VALID [2022-04-28 12:42:19,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {45438#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {45438#(< ~counter~0 41)} is VALID [2022-04-28 12:42:19,009 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44875#true} {45438#(< ~counter~0 41)} #92#return; {45438#(< ~counter~0 41)} is VALID [2022-04-28 12:42:19,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:19,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:19,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:19,009 INFO L272 TraceCheckUtils]: 11: Hoare triple {45438#(< ~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)); {44875#true} is VALID [2022-04-28 12:42:19,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44875#true} {45438#(< ~counter~0 41)} #90#return; {45438#(< ~counter~0 41)} is VALID [2022-04-28 12:42:19,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {44875#true} assume true; {44875#true} is VALID [2022-04-28 12:42:19,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {44875#true} assume !(0 == ~cond); {44875#true} is VALID [2022-04-28 12:42:19,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {44875#true} ~cond := #in~cond; {44875#true} is VALID [2022-04-28 12:42:19,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {45438#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {44875#true} is VALID [2022-04-28 12:42:19,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {45438#(< ~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; {45438#(< ~counter~0 41)} is VALID [2022-04-28 12:42:19,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {45438#(< ~counter~0 41)} call #t~ret9 := main(); {45438#(< ~counter~0 41)} is VALID [2022-04-28 12:42:19,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45438#(< ~counter~0 41)} {44875#true} #102#return; {45438#(< ~counter~0 41)} is VALID [2022-04-28 12:42:19,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {45438#(< ~counter~0 41)} assume true; {45438#(< ~counter~0 41)} is VALID [2022-04-28 12:42:19,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {44875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {45438#(< ~counter~0 41)} is VALID [2022-04-28 12:42:19,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {44875#true} call ULTIMATE.init(); {44875#true} is VALID [2022-04-28 12:42:19,012 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-28 12:42:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748951554] [2022-04-28 12:42:19,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141183249] [2022-04-28 12:42:19,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141183249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:42:19,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:42:19,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 12:42:19,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1541280398] [2022-04-28 12:42:19,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1541280398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:19,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:19,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:42:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826366076] [2022-04-28 12:42:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:19,013 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-28 12:42:19,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:19,013 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-28 12:42:19,084 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-28 12:42:19,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:42:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:42:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 12:42:19,085 INFO L87 Difference]: Start difference. First operand 376 states and 486 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-28 12:42:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:20,043 INFO L93 Difference]: Finished difference Result 499 states and 663 transitions. [2022-04-28 12:42:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 12:42:20,043 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-28 12:42:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:20,043 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-28 12:42:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-28 12:42:20,045 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-28 12:42:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-28 12:42:20,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-28 12:42:20,214 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-28 12:42:20,221 INFO L225 Difference]: With dead ends: 499 [2022-04-28 12:42:20,221 INFO L226 Difference]: Without dead ends: 388 [2022-04-28 12:42:20,222 INFO L412 NwaCegarLoop]: 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-28 12:42:20,222 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 87 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:20,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 266 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:42:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-04-28 12:42:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2022-04-28 12:42:20,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:20,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 388 states, 295 states have (on average 1.193220338983051) internal successors, (352), 295 states have internal predecessors, (352), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:42:20,850 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 388 states, 295 states have (on average 1.193220338983051) internal successors, (352), 295 states have internal predecessors, (352), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:42:20,851 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 388 states, 295 states have (on average 1.193220338983051) internal successors, (352), 295 states have internal predecessors, (352), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:42:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:20,857 INFO L93 Difference]: Finished difference Result 388 states and 498 transitions. [2022-04-28 12:42:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 498 transitions. [2022-04-28 12:42:20,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:20,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:20,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 388 states, 295 states have (on average 1.193220338983051) internal successors, (352), 295 states have internal predecessors, (352), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 388 states. [2022-04-28 12:42:20,858 INFO L87 Difference]: Start difference. First operand has 388 states, 295 states have (on average 1.193220338983051) internal successors, (352), 295 states have internal predecessors, (352), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 388 states. [2022-04-28 12:42:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:20,864 INFO L93 Difference]: Finished difference Result 388 states and 498 transitions. [2022-04-28 12:42:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 498 transitions. [2022-04-28 12:42:20,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:20,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:20,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:20,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 295 states have (on average 1.193220338983051) internal successors, (352), 295 states have internal predecessors, (352), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 12:42:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 498 transitions. [2022-04-28 12:42:20,872 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 498 transitions. Word has length 99 [2022-04-28 12:42:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:20,873 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 498 transitions. [2022-04-28 12:42:20,873 INFO L496 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-28 12:42:20,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 388 states and 498 transitions. [2022-04-28 12:42:31,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 497 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 498 transitions. [2022-04-28 12:42:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 12:42:31,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:31,307 INFO L195 NwaCegarLoop]: 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-28 12:42:31,324 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-28 12:42:31,508 WARN L477 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-28 12:42:31,508 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-28 12:42:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:31,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896906059] [2022-04-28 12:42:31,509 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-28 12:42:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:31,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68860716] [2022-04-28 12:42:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:31,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:31,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319675319] [2022-04-28 12:42:31,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:42:31,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:31,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:31,529 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-28 12:42:31,530 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-28 12:42:31,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:42:31,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:31,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 12:42:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:31,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:32,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {48058#true} call ULTIMATE.init(); {48058#true} is VALID [2022-04-28 12:42:32,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {48058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {48066#(<= ~counter~0 0)} assume true; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48066#(<= ~counter~0 0)} {48058#true} #102#return; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {48066#(<= ~counter~0 0)} call #t~ret9 := main(); {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {48066#(<= ~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; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {48066#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {48066#(<= ~counter~0 0)} ~cond := #in~cond; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {48066#(<= ~counter~0 0)} assume !(0 == ~cond); {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {48066#(<= ~counter~0 0)} assume true; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48066#(<= ~counter~0 0)} {48066#(<= ~counter~0 0)} #90#return; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,132 INFO L272 TraceCheckUtils]: 11: Hoare triple {48066#(<= ~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)); {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {48066#(<= ~counter~0 0)} ~cond := #in~cond; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {48066#(<= ~counter~0 0)} assume !(0 == ~cond); {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {48066#(<= ~counter~0 0)} assume true; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48066#(<= ~counter~0 0)} {48066#(<= ~counter~0 0)} #92#return; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {48066#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48066#(<= ~counter~0 0)} is VALID [2022-04-28 12:42:32,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {48066#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48115#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:32,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {48115#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {48115#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:32,134 INFO L272 TraceCheckUtils]: 19: Hoare triple {48115#(<= ~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)); {48115#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:32,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {48115#(<= ~counter~0 1)} ~cond := #in~cond; {48115#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:32,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {48115#(<= ~counter~0 1)} assume !(0 == ~cond); {48115#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:32,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {48115#(<= ~counter~0 1)} assume true; {48115#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:32,135 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {48115#(<= ~counter~0 1)} {48115#(<= ~counter~0 1)} #94#return; {48115#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:32,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {48115#(<= ~counter~0 1)} assume !!(0 != ~r~0); {48115#(<= ~counter~0 1)} is VALID [2022-04-28 12:42:32,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {48115#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48140#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:32,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {48140#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {48140#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:32,137 INFO L272 TraceCheckUtils]: 27: Hoare triple {48140#(<= ~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)); {48140#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:32,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {48140#(<= ~counter~0 2)} ~cond := #in~cond; {48140#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:32,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {48140#(<= ~counter~0 2)} assume !(0 == ~cond); {48140#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:32,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {48140#(<= ~counter~0 2)} assume true; {48140#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:32,138 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {48140#(<= ~counter~0 2)} {48140#(<= ~counter~0 2)} #96#return; {48140#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:32,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {48140#(<= ~counter~0 2)} assume !(~r~0 > 0); {48140#(<= ~counter~0 2)} is VALID [2022-04-28 12:42:32,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {48140#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48165#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:32,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {48165#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {48165#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:32,139 INFO L272 TraceCheckUtils]: 35: Hoare triple {48165#(<= ~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)); {48165#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:32,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {48165#(<= ~counter~0 3)} ~cond := #in~cond; {48165#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:32,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {48165#(<= ~counter~0 3)} assume !(0 == ~cond); {48165#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:32,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {48165#(<= ~counter~0 3)} assume true; {48165#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:32,140 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {48165#(<= ~counter~0 3)} {48165#(<= ~counter~0 3)} #98#return; {48165#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:32,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {48165#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48165#(<= ~counter~0 3)} is VALID [2022-04-28 12:42:32,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {48165#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48190#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:32,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {48190#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {48190#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:32,141 INFO L272 TraceCheckUtils]: 43: Hoare triple {48190#(<= ~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)); {48190#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:32,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {48190#(<= ~counter~0 4)} ~cond := #in~cond; {48190#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:32,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {48190#(<= ~counter~0 4)} assume !(0 == ~cond); {48190#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:32,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {48190#(<= ~counter~0 4)} assume true; {48190#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:32,142 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {48190#(<= ~counter~0 4)} {48190#(<= ~counter~0 4)} #98#return; {48190#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:32,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {48190#(<= ~counter~0 4)} assume !(~r~0 < 0); {48190#(<= ~counter~0 4)} is VALID [2022-04-28 12:42:32,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {48190#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48215#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:32,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {48215#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {48215#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:32,143 INFO L272 TraceCheckUtils]: 51: Hoare triple {48215#(<= ~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)); {48215#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:32,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {48215#(<= ~counter~0 5)} ~cond := #in~cond; {48215#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:32,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {48215#(<= ~counter~0 5)} assume !(0 == ~cond); {48215#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:32,144 INFO L290 TraceCheckUtils]: 54: Hoare triple {48215#(<= ~counter~0 5)} assume true; {48215#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:32,144 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48215#(<= ~counter~0 5)} {48215#(<= ~counter~0 5)} #94#return; {48215#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:32,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {48215#(<= ~counter~0 5)} assume !!(0 != ~r~0); {48215#(<= ~counter~0 5)} is VALID [2022-04-28 12:42:32,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {48215#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48240#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:32,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {48240#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {48240#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:32,145 INFO L272 TraceCheckUtils]: 59: Hoare triple {48240#(<= ~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)); {48240#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:32,146 INFO L290 TraceCheckUtils]: 60: Hoare triple {48240#(<= ~counter~0 6)} ~cond := #in~cond; {48240#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:32,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {48240#(<= ~counter~0 6)} assume !(0 == ~cond); {48240#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:32,146 INFO L290 TraceCheckUtils]: 62: Hoare triple {48240#(<= ~counter~0 6)} assume true; {48240#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:32,146 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48240#(<= ~counter~0 6)} {48240#(<= ~counter~0 6)} #96#return; {48240#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:32,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {48240#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48240#(<= ~counter~0 6)} is VALID [2022-04-28 12:42:32,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {48240#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48265#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:32,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {48265#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {48265#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:32,148 INFO L272 TraceCheckUtils]: 67: Hoare triple {48265#(<= ~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)); {48265#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:32,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {48265#(<= ~counter~0 7)} ~cond := #in~cond; {48265#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:32,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {48265#(<= ~counter~0 7)} assume !(0 == ~cond); {48265#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:32,148 INFO L290 TraceCheckUtils]: 70: Hoare triple {48265#(<= ~counter~0 7)} assume true; {48265#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:32,149 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48265#(<= ~counter~0 7)} {48265#(<= ~counter~0 7)} #96#return; {48265#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:32,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {48265#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48265#(<= ~counter~0 7)} is VALID [2022-04-28 12:42:32,149 INFO L290 TraceCheckUtils]: 73: Hoare triple {48265#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48290#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:32,149 INFO L290 TraceCheckUtils]: 74: Hoare triple {48290#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {48290#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:32,150 INFO L272 TraceCheckUtils]: 75: Hoare triple {48290#(<= ~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)); {48290#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:32,150 INFO L290 TraceCheckUtils]: 76: Hoare triple {48290#(<= ~counter~0 8)} ~cond := #in~cond; {48290#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:32,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {48290#(<= ~counter~0 8)} assume !(0 == ~cond); {48290#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:32,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {48290#(<= ~counter~0 8)} assume true; {48290#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:32,151 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48290#(<= ~counter~0 8)} {48290#(<= ~counter~0 8)} #96#return; {48290#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:32,151 INFO L290 TraceCheckUtils]: 80: Hoare triple {48290#(<= ~counter~0 8)} assume !(~r~0 > 0); {48290#(<= ~counter~0 8)} is VALID [2022-04-28 12:42:32,151 INFO L290 TraceCheckUtils]: 81: Hoare triple {48290#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48315#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:32,152 INFO L290 TraceCheckUtils]: 82: Hoare triple {48315#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {48315#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:32,152 INFO L272 TraceCheckUtils]: 83: Hoare triple {48315#(<= ~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)); {48315#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:32,152 INFO L290 TraceCheckUtils]: 84: Hoare triple {48315#(<= ~counter~0 9)} ~cond := #in~cond; {48315#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:32,152 INFO L290 TraceCheckUtils]: 85: Hoare triple {48315#(<= ~counter~0 9)} assume !(0 == ~cond); {48315#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:32,153 INFO L290 TraceCheckUtils]: 86: Hoare triple {48315#(<= ~counter~0 9)} assume true; {48315#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:32,153 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48315#(<= ~counter~0 9)} {48315#(<= ~counter~0 9)} #98#return; {48315#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:32,153 INFO L290 TraceCheckUtils]: 88: Hoare triple {48315#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48315#(<= ~counter~0 9)} is VALID [2022-04-28 12:42:32,154 INFO L290 TraceCheckUtils]: 89: Hoare triple {48315#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48340#(<= ~counter~0 10)} is VALID [2022-04-28 12:42:32,154 INFO L290 TraceCheckUtils]: 90: Hoare triple {48340#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {48340#(<= ~counter~0 10)} is VALID [2022-04-28 12:42:32,154 INFO L272 TraceCheckUtils]: 91: Hoare triple {48340#(<= ~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)); {48340#(<= ~counter~0 10)} is VALID [2022-04-28 12:42:32,154 INFO L290 TraceCheckUtils]: 92: Hoare triple {48340#(<= ~counter~0 10)} ~cond := #in~cond; {48340#(<= ~counter~0 10)} is VALID [2022-04-28 12:42:32,155 INFO L290 TraceCheckUtils]: 93: Hoare triple {48340#(<= ~counter~0 10)} assume !(0 == ~cond); {48340#(<= ~counter~0 10)} is VALID [2022-04-28 12:42:32,155 INFO L290 TraceCheckUtils]: 94: Hoare triple {48340#(<= ~counter~0 10)} assume true; {48340#(<= ~counter~0 10)} is VALID [2022-04-28 12:42:32,155 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {48340#(<= ~counter~0 10)} {48340#(<= ~counter~0 10)} #98#return; {48340#(<= ~counter~0 10)} is VALID [2022-04-28 12:42:32,155 INFO L290 TraceCheckUtils]: 96: Hoare triple {48340#(<= ~counter~0 10)} assume !(~r~0 < 0); {48340#(<= ~counter~0 10)} is VALID [2022-04-28 12:42:32,156 INFO L290 TraceCheckUtils]: 97: Hoare triple {48340#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48365#(<= |main_#t~post6| 10)} is VALID [2022-04-28 12:42:32,156 INFO L290 TraceCheckUtils]: 98: Hoare triple {48365#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {48059#false} is VALID [2022-04-28 12:42:32,156 INFO L272 TraceCheckUtils]: 99: Hoare triple {48059#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48059#false} is VALID [2022-04-28 12:42:32,156 INFO L290 TraceCheckUtils]: 100: Hoare triple {48059#false} ~cond := #in~cond; {48059#false} is VALID [2022-04-28 12:42:32,156 INFO L290 TraceCheckUtils]: 101: Hoare triple {48059#false} assume 0 == ~cond; {48059#false} is VALID [2022-04-28 12:42:32,156 INFO L290 TraceCheckUtils]: 102: Hoare triple {48059#false} assume !false; {48059#false} is VALID [2022-04-28 12:42:32,156 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-28 12:42:32,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:42:32,513 INFO L290 TraceCheckUtils]: 102: Hoare triple {48059#false} assume !false; {48059#false} is VALID [2022-04-28 12:42:32,514 INFO L290 TraceCheckUtils]: 101: Hoare triple {48059#false} assume 0 == ~cond; {48059#false} is VALID [2022-04-28 12:42:32,514 INFO L290 TraceCheckUtils]: 100: Hoare triple {48059#false} ~cond := #in~cond; {48059#false} is VALID [2022-04-28 12:42:32,514 INFO L272 TraceCheckUtils]: 99: Hoare triple {48059#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48059#false} is VALID [2022-04-28 12:42:32,514 INFO L290 TraceCheckUtils]: 98: Hoare triple {48393#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {48059#false} is VALID [2022-04-28 12:42:32,514 INFO L290 TraceCheckUtils]: 97: Hoare triple {48397#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48393#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:42:32,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {48397#(< ~counter~0 50)} assume !(~r~0 < 0); {48397#(< ~counter~0 50)} is VALID [2022-04-28 12:42:32,515 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {48058#true} {48397#(< ~counter~0 50)} #98#return; {48397#(< ~counter~0 50)} is VALID [2022-04-28 12:42:32,515 INFO L290 TraceCheckUtils]: 94: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,515 INFO L290 TraceCheckUtils]: 93: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,515 INFO L290 TraceCheckUtils]: 92: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,515 INFO L272 TraceCheckUtils]: 91: Hoare triple {48397#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,515 INFO L290 TraceCheckUtils]: 90: Hoare triple {48397#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {48397#(< ~counter~0 50)} is VALID [2022-04-28 12:42:32,516 INFO L290 TraceCheckUtils]: 89: Hoare triple {48422#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48397#(< ~counter~0 50)} is VALID [2022-04-28 12:42:32,516 INFO L290 TraceCheckUtils]: 88: Hoare triple {48422#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48422#(< ~counter~0 49)} is VALID [2022-04-28 12:42:32,517 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48058#true} {48422#(< ~counter~0 49)} #98#return; {48422#(< ~counter~0 49)} is VALID [2022-04-28 12:42:32,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,517 INFO L272 TraceCheckUtils]: 83: Hoare triple {48422#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,517 INFO L290 TraceCheckUtils]: 82: Hoare triple {48422#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {48422#(< ~counter~0 49)} is VALID [2022-04-28 12:42:32,517 INFO L290 TraceCheckUtils]: 81: Hoare triple {48447#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48422#(< ~counter~0 49)} is VALID [2022-04-28 12:42:32,518 INFO L290 TraceCheckUtils]: 80: Hoare triple {48447#(< ~counter~0 48)} assume !(~r~0 > 0); {48447#(< ~counter~0 48)} is VALID [2022-04-28 12:42:32,518 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48058#true} {48447#(< ~counter~0 48)} #96#return; {48447#(< ~counter~0 48)} is VALID [2022-04-28 12:42:32,518 INFO L290 TraceCheckUtils]: 78: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,518 INFO L290 TraceCheckUtils]: 77: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,518 INFO L290 TraceCheckUtils]: 76: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,518 INFO L272 TraceCheckUtils]: 75: Hoare triple {48447#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,518 INFO L290 TraceCheckUtils]: 74: Hoare triple {48447#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {48447#(< ~counter~0 48)} is VALID [2022-04-28 12:42:32,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {48472#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48447#(< ~counter~0 48)} is VALID [2022-04-28 12:42:32,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {48472#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48472#(< ~counter~0 47)} is VALID [2022-04-28 12:42:32,519 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48058#true} {48472#(< ~counter~0 47)} #96#return; {48472#(< ~counter~0 47)} is VALID [2022-04-28 12:42:32,519 INFO L290 TraceCheckUtils]: 70: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,519 INFO L290 TraceCheckUtils]: 69: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,520 INFO L272 TraceCheckUtils]: 67: Hoare triple {48472#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {48472#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {48472#(< ~counter~0 47)} is VALID [2022-04-28 12:42:32,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {48497#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48472#(< ~counter~0 47)} is VALID [2022-04-28 12:42:32,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {48497#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48497#(< ~counter~0 46)} is VALID [2022-04-28 12:42:32,521 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48058#true} {48497#(< ~counter~0 46)} #96#return; {48497#(< ~counter~0 46)} is VALID [2022-04-28 12:42:32,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,521 INFO L272 TraceCheckUtils]: 59: Hoare triple {48497#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {48497#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {48497#(< ~counter~0 46)} is VALID [2022-04-28 12:42:32,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {48522#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48497#(< ~counter~0 46)} is VALID [2022-04-28 12:42:32,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {48522#(< ~counter~0 45)} assume !!(0 != ~r~0); {48522#(< ~counter~0 45)} is VALID [2022-04-28 12:42:32,522 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48058#true} {48522#(< ~counter~0 45)} #94#return; {48522#(< ~counter~0 45)} is VALID [2022-04-28 12:42:32,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,522 INFO L272 TraceCheckUtils]: 51: Hoare triple {48522#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {48522#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {48522#(< ~counter~0 45)} is VALID [2022-04-28 12:42:32,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {48547#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48522#(< ~counter~0 45)} is VALID [2022-04-28 12:42:32,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {48547#(< ~counter~0 44)} assume !(~r~0 < 0); {48547#(< ~counter~0 44)} is VALID [2022-04-28 12:42:32,523 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {48058#true} {48547#(< ~counter~0 44)} #98#return; {48547#(< ~counter~0 44)} is VALID [2022-04-28 12:42:32,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,524 INFO L272 TraceCheckUtils]: 43: Hoare triple {48547#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {48547#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {48547#(< ~counter~0 44)} is VALID [2022-04-28 12:42:32,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {48572#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48547#(< ~counter~0 44)} is VALID [2022-04-28 12:42:32,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {48572#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48572#(< ~counter~0 43)} is VALID [2022-04-28 12:42:32,525 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {48058#true} {48572#(< ~counter~0 43)} #98#return; {48572#(< ~counter~0 43)} is VALID [2022-04-28 12:42:32,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,525 INFO L272 TraceCheckUtils]: 35: Hoare triple {48572#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {48572#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {48572#(< ~counter~0 43)} is VALID [2022-04-28 12:42:32,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {48597#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48572#(< ~counter~0 43)} is VALID [2022-04-28 12:42:32,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {48597#(< ~counter~0 42)} assume !(~r~0 > 0); {48597#(< ~counter~0 42)} is VALID [2022-04-28 12:42:32,526 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {48058#true} {48597#(< ~counter~0 42)} #96#return; {48597#(< ~counter~0 42)} is VALID [2022-04-28 12:42:32,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,526 INFO L272 TraceCheckUtils]: 27: Hoare triple {48597#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {48597#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {48597#(< ~counter~0 42)} is VALID [2022-04-28 12:42:32,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {48622#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48597#(< ~counter~0 42)} is VALID [2022-04-28 12:42:32,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {48622#(< ~counter~0 41)} assume !!(0 != ~r~0); {48622#(< ~counter~0 41)} is VALID [2022-04-28 12:42:32,527 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {48058#true} {48622#(< ~counter~0 41)} #94#return; {48622#(< ~counter~0 41)} is VALID [2022-04-28 12:42:32,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,528 INFO L272 TraceCheckUtils]: 19: Hoare triple {48622#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {48622#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {48622#(< ~counter~0 41)} is VALID [2022-04-28 12:42:32,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {48647#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48622#(< ~counter~0 41)} is VALID [2022-04-28 12:42:32,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {48647#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48647#(< ~counter~0 40)} is VALID [2022-04-28 12:42:32,529 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48058#true} {48647#(< ~counter~0 40)} #92#return; {48647#(< ~counter~0 40)} is VALID [2022-04-28 12:42:32,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,529 INFO L272 TraceCheckUtils]: 11: Hoare triple {48647#(< ~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)); {48058#true} is VALID [2022-04-28 12:42:32,529 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48058#true} {48647#(< ~counter~0 40)} #90#return; {48647#(< ~counter~0 40)} is VALID [2022-04-28 12:42:32,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {48058#true} assume true; {48058#true} is VALID [2022-04-28 12:42:32,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {48058#true} assume !(0 == ~cond); {48058#true} is VALID [2022-04-28 12:42:32,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {48058#true} ~cond := #in~cond; {48058#true} is VALID [2022-04-28 12:42:32,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {48647#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {48058#true} is VALID [2022-04-28 12:42:32,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {48647#(< ~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; {48647#(< ~counter~0 40)} is VALID [2022-04-28 12:42:32,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {48647#(< ~counter~0 40)} call #t~ret9 := main(); {48647#(< ~counter~0 40)} is VALID [2022-04-28 12:42:32,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48647#(< ~counter~0 40)} {48058#true} #102#return; {48647#(< ~counter~0 40)} is VALID [2022-04-28 12:42:32,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {48647#(< ~counter~0 40)} assume true; {48647#(< ~counter~0 40)} is VALID [2022-04-28 12:42:32,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {48058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {48647#(< ~counter~0 40)} is VALID [2022-04-28 12:42:32,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {48058#true} call ULTIMATE.init(); {48058#true} is VALID [2022-04-28 12:42:32,531 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-28 12:42:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:32,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68860716] [2022-04-28 12:42:32,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:32,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319675319] [2022-04-28 12:42:32,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319675319] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:42:32,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:42:32,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 12:42:32,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:32,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896906059] [2022-04-28 12:42:32,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896906059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:32,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:32,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 12:42:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627606481] [2022-04-28 12:42:32,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:32,533 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-28 12:42:32,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:32,533 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-28 12:42:32,585 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-28 12:42:32,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 12:42:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 12:42:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:42:32,585 INFO L87 Difference]: Start difference. First operand 388 states and 498 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-28 12:42:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:33,444 INFO L93 Difference]: Finished difference Result 435 states and 559 transitions. [2022-04-28 12:42:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 12:42:33,444 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-28 12:42:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:33,457 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-28 12:42:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-28 12:42:33,458 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-28 12:42:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-28 12:42:33,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-28 12:42:33,628 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-28 12:42:33,636 INFO L225 Difference]: With dead ends: 435 [2022-04-28 12:42:33,636 INFO L226 Difference]: Without dead ends: 424 [2022-04-28 12:42:33,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=438, Invalid=618, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 12:42:33,637 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 124 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:33,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 266 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:42:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-04-28 12:42:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 405. [2022-04-28 12:42:34,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:34,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand has 405 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 309 states have internal predecessors, (360), 82 states have call successors, (82), 22 states have call predecessors, (82), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 12:42:34,146 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand has 405 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 309 states have internal predecessors, (360), 82 states have call successors, (82), 22 states have call predecessors, (82), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 12:42:34,146 INFO L87 Difference]: Start difference. First operand 424 states. Second operand has 405 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 309 states have internal predecessors, (360), 82 states have call successors, (82), 22 states have call predecessors, (82), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 12:42:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:34,153 INFO L93 Difference]: Finished difference Result 424 states and 544 transitions. [2022-04-28 12:42:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 544 transitions. [2022-04-28 12:42:34,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:34,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:34,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 405 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 309 states have internal predecessors, (360), 82 states have call successors, (82), 22 states have call predecessors, (82), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 424 states. [2022-04-28 12:42:34,155 INFO L87 Difference]: Start difference. First operand has 405 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 309 states have internal predecessors, (360), 82 states have call successors, (82), 22 states have call predecessors, (82), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 424 states. [2022-04-28 12:42:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:34,162 INFO L93 Difference]: Finished difference Result 424 states and 544 transitions. [2022-04-28 12:42:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 544 transitions. [2022-04-28 12:42:34,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:34,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:34,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:34,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 302 states have (on average 1.1920529801324504) internal successors, (360), 309 states have internal predecessors, (360), 82 states have call successors, (82), 22 states have call predecessors, (82), 20 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 12:42:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 522 transitions. [2022-04-28 12:42:34,171 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 522 transitions. Word has length 103 [2022-04-28 12:42:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:34,171 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 522 transitions. [2022-04-28 12:42:34,171 INFO L496 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-28 12:42:34,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 405 states and 522 transitions. [2022-04-28 12:42:52,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 516 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 522 transitions. [2022-04-28 12:42:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 12:42:52,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:42:52,377 INFO L195 NwaCegarLoop]: 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-28 12:42:52,393 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-28 12:42:52,577 WARN L477 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-28 12:42:52,577 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:42:52,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:42:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-28 12:42:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:52,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [154216898] [2022-04-28 12:42:52,578 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:42:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-28 12:42:52,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:42:52,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868886643] [2022-04-28 12:42:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:42:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:42:52,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:42:52,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773610113] [2022-04-28 12:42:52,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:42:52,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:42:52,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:42:52,607 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-28 12:42:52,608 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-28 12:42:52,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:42:52,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:42:52,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:42:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:42:52,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:42:53,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {51243#true} call ULTIMATE.init(); {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {51243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51243#true} {51243#true} #102#return; {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {51243#true} call #t~ret9 := main(); {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {51243#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; {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {51243#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51243#true} {51243#true} #90#return; {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L272 TraceCheckUtils]: 11: Hoare triple {51243#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)); {51243#true} is VALID [2022-04-28 12:42:53,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51243#true} {51243#true} #92#return; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {51243#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {51243#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {51243#true} assume !!(#t~post6 < 50);havoc #t~post6; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L272 TraceCheckUtils]: 19: Hoare triple {51243#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)); {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51243#true} {51243#true} #94#return; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {51243#true} assume !!(0 != ~r~0); {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {51243#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {51243#true} assume !!(#t~post7 < 50);havoc #t~post7; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L272 TraceCheckUtils]: 27: Hoare triple {51243#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)); {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,423 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51243#true} {51243#true} #96#return; {51243#true} is VALID [2022-04-28 12:42:53,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {51243#true} assume !(~r~0 > 0); {51243#true} is VALID [2022-04-28 12:42:53,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {51243#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51243#true} is VALID [2022-04-28 12:42:53,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {51243#true} assume !!(#t~post8 < 50);havoc #t~post8; {51243#true} is VALID [2022-04-28 12:42:53,424 INFO L272 TraceCheckUtils]: 35: Hoare triple {51243#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)); {51243#true} is VALID [2022-04-28 12:42:53,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,424 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51243#true} {51243#true} #98#return; {51243#true} is VALID [2022-04-28 12:42:53,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {51243#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,426 INFO L272 TraceCheckUtils]: 43: Hoare triple {51368#(< (+ 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)); {51243#true} is VALID [2022-04-28 12:42:53,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,426 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51243#true} {51368#(< (+ main_~r~0 2) main_~u~0)} #98#return; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,427 INFO L272 TraceCheckUtils]: 51: Hoare triple {51368#(< (+ 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)); {51243#true} is VALID [2022-04-28 12:42:53,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,428 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51243#true} {51368#(< (+ main_~r~0 2) main_~u~0)} #94#return; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,429 INFO L272 TraceCheckUtils]: 59: Hoare triple {51368#(< (+ 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)); {51243#true} is VALID [2022-04-28 12:42:53,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,430 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51243#true} {51368#(< (+ main_~r~0 2) main_~u~0)} #96#return; {51368#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 12:42:53,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {51368#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51441#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 12:42:53,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {51441#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51441#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 12:42:53,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {51441#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {51441#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 12:42:53,431 INFO L272 TraceCheckUtils]: 67: Hoare triple {51441#(< (+ 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)); {51243#true} is VALID [2022-04-28 12:42:53,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,431 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51243#true} {51441#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {51441#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 12:42:53,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {51441#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:42:53,432 INFO L290 TraceCheckUtils]: 73: Hoare triple {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:42:53,432 INFO L290 TraceCheckUtils]: 74: Hoare triple {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:42:53,433 INFO L272 TraceCheckUtils]: 75: Hoare triple {51466#(< 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)); {51243#true} is VALID [2022-04-28 12:42:53,433 INFO L290 TraceCheckUtils]: 76: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,433 INFO L290 TraceCheckUtils]: 77: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,433 INFO L290 TraceCheckUtils]: 78: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,433 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51243#true} {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:42:53,433 INFO L290 TraceCheckUtils]: 80: Hoare triple {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:42:53,434 INFO L290 TraceCheckUtils]: 81: Hoare triple {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:42:53,434 INFO L290 TraceCheckUtils]: 82: Hoare triple {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:42:53,434 INFO L272 TraceCheckUtils]: 83: Hoare triple {51466#(< 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)); {51243#true} is VALID [2022-04-28 12:42:53,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,435 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51243#true} {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {51466#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:42:53,435 INFO L290 TraceCheckUtils]: 88: Hoare triple {51466#(< 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; {51515#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 12:42:53,436 INFO L290 TraceCheckUtils]: 89: Hoare triple {51515#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51515#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 12:42:53,436 INFO L290 TraceCheckUtils]: 90: Hoare triple {51515#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {51515#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 12:42:53,436 INFO L272 TraceCheckUtils]: 91: Hoare triple {51515#(< 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)); {51243#true} is VALID [2022-04-28 12:42:53,436 INFO L290 TraceCheckUtils]: 92: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,436 INFO L290 TraceCheckUtils]: 93: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,436 INFO L290 TraceCheckUtils]: 94: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,437 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51243#true} {51515#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {51515#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 12:42:53,437 INFO L290 TraceCheckUtils]: 96: Hoare triple {51515#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51244#false} is VALID [2022-04-28 12:42:53,437 INFO L290 TraceCheckUtils]: 97: Hoare triple {51244#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51244#false} is VALID [2022-04-28 12:42:53,437 INFO L290 TraceCheckUtils]: 98: Hoare triple {51244#false} assume !(#t~post8 < 50);havoc #t~post8; {51244#false} is VALID [2022-04-28 12:42:53,437 INFO L290 TraceCheckUtils]: 99: Hoare triple {51244#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51244#false} is VALID [2022-04-28 12:42:53,437 INFO L290 TraceCheckUtils]: 100: Hoare triple {51244#false} assume !(#t~post6 < 50);havoc #t~post6; {51244#false} is VALID [2022-04-28 12:42:53,437 INFO L272 TraceCheckUtils]: 101: Hoare triple {51244#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51244#false} is VALID [2022-04-28 12:42:53,438 INFO L290 TraceCheckUtils]: 102: Hoare triple {51244#false} ~cond := #in~cond; {51244#false} is VALID [2022-04-28 12:42:53,438 INFO L290 TraceCheckUtils]: 103: Hoare triple {51244#false} assume 0 == ~cond; {51244#false} is VALID [2022-04-28 12:42:53,438 INFO L290 TraceCheckUtils]: 104: Hoare triple {51244#false} assume !false; {51244#false} is VALID [2022-04-28 12:42:53,438 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-28 12:42:53,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:42:53,788 INFO L290 TraceCheckUtils]: 104: Hoare triple {51244#false} assume !false; {51244#false} is VALID [2022-04-28 12:42:53,789 INFO L290 TraceCheckUtils]: 103: Hoare triple {51244#false} assume 0 == ~cond; {51244#false} is VALID [2022-04-28 12:42:53,789 INFO L290 TraceCheckUtils]: 102: Hoare triple {51244#false} ~cond := #in~cond; {51244#false} is VALID [2022-04-28 12:42:53,789 INFO L272 TraceCheckUtils]: 101: Hoare triple {51244#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51244#false} is VALID [2022-04-28 12:42:53,789 INFO L290 TraceCheckUtils]: 100: Hoare triple {51244#false} assume !(#t~post6 < 50);havoc #t~post6; {51244#false} is VALID [2022-04-28 12:42:53,789 INFO L290 TraceCheckUtils]: 99: Hoare triple {51244#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51244#false} is VALID [2022-04-28 12:42:53,789 INFO L290 TraceCheckUtils]: 98: Hoare triple {51244#false} assume !(#t~post8 < 50);havoc #t~post8; {51244#false} is VALID [2022-04-28 12:42:53,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {51244#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51244#false} is VALID [2022-04-28 12:42:53,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {51588#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51244#false} is VALID [2022-04-28 12:42:53,790 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51243#true} {51588#(not (< main_~r~0 0))} #98#return; {51588#(not (< main_~r~0 0))} is VALID [2022-04-28 12:42:53,790 INFO L290 TraceCheckUtils]: 94: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,790 INFO L290 TraceCheckUtils]: 93: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,790 INFO L290 TraceCheckUtils]: 92: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,790 INFO L272 TraceCheckUtils]: 91: Hoare triple {51588#(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)); {51243#true} is VALID [2022-04-28 12:42:53,790 INFO L290 TraceCheckUtils]: 90: Hoare triple {51588#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {51588#(not (< main_~r~0 0))} is VALID [2022-04-28 12:42:53,790 INFO L290 TraceCheckUtils]: 89: Hoare triple {51588#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51588#(not (< main_~r~0 0))} is VALID [2022-04-28 12:42:53,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {51613#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51588#(not (< main_~r~0 0))} is VALID [2022-04-28 12:42:53,791 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51243#true} {51613#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {51613#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:42:53,791 INFO L290 TraceCheckUtils]: 86: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,791 INFO L290 TraceCheckUtils]: 85: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,791 INFO L290 TraceCheckUtils]: 84: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,791 INFO L272 TraceCheckUtils]: 83: Hoare triple {51613#(<= 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)); {51243#true} is VALID [2022-04-28 12:42:53,792 INFO L290 TraceCheckUtils]: 82: Hoare triple {51613#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {51613#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:42:53,792 INFO L290 TraceCheckUtils]: 81: Hoare triple {51613#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51613#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:42:53,792 INFO L290 TraceCheckUtils]: 80: Hoare triple {51613#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {51613#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:42:53,793 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51243#true} {51613#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {51613#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:42:53,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,793 INFO L290 TraceCheckUtils]: 76: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,793 INFO L272 TraceCheckUtils]: 75: Hoare triple {51613#(<= 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)); {51243#true} is VALID [2022-04-28 12:42:53,793 INFO L290 TraceCheckUtils]: 74: Hoare triple {51613#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {51613#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:42:53,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {51613#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51613#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:42:53,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {51662#(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; {51613#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:42:53,794 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51243#true} {51662#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {51662#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:42:53,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,795 INFO L272 TraceCheckUtils]: 67: Hoare triple {51662#(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)); {51243#true} is VALID [2022-04-28 12:42:53,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {51662#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {51662#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:42:53,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {51662#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51662#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:42:53,796 INFO L290 TraceCheckUtils]: 64: Hoare triple {51687#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51662#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:42:53,797 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51243#true} {51687#(<= main_~r~0 main_~u~0)} #96#return; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,797 INFO L272 TraceCheckUtils]: 59: Hoare triple {51687#(<= 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)); {51243#true} is VALID [2022-04-28 12:42:53,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {51687#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {51687#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {51687#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,798 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51243#true} {51687#(<= main_~r~0 main_~u~0)} #94#return; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,798 INFO L272 TraceCheckUtils]: 51: Hoare triple {51687#(<= 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)); {51243#true} is VALID [2022-04-28 12:42:53,799 INFO L290 TraceCheckUtils]: 50: Hoare triple {51687#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {51687#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {51687#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,800 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51243#true} {51687#(<= main_~r~0 main_~u~0)} #98#return; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,800 INFO L272 TraceCheckUtils]: 43: Hoare triple {51687#(<= 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)); {51243#true} is VALID [2022-04-28 12:42:53,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {51687#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {51687#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {51243#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51687#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:42:53,801 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51243#true} {51243#true} #98#return; {51243#true} is VALID [2022-04-28 12:42:53,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,801 INFO L272 TraceCheckUtils]: 35: Hoare triple {51243#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)); {51243#true} is VALID [2022-04-28 12:42:53,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {51243#true} assume !!(#t~post8 < 50);havoc #t~post8; {51243#true} is VALID [2022-04-28 12:42:53,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {51243#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {51243#true} assume !(~r~0 > 0); {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51243#true} {51243#true} #96#return; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L272 TraceCheckUtils]: 27: Hoare triple {51243#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)); {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {51243#true} assume !!(#t~post7 < 50);havoc #t~post7; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {51243#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {51243#true} assume !!(0 != ~r~0); {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51243#true} {51243#true} #94#return; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L272 TraceCheckUtils]: 19: Hoare triple {51243#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)); {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {51243#true} assume !!(#t~post6 < 50);havoc #t~post6; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {51243#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {51243#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51243#true} {51243#true} #92#return; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L272 TraceCheckUtils]: 11: Hoare triple {51243#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)); {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51243#true} {51243#true} #90#return; {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {51243#true} assume !(0 == ~cond); {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {51243#true} ~cond := #in~cond; {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {51243#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {51243#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; {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {51243#true} call #t~ret9 := main(); {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51243#true} {51243#true} #102#return; {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {51243#true} assume true; {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {51243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51243#true} is VALID [2022-04-28 12:42:53,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {51243#true} call ULTIMATE.init(); {51243#true} is VALID [2022-04-28 12:42:53,803 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-28 12:42:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:42:53,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868886643] [2022-04-28 12:42:53,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:42:53,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773610113] [2022-04-28 12:42:53,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773610113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:42:53,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:42:53,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 12:42:53,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:42:53,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [154216898] [2022-04-28 12:42:53,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [154216898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:42:53,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:42:53,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:42:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690199648] [2022-04-28 12:42:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:42:53,805 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-28 12:42:53,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:42:53,805 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-28 12:42:53,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:42:53,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:42:53,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:42:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:42:53,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:42:53,865 INFO L87 Difference]: Start difference. First operand 405 states and 522 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-28 12:42:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:55,338 INFO L93 Difference]: Finished difference Result 677 states and 928 transitions. [2022-04-28 12:42:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:42:55,338 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-28 12:42:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:42:55,338 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-28 12:42:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-28 12:42:55,339 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-28 12:42:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-28 12:42:55,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-28 12:42:55,431 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-28 12:42:55,464 INFO L225 Difference]: With dead ends: 677 [2022-04-28 12:42:55,464 INFO L226 Difference]: Without dead ends: 616 [2022-04-28 12:42:55,465 INFO L412 NwaCegarLoop]: 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-28 12:42:55,465 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 36 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:42:55,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 283 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:42:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-04-28 12:42:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 532. [2022-04-28 12:42:56,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:42:56,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 532 states, 397 states have (on average 1.234256926952141) internal successors, (490), 407 states have internal predecessors, (490), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:42:56,291 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 532 states, 397 states have (on average 1.234256926952141) internal successors, (490), 407 states have internal predecessors, (490), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:42:56,291 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 532 states, 397 states have (on average 1.234256926952141) internal successors, (490), 407 states have internal predecessors, (490), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:42:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:56,305 INFO L93 Difference]: Finished difference Result 616 states and 837 transitions. [2022-04-28 12:42:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 837 transitions. [2022-04-28 12:42:56,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:56,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:56,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 397 states have (on average 1.234256926952141) internal successors, (490), 407 states have internal predecessors, (490), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 616 states. [2022-04-28 12:42:56,307 INFO L87 Difference]: Start difference. First operand has 532 states, 397 states have (on average 1.234256926952141) internal successors, (490), 407 states have internal predecessors, (490), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 616 states. [2022-04-28 12:42:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:42:56,321 INFO L93 Difference]: Finished difference Result 616 states and 837 transitions. [2022-04-28 12:42:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 837 transitions. [2022-04-28 12:42:56,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:42:56,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:42:56,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:42:56,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:42:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 397 states have (on average 1.234256926952141) internal successors, (490), 407 states have internal predecessors, (490), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:42:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 716 transitions. [2022-04-28 12:42:56,336 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 716 transitions. Word has length 105 [2022-04-28 12:42:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:42:56,336 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 716 transitions. [2022-04-28 12:42:56,336 INFO L496 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-28 12:42:56,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 532 states and 716 transitions. [2022-04-28 12:43:15,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 716 edges. 710 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 716 transitions. [2022-04-28 12:43:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 12:43:15,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:15,798 INFO L195 NwaCegarLoop]: 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-28 12:43:15,814 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-28 12:43:15,998 WARN L477 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-28 12:43:15,998 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-28 12:43:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:15,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303993728] [2022-04-28 12:43:15,999 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-28 12:43:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:15,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200986136] [2022-04-28 12:43:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:15,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:16,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:16,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546655268] [2022-04-28 12:43:16,010 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:43:16,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:16,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:16,011 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-28 12:43:16,011 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-28 12:43:16,126 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:43:16,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:16,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 12:43:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:16,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:43:16,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {55538#true} call ULTIMATE.init(); {55538#true} is VALID [2022-04-28 12:43:16,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {55538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {55546#(<= ~counter~0 0)} assume true; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55546#(<= ~counter~0 0)} {55538#true} #102#return; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {55546#(<= ~counter~0 0)} call #t~ret9 := main(); {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {55546#(<= ~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; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,602 INFO L272 TraceCheckUtils]: 6: Hoare triple {55546#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {55546#(<= ~counter~0 0)} ~cond := #in~cond; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {55546#(<= ~counter~0 0)} assume !(0 == ~cond); {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {55546#(<= ~counter~0 0)} assume true; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55546#(<= ~counter~0 0)} {55546#(<= ~counter~0 0)} #90#return; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,604 INFO L272 TraceCheckUtils]: 11: Hoare triple {55546#(<= ~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)); {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {55546#(<= ~counter~0 0)} ~cond := #in~cond; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {55546#(<= ~counter~0 0)} assume !(0 == ~cond); {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {55546#(<= ~counter~0 0)} assume true; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,605 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55546#(<= ~counter~0 0)} {55546#(<= ~counter~0 0)} #92#return; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {55546#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {55546#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:16,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {55546#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {55595#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:16,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {55595#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {55595#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:16,607 INFO L272 TraceCheckUtils]: 19: Hoare triple {55595#(<= ~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)); {55595#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:16,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {55595#(<= ~counter~0 1)} ~cond := #in~cond; {55595#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:16,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {55595#(<= ~counter~0 1)} assume !(0 == ~cond); {55595#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:16,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {55595#(<= ~counter~0 1)} assume true; {55595#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:16,608 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55595#(<= ~counter~0 1)} {55595#(<= ~counter~0 1)} #94#return; {55595#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:16,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {55595#(<= ~counter~0 1)} assume !!(0 != ~r~0); {55595#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:16,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {55595#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55620#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:16,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {55620#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {55620#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:16,634 INFO L272 TraceCheckUtils]: 27: Hoare triple {55620#(<= ~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)); {55620#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:16,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {55620#(<= ~counter~0 2)} ~cond := #in~cond; {55620#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:16,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {55620#(<= ~counter~0 2)} assume !(0 == ~cond); {55620#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:16,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {55620#(<= ~counter~0 2)} assume true; {55620#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:16,635 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {55620#(<= ~counter~0 2)} {55620#(<= ~counter~0 2)} #96#return; {55620#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:16,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {55620#(<= ~counter~0 2)} assume !(~r~0 > 0); {55620#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:16,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {55620#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55645#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:16,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {55645#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {55645#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:16,636 INFO L272 TraceCheckUtils]: 35: Hoare triple {55645#(<= ~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)); {55645#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:16,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {55645#(<= ~counter~0 3)} ~cond := #in~cond; {55645#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:16,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {55645#(<= ~counter~0 3)} assume !(0 == ~cond); {55645#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:16,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {55645#(<= ~counter~0 3)} assume true; {55645#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:16,637 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55645#(<= ~counter~0 3)} {55645#(<= ~counter~0 3)} #98#return; {55645#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:16,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {55645#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {55645#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:16,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {55645#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55670#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:16,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {55670#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {55670#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:16,638 INFO L272 TraceCheckUtils]: 43: Hoare triple {55670#(<= ~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)); {55670#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:16,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {55670#(<= ~counter~0 4)} ~cond := #in~cond; {55670#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:16,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {55670#(<= ~counter~0 4)} assume !(0 == ~cond); {55670#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:16,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {55670#(<= ~counter~0 4)} assume true; {55670#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:16,639 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55670#(<= ~counter~0 4)} {55670#(<= ~counter~0 4)} #98#return; {55670#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:16,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {55670#(<= ~counter~0 4)} assume !(~r~0 < 0); {55670#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:16,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {55670#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {55695#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:16,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {55695#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {55695#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:16,640 INFO L272 TraceCheckUtils]: 51: Hoare triple {55695#(<= ~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)); {55695#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:16,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {55695#(<= ~counter~0 5)} ~cond := #in~cond; {55695#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:16,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {55695#(<= ~counter~0 5)} assume !(0 == ~cond); {55695#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:16,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {55695#(<= ~counter~0 5)} assume true; {55695#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:16,641 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {55695#(<= ~counter~0 5)} {55695#(<= ~counter~0 5)} #94#return; {55695#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:16,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {55695#(<= ~counter~0 5)} assume !!(0 != ~r~0); {55695#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:16,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {55695#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55720#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:16,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {55720#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {55720#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:16,642 INFO L272 TraceCheckUtils]: 59: Hoare triple {55720#(<= ~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)); {55720#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:16,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {55720#(<= ~counter~0 6)} ~cond := #in~cond; {55720#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:16,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {55720#(<= ~counter~0 6)} assume !(0 == ~cond); {55720#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:16,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {55720#(<= ~counter~0 6)} assume true; {55720#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:16,643 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {55720#(<= ~counter~0 6)} {55720#(<= ~counter~0 6)} #96#return; {55720#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:16,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {55720#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {55720#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:16,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {55720#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55745#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:16,644 INFO L290 TraceCheckUtils]: 66: Hoare triple {55745#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {55745#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:16,657 INFO L272 TraceCheckUtils]: 67: Hoare triple {55745#(<= ~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)); {55745#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:16,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {55745#(<= ~counter~0 7)} ~cond := #in~cond; {55745#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:16,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {55745#(<= ~counter~0 7)} assume !(0 == ~cond); {55745#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:16,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {55745#(<= ~counter~0 7)} assume true; {55745#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:16,658 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {55745#(<= ~counter~0 7)} {55745#(<= ~counter~0 7)} #96#return; {55745#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:16,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {55745#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {55745#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:16,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {55745#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55770#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:16,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {55770#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {55770#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:16,659 INFO L272 TraceCheckUtils]: 75: Hoare triple {55770#(<= ~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)); {55770#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:16,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {55770#(<= ~counter~0 8)} ~cond := #in~cond; {55770#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:16,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {55770#(<= ~counter~0 8)} assume !(0 == ~cond); {55770#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:16,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {55770#(<= ~counter~0 8)} assume true; {55770#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:16,660 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {55770#(<= ~counter~0 8)} {55770#(<= ~counter~0 8)} #96#return; {55770#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:16,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {55770#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {55770#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:16,661 INFO L290 TraceCheckUtils]: 81: Hoare triple {55770#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55795#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:16,661 INFO L290 TraceCheckUtils]: 82: Hoare triple {55795#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {55795#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:16,661 INFO L272 TraceCheckUtils]: 83: Hoare triple {55795#(<= ~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)); {55795#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:16,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {55795#(<= ~counter~0 9)} ~cond := #in~cond; {55795#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:16,662 INFO L290 TraceCheckUtils]: 85: Hoare triple {55795#(<= ~counter~0 9)} assume !(0 == ~cond); {55795#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:16,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {55795#(<= ~counter~0 9)} assume true; {55795#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:16,662 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {55795#(<= ~counter~0 9)} {55795#(<= ~counter~0 9)} #96#return; {55795#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:16,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {55795#(<= ~counter~0 9)} assume !(~r~0 > 0); {55795#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:16,663 INFO L290 TraceCheckUtils]: 89: Hoare triple {55795#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55820#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:16,663 INFO L290 TraceCheckUtils]: 90: Hoare triple {55820#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {55820#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:16,663 INFO L272 TraceCheckUtils]: 91: Hoare triple {55820#(<= ~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)); {55820#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:16,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {55820#(<= ~counter~0 10)} ~cond := #in~cond; {55820#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:16,664 INFO L290 TraceCheckUtils]: 93: Hoare triple {55820#(<= ~counter~0 10)} assume !(0 == ~cond); {55820#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:16,664 INFO L290 TraceCheckUtils]: 94: Hoare triple {55820#(<= ~counter~0 10)} assume true; {55820#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:16,664 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {55820#(<= ~counter~0 10)} {55820#(<= ~counter~0 10)} #98#return; {55820#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:16,664 INFO L290 TraceCheckUtils]: 96: Hoare triple {55820#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {55820#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:16,664 INFO L290 TraceCheckUtils]: 97: Hoare triple {55820#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55845#(<= |main_#t~post8| 10)} is VALID [2022-04-28 12:43:16,665 INFO L290 TraceCheckUtils]: 98: Hoare triple {55845#(<= |main_#t~post8| 10)} assume !(#t~post8 < 50);havoc #t~post8; {55539#false} is VALID [2022-04-28 12:43:16,665 INFO L290 TraceCheckUtils]: 99: Hoare triple {55539#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {55539#false} is VALID [2022-04-28 12:43:16,665 INFO L290 TraceCheckUtils]: 100: Hoare triple {55539#false} assume !(#t~post6 < 50);havoc #t~post6; {55539#false} is VALID [2022-04-28 12:43:16,665 INFO L272 TraceCheckUtils]: 101: Hoare triple {55539#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55539#false} is VALID [2022-04-28 12:43:16,665 INFO L290 TraceCheckUtils]: 102: Hoare triple {55539#false} ~cond := #in~cond; {55539#false} is VALID [2022-04-28 12:43:16,665 INFO L290 TraceCheckUtils]: 103: Hoare triple {55539#false} assume 0 == ~cond; {55539#false} is VALID [2022-04-28 12:43:16,665 INFO L290 TraceCheckUtils]: 104: Hoare triple {55539#false} assume !false; {55539#false} is VALID [2022-04-28 12:43:16,665 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-28 12:43:16,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:43:17,203 INFO L290 TraceCheckUtils]: 104: Hoare triple {55539#false} assume !false; {55539#false} is VALID [2022-04-28 12:43:17,203 INFO L290 TraceCheckUtils]: 103: Hoare triple {55539#false} assume 0 == ~cond; {55539#false} is VALID [2022-04-28 12:43:17,203 INFO L290 TraceCheckUtils]: 102: Hoare triple {55539#false} ~cond := #in~cond; {55539#false} is VALID [2022-04-28 12:43:17,203 INFO L272 TraceCheckUtils]: 101: Hoare triple {55539#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55539#false} is VALID [2022-04-28 12:43:17,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {55539#false} assume !(#t~post6 < 50);havoc #t~post6; {55539#false} is VALID [2022-04-28 12:43:17,203 INFO L290 TraceCheckUtils]: 99: Hoare triple {55539#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {55539#false} is VALID [2022-04-28 12:43:17,204 INFO L290 TraceCheckUtils]: 98: Hoare triple {55885#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {55539#false} is VALID [2022-04-28 12:43:17,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {55889#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55885#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:43:17,204 INFO L290 TraceCheckUtils]: 96: Hoare triple {55889#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {55889#(< ~counter~0 50)} is VALID [2022-04-28 12:43:17,205 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {55538#true} {55889#(< ~counter~0 50)} #98#return; {55889#(< ~counter~0 50)} is VALID [2022-04-28 12:43:17,205 INFO L290 TraceCheckUtils]: 94: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,205 INFO L290 TraceCheckUtils]: 93: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,205 INFO L290 TraceCheckUtils]: 92: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,205 INFO L272 TraceCheckUtils]: 91: Hoare triple {55889#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,205 INFO L290 TraceCheckUtils]: 90: Hoare triple {55889#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {55889#(< ~counter~0 50)} is VALID [2022-04-28 12:43:17,206 INFO L290 TraceCheckUtils]: 89: Hoare triple {55914#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55889#(< ~counter~0 50)} is VALID [2022-04-28 12:43:17,207 INFO L290 TraceCheckUtils]: 88: Hoare triple {55914#(< ~counter~0 49)} assume !(~r~0 > 0); {55914#(< ~counter~0 49)} is VALID [2022-04-28 12:43:17,207 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {55538#true} {55914#(< ~counter~0 49)} #96#return; {55914#(< ~counter~0 49)} is VALID [2022-04-28 12:43:17,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,207 INFO L290 TraceCheckUtils]: 85: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,207 INFO L290 TraceCheckUtils]: 84: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,207 INFO L272 TraceCheckUtils]: 83: Hoare triple {55914#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,208 INFO L290 TraceCheckUtils]: 82: Hoare triple {55914#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {55914#(< ~counter~0 49)} is VALID [2022-04-28 12:43:17,208 INFO L290 TraceCheckUtils]: 81: Hoare triple {55939#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55914#(< ~counter~0 49)} is VALID [2022-04-28 12:43:17,209 INFO L290 TraceCheckUtils]: 80: Hoare triple {55939#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {55939#(< ~counter~0 48)} is VALID [2022-04-28 12:43:17,209 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {55538#true} {55939#(< ~counter~0 48)} #96#return; {55939#(< ~counter~0 48)} is VALID [2022-04-28 12:43:17,209 INFO L290 TraceCheckUtils]: 78: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,209 INFO L290 TraceCheckUtils]: 77: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,209 INFO L272 TraceCheckUtils]: 75: Hoare triple {55939#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,209 INFO L290 TraceCheckUtils]: 74: Hoare triple {55939#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {55939#(< ~counter~0 48)} is VALID [2022-04-28 12:43:17,210 INFO L290 TraceCheckUtils]: 73: Hoare triple {55964#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55939#(< ~counter~0 48)} is VALID [2022-04-28 12:43:17,210 INFO L290 TraceCheckUtils]: 72: Hoare triple {55964#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {55964#(< ~counter~0 47)} is VALID [2022-04-28 12:43:17,211 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {55538#true} {55964#(< ~counter~0 47)} #96#return; {55964#(< ~counter~0 47)} is VALID [2022-04-28 12:43:17,211 INFO L290 TraceCheckUtils]: 70: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,211 INFO L290 TraceCheckUtils]: 68: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,211 INFO L272 TraceCheckUtils]: 67: Hoare triple {55964#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {55964#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {55964#(< ~counter~0 47)} is VALID [2022-04-28 12:43:17,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {55989#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55964#(< ~counter~0 47)} is VALID [2022-04-28 12:43:17,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {55989#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {55989#(< ~counter~0 46)} is VALID [2022-04-28 12:43:17,213 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {55538#true} {55989#(< ~counter~0 46)} #96#return; {55989#(< ~counter~0 46)} is VALID [2022-04-28 12:43:17,213 INFO L290 TraceCheckUtils]: 62: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,213 INFO L272 TraceCheckUtils]: 59: Hoare triple {55989#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,213 INFO L290 TraceCheckUtils]: 58: Hoare triple {55989#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {55989#(< ~counter~0 46)} is VALID [2022-04-28 12:43:17,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {56014#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55989#(< ~counter~0 46)} is VALID [2022-04-28 12:43:17,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {56014#(< ~counter~0 45)} assume !!(0 != ~r~0); {56014#(< ~counter~0 45)} is VALID [2022-04-28 12:43:17,214 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {55538#true} {56014#(< ~counter~0 45)} #94#return; {56014#(< ~counter~0 45)} is VALID [2022-04-28 12:43:17,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,215 INFO L272 TraceCheckUtils]: 51: Hoare triple {56014#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {56014#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {56014#(< ~counter~0 45)} is VALID [2022-04-28 12:43:17,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {56039#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56014#(< ~counter~0 45)} is VALID [2022-04-28 12:43:17,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {56039#(< ~counter~0 44)} assume !(~r~0 < 0); {56039#(< ~counter~0 44)} is VALID [2022-04-28 12:43:17,216 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55538#true} {56039#(< ~counter~0 44)} #98#return; {56039#(< ~counter~0 44)} is VALID [2022-04-28 12:43:17,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,216 INFO L272 TraceCheckUtils]: 43: Hoare triple {56039#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {56039#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {56039#(< ~counter~0 44)} is VALID [2022-04-28 12:43:17,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {56064#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56039#(< ~counter~0 44)} is VALID [2022-04-28 12:43:17,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {56064#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56064#(< ~counter~0 43)} is VALID [2022-04-28 12:43:17,218 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55538#true} {56064#(< ~counter~0 43)} #98#return; {56064#(< ~counter~0 43)} is VALID [2022-04-28 12:43:17,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,218 INFO L272 TraceCheckUtils]: 35: Hoare triple {56064#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {56064#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {56064#(< ~counter~0 43)} is VALID [2022-04-28 12:43:17,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {56089#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56064#(< ~counter~0 43)} is VALID [2022-04-28 12:43:17,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {56089#(< ~counter~0 42)} assume !(~r~0 > 0); {56089#(< ~counter~0 42)} is VALID [2022-04-28 12:43:17,220 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {55538#true} {56089#(< ~counter~0 42)} #96#return; {56089#(< ~counter~0 42)} is VALID [2022-04-28 12:43:17,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,220 INFO L272 TraceCheckUtils]: 27: Hoare triple {56089#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {56089#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {56089#(< ~counter~0 42)} is VALID [2022-04-28 12:43:17,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {56114#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56089#(< ~counter~0 42)} is VALID [2022-04-28 12:43:17,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {56114#(< ~counter~0 41)} assume !!(0 != ~r~0); {56114#(< ~counter~0 41)} is VALID [2022-04-28 12:43:17,222 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55538#true} {56114#(< ~counter~0 41)} #94#return; {56114#(< ~counter~0 41)} is VALID [2022-04-28 12:43:17,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,222 INFO L272 TraceCheckUtils]: 19: Hoare triple {56114#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {56114#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {56114#(< ~counter~0 41)} is VALID [2022-04-28 12:43:17,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {56139#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56114#(< ~counter~0 41)} is VALID [2022-04-28 12:43:17,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {56139#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56139#(< ~counter~0 40)} is VALID [2022-04-28 12:43:17,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55538#true} {56139#(< ~counter~0 40)} #92#return; {56139#(< ~counter~0 40)} is VALID [2022-04-28 12:43:17,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,224 INFO L272 TraceCheckUtils]: 11: Hoare triple {56139#(< ~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)); {55538#true} is VALID [2022-04-28 12:43:17,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55538#true} {56139#(< ~counter~0 40)} #90#return; {56139#(< ~counter~0 40)} is VALID [2022-04-28 12:43:17,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {55538#true} assume true; {55538#true} is VALID [2022-04-28 12:43:17,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {55538#true} assume !(0 == ~cond); {55538#true} is VALID [2022-04-28 12:43:17,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {55538#true} ~cond := #in~cond; {55538#true} is VALID [2022-04-28 12:43:17,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {56139#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55538#true} is VALID [2022-04-28 12:43:17,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {56139#(< ~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; {56139#(< ~counter~0 40)} is VALID [2022-04-28 12:43:17,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {56139#(< ~counter~0 40)} call #t~ret9 := main(); {56139#(< ~counter~0 40)} is VALID [2022-04-28 12:43:17,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56139#(< ~counter~0 40)} {55538#true} #102#return; {56139#(< ~counter~0 40)} is VALID [2022-04-28 12:43:17,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {56139#(< ~counter~0 40)} assume true; {56139#(< ~counter~0 40)} is VALID [2022-04-28 12:43:17,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {55538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56139#(< ~counter~0 40)} is VALID [2022-04-28 12:43:17,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {55538#true} call ULTIMATE.init(); {55538#true} is VALID [2022-04-28 12:43:17,226 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-28 12:43:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200986136] [2022-04-28 12:43:17,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546655268] [2022-04-28 12:43:17,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546655268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:43:17,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:43:17,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 12:43:17,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:17,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303993728] [2022-04-28 12:43:17,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303993728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:17,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:17,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 12:43:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385460215] [2022-04-28 12:43:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:17,227 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-28 12:43:17,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:17,233 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-28 12:43:17,282 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-28 12:43:17,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 12:43:17,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:17,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 12:43:17,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:43:17,282 INFO L87 Difference]: Start difference. First operand 532 states and 716 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-28 12:43:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:18,445 INFO L93 Difference]: Finished difference Result 785 states and 1097 transitions. [2022-04-28 12:43:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 12:43:18,445 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-28 12:43:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:18,446 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-28 12:43:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-28 12:43:18,447 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-28 12:43:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-28 12:43:18,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-28 12:43:18,578 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-28 12:43:18,591 INFO L225 Difference]: With dead ends: 785 [2022-04-28 12:43:18,591 INFO L226 Difference]: Without dead ends: 560 [2022-04-28 12:43:18,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=657, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 12:43:18,592 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 137 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:18,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 262 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:43:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-04-28 12:43:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 550. [2022-04-28 12:43:19,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:19,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 560 states. Second operand has 550 states, 415 states have (on average 1.2337349397590363) internal successors, (512), 419 states have internal predecessors, (512), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:43:19,447 INFO L74 IsIncluded]: Start isIncluded. First operand 560 states. Second operand has 550 states, 415 states have (on average 1.2337349397590363) internal successors, (512), 419 states have internal predecessors, (512), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:43:19,447 INFO L87 Difference]: Start difference. First operand 560 states. Second operand has 550 states, 415 states have (on average 1.2337349397590363) internal successors, (512), 419 states have internal predecessors, (512), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:43:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:19,459 INFO L93 Difference]: Finished difference Result 560 states and 748 transitions. [2022-04-28 12:43:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 748 transitions. [2022-04-28 12:43:19,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:19,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:19,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 550 states, 415 states have (on average 1.2337349397590363) internal successors, (512), 419 states have internal predecessors, (512), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 560 states. [2022-04-28 12:43:19,460 INFO L87 Difference]: Start difference. First operand has 550 states, 415 states have (on average 1.2337349397590363) internal successors, (512), 419 states have internal predecessors, (512), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 560 states. [2022-04-28 12:43:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:19,471 INFO L93 Difference]: Finished difference Result 560 states and 748 transitions. [2022-04-28 12:43:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 748 transitions. [2022-04-28 12:43:19,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:19,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:19,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:19,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 415 states have (on average 1.2337349397590363) internal successors, (512), 419 states have internal predecessors, (512), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:43:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 738 transitions. [2022-04-28 12:43:19,486 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 738 transitions. Word has length 105 [2022-04-28 12:43:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:19,486 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 738 transitions. [2022-04-28 12:43:19,487 INFO L496 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-28 12:43:19,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 550 states and 738 transitions. [2022-04-28 12:43:35,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 738 edges. 733 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 738 transitions. [2022-04-28 12:43:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 12:43:35,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:35,163 INFO L195 NwaCegarLoop]: 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-28 12:43:35,180 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-28 12:43:35,364 WARN L477 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-28 12:43:35,364 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:35,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:35,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-28 12:43:35,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:35,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116864390] [2022-04-28 12:43:35,365 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-28 12:43:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:35,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105006091] [2022-04-28 12:43:35,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:35,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:35,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:35,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613891295] [2022-04-28 12:43:35,398 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:43:35,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:35,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:35,407 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-28 12:43:35,409 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-28 12:43:35,526 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:43:35,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:35,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 12:43:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:35,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:43:36,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {59999#true} call ULTIMATE.init(); {59999#true} is VALID [2022-04-28 12:43:36,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {59999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {60007#(<= ~counter~0 0)} assume true; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60007#(<= ~counter~0 0)} {59999#true} #102#return; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {60007#(<= ~counter~0 0)} call #t~ret9 := main(); {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {60007#(<= ~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; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {60007#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {60007#(<= ~counter~0 0)} ~cond := #in~cond; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {60007#(<= ~counter~0 0)} assume !(0 == ~cond); {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {60007#(<= ~counter~0 0)} assume true; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60007#(<= ~counter~0 0)} {60007#(<= ~counter~0 0)} #90#return; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,045 INFO L272 TraceCheckUtils]: 11: Hoare triple {60007#(<= ~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)); {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {60007#(<= ~counter~0 0)} ~cond := #in~cond; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {60007#(<= ~counter~0 0)} assume !(0 == ~cond); {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {60007#(<= ~counter~0 0)} assume true; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,046 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60007#(<= ~counter~0 0)} {60007#(<= ~counter~0 0)} #92#return; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {60007#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60007#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:36,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {60007#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60056#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:36,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {60056#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {60056#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:36,049 INFO L272 TraceCheckUtils]: 19: Hoare triple {60056#(<= ~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)); {60056#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:36,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {60056#(<= ~counter~0 1)} ~cond := #in~cond; {60056#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:36,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {60056#(<= ~counter~0 1)} assume !(0 == ~cond); {60056#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:36,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {60056#(<= ~counter~0 1)} assume true; {60056#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:36,050 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60056#(<= ~counter~0 1)} {60056#(<= ~counter~0 1)} #94#return; {60056#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:36,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {60056#(<= ~counter~0 1)} assume !!(0 != ~r~0); {60056#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:36,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {60056#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60081#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:36,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {60081#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {60081#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:36,052 INFO L272 TraceCheckUtils]: 27: Hoare triple {60081#(<= ~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)); {60081#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:36,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {60081#(<= ~counter~0 2)} ~cond := #in~cond; {60081#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:36,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {60081#(<= ~counter~0 2)} assume !(0 == ~cond); {60081#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:36,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {60081#(<= ~counter~0 2)} assume true; {60081#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:36,053 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60081#(<= ~counter~0 2)} {60081#(<= ~counter~0 2)} #96#return; {60081#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:36,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {60081#(<= ~counter~0 2)} assume !(~r~0 > 0); {60081#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:36,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {60081#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60106#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:36,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {60106#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {60106#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:36,055 INFO L272 TraceCheckUtils]: 35: Hoare triple {60106#(<= ~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)); {60106#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:36,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {60106#(<= ~counter~0 3)} ~cond := #in~cond; {60106#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:36,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {60106#(<= ~counter~0 3)} assume !(0 == ~cond); {60106#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:36,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {60106#(<= ~counter~0 3)} assume true; {60106#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:36,056 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60106#(<= ~counter~0 3)} {60106#(<= ~counter~0 3)} #98#return; {60106#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:36,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {60106#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60106#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:36,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {60106#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60131#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:36,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {60131#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {60131#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:36,057 INFO L272 TraceCheckUtils]: 43: Hoare triple {60131#(<= ~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)); {60131#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:36,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {60131#(<= ~counter~0 4)} ~cond := #in~cond; {60131#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:36,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {60131#(<= ~counter~0 4)} assume !(0 == ~cond); {60131#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:36,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {60131#(<= ~counter~0 4)} assume true; {60131#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:36,059 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60131#(<= ~counter~0 4)} {60131#(<= ~counter~0 4)} #98#return; {60131#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:36,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {60131#(<= ~counter~0 4)} assume !(~r~0 < 0); {60131#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:36,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {60131#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60156#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:36,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {60156#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {60156#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:36,060 INFO L272 TraceCheckUtils]: 51: Hoare triple {60156#(<= ~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)); {60156#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:36,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {60156#(<= ~counter~0 5)} ~cond := #in~cond; {60156#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:36,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {60156#(<= ~counter~0 5)} assume !(0 == ~cond); {60156#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:36,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {60156#(<= ~counter~0 5)} assume true; {60156#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:36,061 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60156#(<= ~counter~0 5)} {60156#(<= ~counter~0 5)} #94#return; {60156#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:36,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {60156#(<= ~counter~0 5)} assume !!(0 != ~r~0); {60156#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:36,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {60156#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60181#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:36,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {60181#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {60181#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:36,063 INFO L272 TraceCheckUtils]: 59: Hoare triple {60181#(<= ~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)); {60181#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:36,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {60181#(<= ~counter~0 6)} ~cond := #in~cond; {60181#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:36,064 INFO L290 TraceCheckUtils]: 61: Hoare triple {60181#(<= ~counter~0 6)} assume !(0 == ~cond); {60181#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:36,064 INFO L290 TraceCheckUtils]: 62: Hoare triple {60181#(<= ~counter~0 6)} assume true; {60181#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:36,064 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60181#(<= ~counter~0 6)} {60181#(<= ~counter~0 6)} #96#return; {60181#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:36,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {60181#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60181#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:36,065 INFO L290 TraceCheckUtils]: 65: Hoare triple {60181#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60206#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:36,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {60206#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {60206#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:36,066 INFO L272 TraceCheckUtils]: 67: Hoare triple {60206#(<= ~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)); {60206#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:36,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {60206#(<= ~counter~0 7)} ~cond := #in~cond; {60206#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:36,066 INFO L290 TraceCheckUtils]: 69: Hoare triple {60206#(<= ~counter~0 7)} assume !(0 == ~cond); {60206#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:36,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {60206#(<= ~counter~0 7)} assume true; {60206#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:36,067 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60206#(<= ~counter~0 7)} {60206#(<= ~counter~0 7)} #96#return; {60206#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:36,067 INFO L290 TraceCheckUtils]: 72: Hoare triple {60206#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60206#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:36,068 INFO L290 TraceCheckUtils]: 73: Hoare triple {60206#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60231#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:36,068 INFO L290 TraceCheckUtils]: 74: Hoare triple {60231#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {60231#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:36,069 INFO L272 TraceCheckUtils]: 75: Hoare triple {60231#(<= ~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)); {60231#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:36,069 INFO L290 TraceCheckUtils]: 76: Hoare triple {60231#(<= ~counter~0 8)} ~cond := #in~cond; {60231#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:36,069 INFO L290 TraceCheckUtils]: 77: Hoare triple {60231#(<= ~counter~0 8)} assume !(0 == ~cond); {60231#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:36,070 INFO L290 TraceCheckUtils]: 78: Hoare triple {60231#(<= ~counter~0 8)} assume true; {60231#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:36,070 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60231#(<= ~counter~0 8)} {60231#(<= ~counter~0 8)} #96#return; {60231#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:36,070 INFO L290 TraceCheckUtils]: 80: Hoare triple {60231#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60231#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:36,071 INFO L290 TraceCheckUtils]: 81: Hoare triple {60231#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60256#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:36,071 INFO L290 TraceCheckUtils]: 82: Hoare triple {60256#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {60256#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:36,072 INFO L272 TraceCheckUtils]: 83: Hoare triple {60256#(<= ~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)); {60256#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:36,072 INFO L290 TraceCheckUtils]: 84: Hoare triple {60256#(<= ~counter~0 9)} ~cond := #in~cond; {60256#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:36,072 INFO L290 TraceCheckUtils]: 85: Hoare triple {60256#(<= ~counter~0 9)} assume !(0 == ~cond); {60256#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:36,072 INFO L290 TraceCheckUtils]: 86: Hoare triple {60256#(<= ~counter~0 9)} assume true; {60256#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:36,073 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60256#(<= ~counter~0 9)} {60256#(<= ~counter~0 9)} #96#return; {60256#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:36,073 INFO L290 TraceCheckUtils]: 88: Hoare triple {60256#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60256#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:36,074 INFO L290 TraceCheckUtils]: 89: Hoare triple {60256#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60281#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:36,074 INFO L290 TraceCheckUtils]: 90: Hoare triple {60281#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {60281#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:36,075 INFO L272 TraceCheckUtils]: 91: Hoare triple {60281#(<= ~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)); {60281#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:36,075 INFO L290 TraceCheckUtils]: 92: Hoare triple {60281#(<= ~counter~0 10)} ~cond := #in~cond; {60281#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:36,075 INFO L290 TraceCheckUtils]: 93: Hoare triple {60281#(<= ~counter~0 10)} assume !(0 == ~cond); {60281#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:36,075 INFO L290 TraceCheckUtils]: 94: Hoare triple {60281#(<= ~counter~0 10)} assume true; {60281#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:36,076 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60281#(<= ~counter~0 10)} {60281#(<= ~counter~0 10)} #96#return; {60281#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:36,076 INFO L290 TraceCheckUtils]: 96: Hoare triple {60281#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60281#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:36,076 INFO L290 TraceCheckUtils]: 97: Hoare triple {60281#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60306#(<= |main_#t~post7| 10)} is VALID [2022-04-28 12:43:36,077 INFO L290 TraceCheckUtils]: 98: Hoare triple {60306#(<= |main_#t~post7| 10)} assume !(#t~post7 < 50);havoc #t~post7; {60000#false} is VALID [2022-04-28 12:43:36,077 INFO L290 TraceCheckUtils]: 99: Hoare triple {60000#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60000#false} is VALID [2022-04-28 12:43:36,077 INFO L290 TraceCheckUtils]: 100: Hoare triple {60000#false} assume !(#t~post8 < 50);havoc #t~post8; {60000#false} is VALID [2022-04-28 12:43:36,077 INFO L290 TraceCheckUtils]: 101: Hoare triple {60000#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60000#false} is VALID [2022-04-28 12:43:36,077 INFO L290 TraceCheckUtils]: 102: Hoare triple {60000#false} assume !(#t~post6 < 50);havoc #t~post6; {60000#false} is VALID [2022-04-28 12:43:36,077 INFO L272 TraceCheckUtils]: 103: Hoare triple {60000#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60000#false} is VALID [2022-04-28 12:43:36,077 INFO L290 TraceCheckUtils]: 104: Hoare triple {60000#false} ~cond := #in~cond; {60000#false} is VALID [2022-04-28 12:43:36,077 INFO L290 TraceCheckUtils]: 105: Hoare triple {60000#false} assume 0 == ~cond; {60000#false} is VALID [2022-04-28 12:43:36,077 INFO L290 TraceCheckUtils]: 106: Hoare triple {60000#false} assume !false; {60000#false} is VALID [2022-04-28 12:43:36,077 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-28 12:43:36,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:43:36,559 INFO L290 TraceCheckUtils]: 106: Hoare triple {60000#false} assume !false; {60000#false} is VALID [2022-04-28 12:43:36,559 INFO L290 TraceCheckUtils]: 105: Hoare triple {60000#false} assume 0 == ~cond; {60000#false} is VALID [2022-04-28 12:43:36,559 INFO L290 TraceCheckUtils]: 104: Hoare triple {60000#false} ~cond := #in~cond; {60000#false} is VALID [2022-04-28 12:43:36,559 INFO L272 TraceCheckUtils]: 103: Hoare triple {60000#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60000#false} is VALID [2022-04-28 12:43:36,559 INFO L290 TraceCheckUtils]: 102: Hoare triple {60000#false} assume !(#t~post6 < 50);havoc #t~post6; {60000#false} is VALID [2022-04-28 12:43:36,559 INFO L290 TraceCheckUtils]: 101: Hoare triple {60000#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60000#false} is VALID [2022-04-28 12:43:36,559 INFO L290 TraceCheckUtils]: 100: Hoare triple {60000#false} assume !(#t~post8 < 50);havoc #t~post8; {60000#false} is VALID [2022-04-28 12:43:36,559 INFO L290 TraceCheckUtils]: 99: Hoare triple {60000#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60000#false} is VALID [2022-04-28 12:43:36,560 INFO L290 TraceCheckUtils]: 98: Hoare triple {60358#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {60000#false} is VALID [2022-04-28 12:43:36,560 INFO L290 TraceCheckUtils]: 97: Hoare triple {60362#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60358#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:43:36,560 INFO L290 TraceCheckUtils]: 96: Hoare triple {60362#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60362#(< ~counter~0 50)} is VALID [2022-04-28 12:43:36,561 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {59999#true} {60362#(< ~counter~0 50)} #96#return; {60362#(< ~counter~0 50)} is VALID [2022-04-28 12:43:36,561 INFO L290 TraceCheckUtils]: 94: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,561 INFO L290 TraceCheckUtils]: 93: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,561 INFO L290 TraceCheckUtils]: 92: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,561 INFO L272 TraceCheckUtils]: 91: Hoare triple {60362#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,561 INFO L290 TraceCheckUtils]: 90: Hoare triple {60362#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {60362#(< ~counter~0 50)} is VALID [2022-04-28 12:43:36,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {60387#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60362#(< ~counter~0 50)} is VALID [2022-04-28 12:43:36,563 INFO L290 TraceCheckUtils]: 88: Hoare triple {60387#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60387#(< ~counter~0 49)} is VALID [2022-04-28 12:43:36,563 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {59999#true} {60387#(< ~counter~0 49)} #96#return; {60387#(< ~counter~0 49)} is VALID [2022-04-28 12:43:36,563 INFO L290 TraceCheckUtils]: 86: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,563 INFO L290 TraceCheckUtils]: 85: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,563 INFO L290 TraceCheckUtils]: 84: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,563 INFO L272 TraceCheckUtils]: 83: Hoare triple {60387#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,564 INFO L290 TraceCheckUtils]: 82: Hoare triple {60387#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {60387#(< ~counter~0 49)} is VALID [2022-04-28 12:43:36,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {60412#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60387#(< ~counter~0 49)} is VALID [2022-04-28 12:43:36,564 INFO L290 TraceCheckUtils]: 80: Hoare triple {60412#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60412#(< ~counter~0 48)} is VALID [2022-04-28 12:43:36,565 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {59999#true} {60412#(< ~counter~0 48)} #96#return; {60412#(< ~counter~0 48)} is VALID [2022-04-28 12:43:36,565 INFO L290 TraceCheckUtils]: 78: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,565 INFO L290 TraceCheckUtils]: 77: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,565 INFO L290 TraceCheckUtils]: 76: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,565 INFO L272 TraceCheckUtils]: 75: Hoare triple {60412#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,565 INFO L290 TraceCheckUtils]: 74: Hoare triple {60412#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {60412#(< ~counter~0 48)} is VALID [2022-04-28 12:43:36,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {60437#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60412#(< ~counter~0 48)} is VALID [2022-04-28 12:43:36,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {60437#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60437#(< ~counter~0 47)} is VALID [2022-04-28 12:43:36,567 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {59999#true} {60437#(< ~counter~0 47)} #96#return; {60437#(< ~counter~0 47)} is VALID [2022-04-28 12:43:36,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,567 INFO L290 TraceCheckUtils]: 68: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,567 INFO L272 TraceCheckUtils]: 67: Hoare triple {60437#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {60437#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {60437#(< ~counter~0 47)} is VALID [2022-04-28 12:43:36,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {60462#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60437#(< ~counter~0 47)} is VALID [2022-04-28 12:43:36,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {60462#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60462#(< ~counter~0 46)} is VALID [2022-04-28 12:43:36,569 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {59999#true} {60462#(< ~counter~0 46)} #96#return; {60462#(< ~counter~0 46)} is VALID [2022-04-28 12:43:36,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,569 INFO L290 TraceCheckUtils]: 60: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,569 INFO L272 TraceCheckUtils]: 59: Hoare triple {60462#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,569 INFO L290 TraceCheckUtils]: 58: Hoare triple {60462#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {60462#(< ~counter~0 46)} is VALID [2022-04-28 12:43:36,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {60487#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60462#(< ~counter~0 46)} is VALID [2022-04-28 12:43:36,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {60487#(< ~counter~0 45)} assume !!(0 != ~r~0); {60487#(< ~counter~0 45)} is VALID [2022-04-28 12:43:36,570 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {59999#true} {60487#(< ~counter~0 45)} #94#return; {60487#(< ~counter~0 45)} is VALID [2022-04-28 12:43:36,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,571 INFO L272 TraceCheckUtils]: 51: Hoare triple {60487#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {60487#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {60487#(< ~counter~0 45)} is VALID [2022-04-28 12:43:36,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {60512#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60487#(< ~counter~0 45)} is VALID [2022-04-28 12:43:36,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {60512#(< ~counter~0 44)} assume !(~r~0 < 0); {60512#(< ~counter~0 44)} is VALID [2022-04-28 12:43:36,572 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {59999#true} {60512#(< ~counter~0 44)} #98#return; {60512#(< ~counter~0 44)} is VALID [2022-04-28 12:43:36,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,572 INFO L272 TraceCheckUtils]: 43: Hoare triple {60512#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {60512#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {60512#(< ~counter~0 44)} is VALID [2022-04-28 12:43:36,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {60537#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60512#(< ~counter~0 44)} is VALID [2022-04-28 12:43:36,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {60537#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60537#(< ~counter~0 43)} is VALID [2022-04-28 12:43:36,574 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {59999#true} {60537#(< ~counter~0 43)} #98#return; {60537#(< ~counter~0 43)} is VALID [2022-04-28 12:43:36,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,574 INFO L272 TraceCheckUtils]: 35: Hoare triple {60537#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {60537#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {60537#(< ~counter~0 43)} is VALID [2022-04-28 12:43:36,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {60562#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60537#(< ~counter~0 43)} is VALID [2022-04-28 12:43:36,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {60562#(< ~counter~0 42)} assume !(~r~0 > 0); {60562#(< ~counter~0 42)} is VALID [2022-04-28 12:43:36,576 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {59999#true} {60562#(< ~counter~0 42)} #96#return; {60562#(< ~counter~0 42)} is VALID [2022-04-28 12:43:36,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,576 INFO L272 TraceCheckUtils]: 27: Hoare triple {60562#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {60562#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {60562#(< ~counter~0 42)} is VALID [2022-04-28 12:43:36,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {60587#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60562#(< ~counter~0 42)} is VALID [2022-04-28 12:43:36,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {60587#(< ~counter~0 41)} assume !!(0 != ~r~0); {60587#(< ~counter~0 41)} is VALID [2022-04-28 12:43:36,578 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {59999#true} {60587#(< ~counter~0 41)} #94#return; {60587#(< ~counter~0 41)} is VALID [2022-04-28 12:43:36,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,578 INFO L272 TraceCheckUtils]: 19: Hoare triple {60587#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {60587#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {60587#(< ~counter~0 41)} is VALID [2022-04-28 12:43:36,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {60612#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60587#(< ~counter~0 41)} is VALID [2022-04-28 12:43:36,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {60612#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60612#(< ~counter~0 40)} is VALID [2022-04-28 12:43:36,580 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {59999#true} {60612#(< ~counter~0 40)} #92#return; {60612#(< ~counter~0 40)} is VALID [2022-04-28 12:43:36,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,580 INFO L272 TraceCheckUtils]: 11: Hoare triple {60612#(< ~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)); {59999#true} is VALID [2022-04-28 12:43:36,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {59999#true} {60612#(< ~counter~0 40)} #90#return; {60612#(< ~counter~0 40)} is VALID [2022-04-28 12:43:36,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {59999#true} assume true; {59999#true} is VALID [2022-04-28 12:43:36,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {59999#true} assume !(0 == ~cond); {59999#true} is VALID [2022-04-28 12:43:36,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {59999#true} ~cond := #in~cond; {59999#true} is VALID [2022-04-28 12:43:36,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {60612#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {59999#true} is VALID [2022-04-28 12:43:36,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {60612#(< ~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; {60612#(< ~counter~0 40)} is VALID [2022-04-28 12:43:36,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {60612#(< ~counter~0 40)} call #t~ret9 := main(); {60612#(< ~counter~0 40)} is VALID [2022-04-28 12:43:36,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60612#(< ~counter~0 40)} {59999#true} #102#return; {60612#(< ~counter~0 40)} is VALID [2022-04-28 12:43:36,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {60612#(< ~counter~0 40)} assume true; {60612#(< ~counter~0 40)} is VALID [2022-04-28 12:43:36,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {59999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60612#(< ~counter~0 40)} is VALID [2022-04-28 12:43:36,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {59999#true} call ULTIMATE.init(); {59999#true} is VALID [2022-04-28 12:43:36,583 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-28 12:43:36,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105006091] [2022-04-28 12:43:36,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613891295] [2022-04-28 12:43:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613891295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:43:36,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:43:36,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 12:43:36,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116864390] [2022-04-28 12:43:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116864390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:36,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:36,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 12:43:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970392764] [2022-04-28 12:43:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:36,585 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-28 12:43:36,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:36,585 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-28 12:43:36,667 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-28 12:43:36,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 12:43:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:36,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 12:43:36,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:43:36,668 INFO L87 Difference]: Start difference. First operand 550 states and 738 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-28 12:43:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:38,019 INFO L93 Difference]: Finished difference Result 767 states and 1065 transitions. [2022-04-28 12:43:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 12:43:38,019 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-28 12:43:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:38,019 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-28 12:43:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-28 12:43:38,021 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-28 12:43:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-28 12:43:38,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-28 12:43:38,162 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-28 12:43:38,176 INFO L225 Difference]: With dead ends: 767 [2022-04-28 12:43:38,176 INFO L226 Difference]: Without dead ends: 566 [2022-04-28 12:43:38,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=497, Invalid=693, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 12:43:38,177 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 145 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:38,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 242 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:43:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-04-28 12:43:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2022-04-28 12:43:39,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:39,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 566 states. Second operand has 566 states, 431 states have (on average 1.2250580046403712) internal successors, (528), 431 states have internal predecessors, (528), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:43:39,100 INFO L74 IsIncluded]: Start isIncluded. First operand 566 states. Second operand has 566 states, 431 states have (on average 1.2250580046403712) internal successors, (528), 431 states have internal predecessors, (528), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:43:39,100 INFO L87 Difference]: Start difference. First operand 566 states. Second operand has 566 states, 431 states have (on average 1.2250580046403712) internal successors, (528), 431 states have internal predecessors, (528), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:43:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:39,116 INFO L93 Difference]: Finished difference Result 566 states and 754 transitions. [2022-04-28 12:43:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 754 transitions. [2022-04-28 12:43:39,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:39,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:39,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 566 states, 431 states have (on average 1.2250580046403712) internal successors, (528), 431 states have internal predecessors, (528), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 566 states. [2022-04-28 12:43:39,118 INFO L87 Difference]: Start difference. First operand has 566 states, 431 states have (on average 1.2250580046403712) internal successors, (528), 431 states have internal predecessors, (528), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 566 states. [2022-04-28 12:43:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:39,130 INFO L93 Difference]: Finished difference Result 566 states and 754 transitions. [2022-04-28 12:43:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 754 transitions. [2022-04-28 12:43:39,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:39,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:39,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:39,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 431 states have (on average 1.2250580046403712) internal successors, (528), 431 states have internal predecessors, (528), 114 states have call successors, (114), 22 states have call predecessors, (114), 20 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 12:43:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 754 transitions. [2022-04-28 12:43:39,146 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 754 transitions. Word has length 107 [2022-04-28 12:43:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:39,146 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 754 transitions. [2022-04-28 12:43:39,146 INFO L496 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-28 12:43:39,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 566 states and 754 transitions. [2022-04-28 12:43:53,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 754 edges. 750 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 754 transitions. [2022-04-28 12:43:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 12:43:53,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:53,607 INFO L195 NwaCegarLoop]: 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-28 12:43:53,611 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-28 12:43:53,807 WARN L477 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-28 12:43:53,807 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-28 12:43:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:53,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [315229487] [2022-04-28 12:43:53,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-28 12:43:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:53,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456313572] [2022-04-28 12:43:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:53,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:53,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089652147] [2022-04-28 12:43:53,819 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:43:53,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:53,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:53,820 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-28 12:43:53,821 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-28 12:43:53,959 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 12:43:53,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:53,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 12:43:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:53,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:43:54,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {64482#true} call ULTIMATE.init(); {64482#true} is VALID [2022-04-28 12:43:54,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {64482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {64490#(<= ~counter~0 0)} assume true; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64490#(<= ~counter~0 0)} {64482#true} #102#return; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {64490#(<= ~counter~0 0)} call #t~ret9 := main(); {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {64490#(<= ~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; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,507 INFO L272 TraceCheckUtils]: 6: Hoare triple {64490#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {64490#(<= ~counter~0 0)} ~cond := #in~cond; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {64490#(<= ~counter~0 0)} assume !(0 == ~cond); {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {64490#(<= ~counter~0 0)} assume true; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {64490#(<= ~counter~0 0)} {64490#(<= ~counter~0 0)} #90#return; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,509 INFO L272 TraceCheckUtils]: 11: Hoare triple {64490#(<= ~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)); {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {64490#(<= ~counter~0 0)} ~cond := #in~cond; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {64490#(<= ~counter~0 0)} assume !(0 == ~cond); {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {64490#(<= ~counter~0 0)} assume true; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,510 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {64490#(<= ~counter~0 0)} {64490#(<= ~counter~0 0)} #92#return; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {64490#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {64490#(<= ~counter~0 0)} is VALID [2022-04-28 12:43:54,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {64490#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64539#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:54,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {64539#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {64539#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:54,512 INFO L272 TraceCheckUtils]: 19: Hoare triple {64539#(<= ~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)); {64539#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:54,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {64539#(<= ~counter~0 1)} ~cond := #in~cond; {64539#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:54,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {64539#(<= ~counter~0 1)} assume !(0 == ~cond); {64539#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:54,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {64539#(<= ~counter~0 1)} assume true; {64539#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:54,514 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {64539#(<= ~counter~0 1)} {64539#(<= ~counter~0 1)} #94#return; {64539#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:54,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {64539#(<= ~counter~0 1)} assume !!(0 != ~r~0); {64539#(<= ~counter~0 1)} is VALID [2022-04-28 12:43:54,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {64539#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64564#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:54,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {64564#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {64564#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:54,515 INFO L272 TraceCheckUtils]: 27: Hoare triple {64564#(<= ~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)); {64564#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:54,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {64564#(<= ~counter~0 2)} ~cond := #in~cond; {64564#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:54,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {64564#(<= ~counter~0 2)} assume !(0 == ~cond); {64564#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:54,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {64564#(<= ~counter~0 2)} assume true; {64564#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:54,517 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {64564#(<= ~counter~0 2)} {64564#(<= ~counter~0 2)} #96#return; {64564#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:54,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {64564#(<= ~counter~0 2)} assume !(~r~0 > 0); {64564#(<= ~counter~0 2)} is VALID [2022-04-28 12:43:54,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {64564#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64589#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:54,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {64589#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {64589#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:54,518 INFO L272 TraceCheckUtils]: 35: Hoare triple {64589#(<= ~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)); {64589#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:54,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {64589#(<= ~counter~0 3)} ~cond := #in~cond; {64589#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:54,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {64589#(<= ~counter~0 3)} assume !(0 == ~cond); {64589#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:54,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {64589#(<= ~counter~0 3)} assume true; {64589#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:54,520 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {64589#(<= ~counter~0 3)} {64589#(<= ~counter~0 3)} #98#return; {64589#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:54,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {64589#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64589#(<= ~counter~0 3)} is VALID [2022-04-28 12:43:54,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {64589#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64614#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:54,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {64614#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {64614#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:54,521 INFO L272 TraceCheckUtils]: 43: Hoare triple {64614#(<= ~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)); {64614#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:54,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {64614#(<= ~counter~0 4)} ~cond := #in~cond; {64614#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:54,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {64614#(<= ~counter~0 4)} assume !(0 == ~cond); {64614#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:54,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {64614#(<= ~counter~0 4)} assume true; {64614#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:54,522 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {64614#(<= ~counter~0 4)} {64614#(<= ~counter~0 4)} #98#return; {64614#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:54,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {64614#(<= ~counter~0 4)} assume !(~r~0 < 0); {64614#(<= ~counter~0 4)} is VALID [2022-04-28 12:43:54,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {64614#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64639#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:54,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {64639#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {64639#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:54,524 INFO L272 TraceCheckUtils]: 51: Hoare triple {64639#(<= ~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)); {64639#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:54,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {64639#(<= ~counter~0 5)} ~cond := #in~cond; {64639#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:54,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {64639#(<= ~counter~0 5)} assume !(0 == ~cond); {64639#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:54,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {64639#(<= ~counter~0 5)} assume true; {64639#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:54,525 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {64639#(<= ~counter~0 5)} {64639#(<= ~counter~0 5)} #94#return; {64639#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:54,526 INFO L290 TraceCheckUtils]: 56: Hoare triple {64639#(<= ~counter~0 5)} assume !!(0 != ~r~0); {64639#(<= ~counter~0 5)} is VALID [2022-04-28 12:43:54,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {64639#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64664#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:54,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {64664#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {64664#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:54,527 INFO L272 TraceCheckUtils]: 59: Hoare triple {64664#(<= ~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)); {64664#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:54,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {64664#(<= ~counter~0 6)} ~cond := #in~cond; {64664#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:54,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {64664#(<= ~counter~0 6)} assume !(0 == ~cond); {64664#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:54,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {64664#(<= ~counter~0 6)} assume true; {64664#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:54,528 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {64664#(<= ~counter~0 6)} {64664#(<= ~counter~0 6)} #96#return; {64664#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:54,528 INFO L290 TraceCheckUtils]: 64: Hoare triple {64664#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64664#(<= ~counter~0 6)} is VALID [2022-04-28 12:43:54,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {64664#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64689#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:54,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {64689#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {64689#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:54,530 INFO L272 TraceCheckUtils]: 67: Hoare triple {64689#(<= ~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)); {64689#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:54,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {64689#(<= ~counter~0 7)} ~cond := #in~cond; {64689#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:54,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {64689#(<= ~counter~0 7)} assume !(0 == ~cond); {64689#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:54,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {64689#(<= ~counter~0 7)} assume true; {64689#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:54,531 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {64689#(<= ~counter~0 7)} {64689#(<= ~counter~0 7)} #96#return; {64689#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:54,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {64689#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64689#(<= ~counter~0 7)} is VALID [2022-04-28 12:43:54,532 INFO L290 TraceCheckUtils]: 73: Hoare triple {64689#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64714#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:54,532 INFO L290 TraceCheckUtils]: 74: Hoare triple {64714#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {64714#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:54,533 INFO L272 TraceCheckUtils]: 75: Hoare triple {64714#(<= ~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)); {64714#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:54,533 INFO L290 TraceCheckUtils]: 76: Hoare triple {64714#(<= ~counter~0 8)} ~cond := #in~cond; {64714#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:54,533 INFO L290 TraceCheckUtils]: 77: Hoare triple {64714#(<= ~counter~0 8)} assume !(0 == ~cond); {64714#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:54,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {64714#(<= ~counter~0 8)} assume true; {64714#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:54,534 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {64714#(<= ~counter~0 8)} {64714#(<= ~counter~0 8)} #96#return; {64714#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:54,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {64714#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64714#(<= ~counter~0 8)} is VALID [2022-04-28 12:43:54,535 INFO L290 TraceCheckUtils]: 81: Hoare triple {64714#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64739#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:54,535 INFO L290 TraceCheckUtils]: 82: Hoare triple {64739#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {64739#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:54,536 INFO L272 TraceCheckUtils]: 83: Hoare triple {64739#(<= ~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)); {64739#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:54,536 INFO L290 TraceCheckUtils]: 84: Hoare triple {64739#(<= ~counter~0 9)} ~cond := #in~cond; {64739#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:54,536 INFO L290 TraceCheckUtils]: 85: Hoare triple {64739#(<= ~counter~0 9)} assume !(0 == ~cond); {64739#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:54,536 INFO L290 TraceCheckUtils]: 86: Hoare triple {64739#(<= ~counter~0 9)} assume true; {64739#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:54,537 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {64739#(<= ~counter~0 9)} {64739#(<= ~counter~0 9)} #96#return; {64739#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:54,537 INFO L290 TraceCheckUtils]: 88: Hoare triple {64739#(<= ~counter~0 9)} assume !(~r~0 > 0); {64739#(<= ~counter~0 9)} is VALID [2022-04-28 12:43:54,538 INFO L290 TraceCheckUtils]: 89: Hoare triple {64739#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64764#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:54,538 INFO L290 TraceCheckUtils]: 90: Hoare triple {64764#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {64764#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:54,539 INFO L272 TraceCheckUtils]: 91: Hoare triple {64764#(<= ~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)); {64764#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:54,539 INFO L290 TraceCheckUtils]: 92: Hoare triple {64764#(<= ~counter~0 10)} ~cond := #in~cond; {64764#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:54,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {64764#(<= ~counter~0 10)} assume !(0 == ~cond); {64764#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:54,539 INFO L290 TraceCheckUtils]: 94: Hoare triple {64764#(<= ~counter~0 10)} assume true; {64764#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:54,540 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {64764#(<= ~counter~0 10)} {64764#(<= ~counter~0 10)} #98#return; {64764#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:54,540 INFO L290 TraceCheckUtils]: 96: Hoare triple {64764#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64764#(<= ~counter~0 10)} is VALID [2022-04-28 12:43:54,541 INFO L290 TraceCheckUtils]: 97: Hoare triple {64764#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64789#(<= ~counter~0 11)} is VALID [2022-04-28 12:43:54,541 INFO L290 TraceCheckUtils]: 98: Hoare triple {64789#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {64789#(<= ~counter~0 11)} is VALID [2022-04-28 12:43:54,541 INFO L272 TraceCheckUtils]: 99: Hoare triple {64789#(<= ~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)); {64789#(<= ~counter~0 11)} is VALID [2022-04-28 12:43:54,542 INFO L290 TraceCheckUtils]: 100: Hoare triple {64789#(<= ~counter~0 11)} ~cond := #in~cond; {64789#(<= ~counter~0 11)} is VALID [2022-04-28 12:43:54,542 INFO L290 TraceCheckUtils]: 101: Hoare triple {64789#(<= ~counter~0 11)} assume !(0 == ~cond); {64789#(<= ~counter~0 11)} is VALID [2022-04-28 12:43:54,542 INFO L290 TraceCheckUtils]: 102: Hoare triple {64789#(<= ~counter~0 11)} assume true; {64789#(<= ~counter~0 11)} is VALID [2022-04-28 12:43:54,543 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {64789#(<= ~counter~0 11)} {64789#(<= ~counter~0 11)} #98#return; {64789#(<= ~counter~0 11)} is VALID [2022-04-28 12:43:54,543 INFO L290 TraceCheckUtils]: 104: Hoare triple {64789#(<= ~counter~0 11)} assume !(~r~0 < 0); {64789#(<= ~counter~0 11)} is VALID [2022-04-28 12:43:54,543 INFO L290 TraceCheckUtils]: 105: Hoare triple {64789#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64814#(<= |main_#t~post6| 11)} is VALID [2022-04-28 12:43:54,544 INFO L290 TraceCheckUtils]: 106: Hoare triple {64814#(<= |main_#t~post6| 11)} assume !(#t~post6 < 50);havoc #t~post6; {64483#false} is VALID [2022-04-28 12:43:54,544 INFO L272 TraceCheckUtils]: 107: Hoare triple {64483#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64483#false} is VALID [2022-04-28 12:43:54,544 INFO L290 TraceCheckUtils]: 108: Hoare triple {64483#false} ~cond := #in~cond; {64483#false} is VALID [2022-04-28 12:43:54,544 INFO L290 TraceCheckUtils]: 109: Hoare triple {64483#false} assume 0 == ~cond; {64483#false} is VALID [2022-04-28 12:43:54,544 INFO L290 TraceCheckUtils]: 110: Hoare triple {64483#false} assume !false; {64483#false} is VALID [2022-04-28 12:43:54,544 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-28 12:43:54,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:43:55,171 INFO L290 TraceCheckUtils]: 110: Hoare triple {64483#false} assume !false; {64483#false} is VALID [2022-04-28 12:43:55,171 INFO L290 TraceCheckUtils]: 109: Hoare triple {64483#false} assume 0 == ~cond; {64483#false} is VALID [2022-04-28 12:43:55,171 INFO L290 TraceCheckUtils]: 108: Hoare triple {64483#false} ~cond := #in~cond; {64483#false} is VALID [2022-04-28 12:43:55,171 INFO L272 TraceCheckUtils]: 107: Hoare triple {64483#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64483#false} is VALID [2022-04-28 12:43:55,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {64842#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {64483#false} is VALID [2022-04-28 12:43:55,171 INFO L290 TraceCheckUtils]: 105: Hoare triple {64846#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64842#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:43:55,172 INFO L290 TraceCheckUtils]: 104: Hoare triple {64846#(< ~counter~0 50)} assume !(~r~0 < 0); {64846#(< ~counter~0 50)} is VALID [2022-04-28 12:43:55,172 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {64482#true} {64846#(< ~counter~0 50)} #98#return; {64846#(< ~counter~0 50)} is VALID [2022-04-28 12:43:55,172 INFO L290 TraceCheckUtils]: 102: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,172 INFO L290 TraceCheckUtils]: 101: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,172 INFO L290 TraceCheckUtils]: 100: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,172 INFO L272 TraceCheckUtils]: 99: Hoare triple {64846#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,172 INFO L290 TraceCheckUtils]: 98: Hoare triple {64846#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {64846#(< ~counter~0 50)} is VALID [2022-04-28 12:43:55,174 INFO L290 TraceCheckUtils]: 97: Hoare triple {64871#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64846#(< ~counter~0 50)} is VALID [2022-04-28 12:43:55,174 INFO L290 TraceCheckUtils]: 96: Hoare triple {64871#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64871#(< ~counter~0 49)} is VALID [2022-04-28 12:43:55,174 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {64482#true} {64871#(< ~counter~0 49)} #98#return; {64871#(< ~counter~0 49)} is VALID [2022-04-28 12:43:55,174 INFO L290 TraceCheckUtils]: 94: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,174 INFO L290 TraceCheckUtils]: 93: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,174 INFO L272 TraceCheckUtils]: 91: Hoare triple {64871#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,175 INFO L290 TraceCheckUtils]: 90: Hoare triple {64871#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {64871#(< ~counter~0 49)} is VALID [2022-04-28 12:43:55,175 INFO L290 TraceCheckUtils]: 89: Hoare triple {64896#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64871#(< ~counter~0 49)} is VALID [2022-04-28 12:43:55,175 INFO L290 TraceCheckUtils]: 88: Hoare triple {64896#(< ~counter~0 48)} assume !(~r~0 > 0); {64896#(< ~counter~0 48)} is VALID [2022-04-28 12:43:55,176 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {64482#true} {64896#(< ~counter~0 48)} #96#return; {64896#(< ~counter~0 48)} is VALID [2022-04-28 12:43:55,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,176 INFO L290 TraceCheckUtils]: 85: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,176 INFO L290 TraceCheckUtils]: 84: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,176 INFO L272 TraceCheckUtils]: 83: Hoare triple {64896#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,177 INFO L290 TraceCheckUtils]: 82: Hoare triple {64896#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {64896#(< ~counter~0 48)} is VALID [2022-04-28 12:43:55,177 INFO L290 TraceCheckUtils]: 81: Hoare triple {64921#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64896#(< ~counter~0 48)} is VALID [2022-04-28 12:43:55,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {64921#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64921#(< ~counter~0 47)} is VALID [2022-04-28 12:43:55,178 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {64482#true} {64921#(< ~counter~0 47)} #96#return; {64921#(< ~counter~0 47)} is VALID [2022-04-28 12:43:55,178 INFO L290 TraceCheckUtils]: 78: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,178 INFO L290 TraceCheckUtils]: 77: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,178 INFO L290 TraceCheckUtils]: 76: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,178 INFO L272 TraceCheckUtils]: 75: Hoare triple {64921#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,178 INFO L290 TraceCheckUtils]: 74: Hoare triple {64921#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {64921#(< ~counter~0 47)} is VALID [2022-04-28 12:43:55,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {64946#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64921#(< ~counter~0 47)} is VALID [2022-04-28 12:43:55,179 INFO L290 TraceCheckUtils]: 72: Hoare triple {64946#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64946#(< ~counter~0 46)} is VALID [2022-04-28 12:43:55,179 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {64482#true} {64946#(< ~counter~0 46)} #96#return; {64946#(< ~counter~0 46)} is VALID [2022-04-28 12:43:55,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,179 INFO L290 TraceCheckUtils]: 68: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,180 INFO L272 TraceCheckUtils]: 67: Hoare triple {64946#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {64946#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {64946#(< ~counter~0 46)} is VALID [2022-04-28 12:43:55,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {64971#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64946#(< ~counter~0 46)} is VALID [2022-04-28 12:43:55,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {64971#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64971#(< ~counter~0 45)} is VALID [2022-04-28 12:43:55,181 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {64482#true} {64971#(< ~counter~0 45)} #96#return; {64971#(< ~counter~0 45)} is VALID [2022-04-28 12:43:55,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,181 INFO L272 TraceCheckUtils]: 59: Hoare triple {64971#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {64971#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {64971#(< ~counter~0 45)} is VALID [2022-04-28 12:43:55,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {64996#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64971#(< ~counter~0 45)} is VALID [2022-04-28 12:43:55,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {64996#(< ~counter~0 44)} assume !!(0 != ~r~0); {64996#(< ~counter~0 44)} is VALID [2022-04-28 12:43:55,182 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {64482#true} {64996#(< ~counter~0 44)} #94#return; {64996#(< ~counter~0 44)} is VALID [2022-04-28 12:43:55,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,183 INFO L290 TraceCheckUtils]: 53: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,183 INFO L272 TraceCheckUtils]: 51: Hoare triple {64996#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {64996#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {64996#(< ~counter~0 44)} is VALID [2022-04-28 12:43:55,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {65021#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64996#(< ~counter~0 44)} is VALID [2022-04-28 12:43:55,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {65021#(< ~counter~0 43)} assume !(~r~0 < 0); {65021#(< ~counter~0 43)} is VALID [2022-04-28 12:43:55,184 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {64482#true} {65021#(< ~counter~0 43)} #98#return; {65021#(< ~counter~0 43)} is VALID [2022-04-28 12:43:55,184 INFO L290 TraceCheckUtils]: 46: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,184 INFO L272 TraceCheckUtils]: 43: Hoare triple {65021#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {65021#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {65021#(< ~counter~0 43)} is VALID [2022-04-28 12:43:55,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {65046#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65021#(< ~counter~0 43)} is VALID [2022-04-28 12:43:55,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {65046#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65046#(< ~counter~0 42)} is VALID [2022-04-28 12:43:55,185 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {64482#true} {65046#(< ~counter~0 42)} #98#return; {65046#(< ~counter~0 42)} is VALID [2022-04-28 12:43:55,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,186 INFO L272 TraceCheckUtils]: 35: Hoare triple {65046#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {65046#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {65046#(< ~counter~0 42)} is VALID [2022-04-28 12:43:55,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {65071#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65046#(< ~counter~0 42)} is VALID [2022-04-28 12:43:55,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {65071#(< ~counter~0 41)} assume !(~r~0 > 0); {65071#(< ~counter~0 41)} is VALID [2022-04-28 12:43:55,187 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {64482#true} {65071#(< ~counter~0 41)} #96#return; {65071#(< ~counter~0 41)} is VALID [2022-04-28 12:43:55,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,187 INFO L272 TraceCheckUtils]: 27: Hoare triple {65071#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {65071#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {65071#(< ~counter~0 41)} is VALID [2022-04-28 12:43:55,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {65096#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65071#(< ~counter~0 41)} is VALID [2022-04-28 12:43:55,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {65096#(< ~counter~0 40)} assume !!(0 != ~r~0); {65096#(< ~counter~0 40)} is VALID [2022-04-28 12:43:55,189 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {64482#true} {65096#(< ~counter~0 40)} #94#return; {65096#(< ~counter~0 40)} is VALID [2022-04-28 12:43:55,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,189 INFO L272 TraceCheckUtils]: 19: Hoare triple {65096#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {65096#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {65096#(< ~counter~0 40)} is VALID [2022-04-28 12:43:55,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {65121#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65096#(< ~counter~0 40)} is VALID [2022-04-28 12:43:55,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {65121#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65121#(< ~counter~0 39)} is VALID [2022-04-28 12:43:55,190 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {64482#true} {65121#(< ~counter~0 39)} #92#return; {65121#(< ~counter~0 39)} is VALID [2022-04-28 12:43:55,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {65121#(< ~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)); {64482#true} is VALID [2022-04-28 12:43:55,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {64482#true} {65121#(< ~counter~0 39)} #90#return; {65121#(< ~counter~0 39)} is VALID [2022-04-28 12:43:55,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {64482#true} assume true; {64482#true} is VALID [2022-04-28 12:43:55,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {64482#true} assume !(0 == ~cond); {64482#true} is VALID [2022-04-28 12:43:55,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {64482#true} ~cond := #in~cond; {64482#true} is VALID [2022-04-28 12:43:55,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {65121#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {64482#true} is VALID [2022-04-28 12:43:55,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {65121#(< ~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; {65121#(< ~counter~0 39)} is VALID [2022-04-28 12:43:55,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {65121#(< ~counter~0 39)} call #t~ret9 := main(); {65121#(< ~counter~0 39)} is VALID [2022-04-28 12:43:55,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65121#(< ~counter~0 39)} {64482#true} #102#return; {65121#(< ~counter~0 39)} is VALID [2022-04-28 12:43:55,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {65121#(< ~counter~0 39)} assume true; {65121#(< ~counter~0 39)} is VALID [2022-04-28 12:43:55,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {64482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65121#(< ~counter~0 39)} is VALID [2022-04-28 12:43:55,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {64482#true} call ULTIMATE.init(); {64482#true} is VALID [2022-04-28 12:43:55,193 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-28 12:43:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456313572] [2022-04-28 12:43:55,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089652147] [2022-04-28 12:43:55,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089652147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:43:55,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:43:55,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 12:43:55,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [315229487] [2022-04-28 12:43:55,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [315229487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:55,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:55,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:43:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904205327] [2022-04-28 12:43:55,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:55,194 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-28 12:43:55,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:55,194 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-28 12:43:55,254 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-28 12:43:55,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:43:55,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:55,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:43:55,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 12:43:55,255 INFO L87 Difference]: Start difference. First operand 566 states and 754 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-28 12:43:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:56,799 INFO L93 Difference]: Finished difference Result 625 states and 834 transitions. [2022-04-28 12:43:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 12:43:56,800 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-28 12:43:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:56,800 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-28 12:43:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-28 12:43:56,801 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-28 12:43:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-28 12:43:56,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-28 12:43:56,925 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-28 12:43:56,941 INFO L225 Difference]: With dead ends: 625 [2022-04-28 12:43:56,941 INFO L226 Difference]: Without dead ends: 614 [2022-04-28 12:43:56,942 INFO L412 NwaCegarLoop]: 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-28 12:43:56,942 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 136 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:56,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 279 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:43:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-04-28 12:43:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 592. [2022-04-28 12:43:57,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:57,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 614 states. Second operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:43:57,803 INFO L74 IsIncluded]: Start isIncluded. First operand 614 states. Second operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:43:57,804 INFO L87 Difference]: Start difference. First operand 614 states. Second operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:43:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:57,817 INFO L93 Difference]: Finished difference Result 614 states and 818 transitions. [2022-04-28 12:43:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 818 transitions. [2022-04-28 12:43:57,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:57,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:57,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 614 states. [2022-04-28 12:43:57,818 INFO L87 Difference]: Start difference. First operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 614 states. [2022-04-28 12:43:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:57,831 INFO L93 Difference]: Finished difference Result 614 states and 818 transitions. [2022-04-28 12:43:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 818 transitions. [2022-04-28 12:43:57,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:57,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:57,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:57,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:43:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 792 transitions. [2022-04-28 12:43:57,850 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 792 transitions. Word has length 111 [2022-04-28 12:43:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:57,850 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 792 transitions. [2022-04-28 12:43:57,850 INFO L496 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-28 12:43:57,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 592 states and 792 transitions. [2022-04-28 12:44:13,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 792 edges. 788 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 792 transitions. [2022-04-28 12:44:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 12:44:13,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:44:13,125 INFO L195 NwaCegarLoop]: 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-28 12:44:13,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 12:44:13,325 WARN L477 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-28 12:44:13,326 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:44:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:44:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-28 12:44:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:13,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [337088918] [2022-04-28 12:44:13,326 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:44:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-28 12:44:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:44:13,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76538841] [2022-04-28 12:44:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:44:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:44:13,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:44:13,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440276468] [2022-04-28 12:44:13,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:44:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:44:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:44:13,339 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-28 12:44:13,340 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-28 12:44:13,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:44:13,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:44:13,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:44:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:44:13,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:44:14,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {68853#true} call ULTIMATE.init(); {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {68853#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68853#true} {68853#true} #102#return; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {68853#true} call #t~ret9 := main(); {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {68853#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; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {68853#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {68853#true} {68853#true} #90#return; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {68853#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)); {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,354 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {68853#true} {68853#true} #92#return; {68853#true} is VALID [2022-04-28 12:44:14,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {68853#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {68906#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {68906#(<= 1 main_~v~0)} assume !!(#t~post6 < 50);havoc #t~post6; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {68906#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,356 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {68853#true} {68906#(<= 1 main_~v~0)} #94#return; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {68906#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {68906#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {68906#(<= 1 main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,357 INFO L272 TraceCheckUtils]: 27: Hoare triple {68906#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,357 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {68853#true} {68906#(<= 1 main_~v~0)} #96#return; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {68906#(<= 1 main_~v~0)} assume !(~r~0 > 0); {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {68906#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {68906#(<= 1 main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,358 INFO L272 TraceCheckUtils]: 35: Hoare triple {68906#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,359 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {68853#true} {68906#(<= 1 main_~v~0)} #98#return; {68906#(<= 1 main_~v~0)} is VALID [2022-04-28 12:44:14,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {68906#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 50);havoc #t~post8; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,361 INFO L272 TraceCheckUtils]: 43: Hoare triple {68979#(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)); {68853#true} is VALID [2022-04-28 12:44:14,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,362 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {68853#true} {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 50);havoc #t~post6; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,363 INFO L272 TraceCheckUtils]: 51: Hoare triple {68979#(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)); {68853#true} is VALID [2022-04-28 12:44:14,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,364 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {68853#true} {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 50);havoc #t~post7; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,365 INFO L272 TraceCheckUtils]: 59: Hoare triple {68979#(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)); {68853#true} is VALID [2022-04-28 12:44:14,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,365 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {68853#true} {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {68979#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 12:44:14,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {68979#(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; {69052#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 12:44:14,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {69052#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69052#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 12:44:14,367 INFO L290 TraceCheckUtils]: 66: Hoare triple {69052#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {69052#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 12:44:14,367 INFO L272 TraceCheckUtils]: 67: Hoare triple {69052#(< (+ 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)); {68853#true} is VALID [2022-04-28 12:44:14,367 INFO L290 TraceCheckUtils]: 68: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,367 INFO L290 TraceCheckUtils]: 69: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,367 INFO L290 TraceCheckUtils]: 70: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,367 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {68853#true} {69052#(< (+ main_~r~0 3) main_~u~0)} #96#return; {69052#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 12:44:14,368 INFO L290 TraceCheckUtils]: 72: Hoare triple {69052#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69077#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 12:44:14,368 INFO L290 TraceCheckUtils]: 73: Hoare triple {69077#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69077#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 12:44:14,369 INFO L290 TraceCheckUtils]: 74: Hoare triple {69077#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {69077#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 12:44:14,369 INFO L272 TraceCheckUtils]: 75: Hoare triple {69077#(< (+ 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)); {68853#true} is VALID [2022-04-28 12:44:14,369 INFO L290 TraceCheckUtils]: 76: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,369 INFO L290 TraceCheckUtils]: 77: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,369 INFO L290 TraceCheckUtils]: 78: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,369 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {68853#true} {69077#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {69077#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 12:44:14,370 INFO L290 TraceCheckUtils]: 80: Hoare triple {69077#(< (+ 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; {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:44:14,370 INFO L290 TraceCheckUtils]: 81: Hoare triple {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:44:14,370 INFO L290 TraceCheckUtils]: 82: Hoare triple {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:44:14,370 INFO L272 TraceCheckUtils]: 83: Hoare triple {69102#(< 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)); {68853#true} is VALID [2022-04-28 12:44:14,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,370 INFO L290 TraceCheckUtils]: 86: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,371 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {68853#true} {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:44:14,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:44:14,371 INFO L290 TraceCheckUtils]: 89: Hoare triple {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:44:14,372 INFO L290 TraceCheckUtils]: 90: Hoare triple {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:44:14,372 INFO L272 TraceCheckUtils]: 91: Hoare triple {69102#(< 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)); {68853#true} is VALID [2022-04-28 12:44:14,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,372 INFO L290 TraceCheckUtils]: 94: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,372 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {68853#true} {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {69102#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 12:44:14,373 INFO L290 TraceCheckUtils]: 96: Hoare triple {69102#(< 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; {69151#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 12:44:14,374 INFO L290 TraceCheckUtils]: 97: Hoare triple {69151#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69151#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 12:44:14,374 INFO L290 TraceCheckUtils]: 98: Hoare triple {69151#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {69151#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 12:44:14,374 INFO L272 TraceCheckUtils]: 99: Hoare triple {69151#(< 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)); {68853#true} is VALID [2022-04-28 12:44:14,374 INFO L290 TraceCheckUtils]: 100: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,374 INFO L290 TraceCheckUtils]: 101: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,374 INFO L290 TraceCheckUtils]: 102: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,375 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {68853#true} {69151#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {69151#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 12:44:14,375 INFO L290 TraceCheckUtils]: 104: Hoare triple {69151#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {68854#false} is VALID [2022-04-28 12:44:14,375 INFO L290 TraceCheckUtils]: 105: Hoare triple {68854#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {68854#false} is VALID [2022-04-28 12:44:14,375 INFO L290 TraceCheckUtils]: 106: Hoare triple {68854#false} assume !(#t~post8 < 50);havoc #t~post8; {68854#false} is VALID [2022-04-28 12:44:14,375 INFO L290 TraceCheckUtils]: 107: Hoare triple {68854#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {68854#false} is VALID [2022-04-28 12:44:14,376 INFO L290 TraceCheckUtils]: 108: Hoare triple {68854#false} assume !(#t~post6 < 50);havoc #t~post6; {68854#false} is VALID [2022-04-28 12:44:14,376 INFO L272 TraceCheckUtils]: 109: Hoare triple {68854#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {68854#false} is VALID [2022-04-28 12:44:14,376 INFO L290 TraceCheckUtils]: 110: Hoare triple {68854#false} ~cond := #in~cond; {68854#false} is VALID [2022-04-28 12:44:14,376 INFO L290 TraceCheckUtils]: 111: Hoare triple {68854#false} assume 0 == ~cond; {68854#false} is VALID [2022-04-28 12:44:14,376 INFO L290 TraceCheckUtils]: 112: Hoare triple {68854#false} assume !false; {68854#false} is VALID [2022-04-28 12:44:14,376 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-28 12:44:14,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:44:14,797 INFO L290 TraceCheckUtils]: 112: Hoare triple {68854#false} assume !false; {68854#false} is VALID [2022-04-28 12:44:14,797 INFO L290 TraceCheckUtils]: 111: Hoare triple {68854#false} assume 0 == ~cond; {68854#false} is VALID [2022-04-28 12:44:14,797 INFO L290 TraceCheckUtils]: 110: Hoare triple {68854#false} ~cond := #in~cond; {68854#false} is VALID [2022-04-28 12:44:14,797 INFO L272 TraceCheckUtils]: 109: Hoare triple {68854#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {68854#false} is VALID [2022-04-28 12:44:14,797 INFO L290 TraceCheckUtils]: 108: Hoare triple {68854#false} assume !(#t~post6 < 50);havoc #t~post6; {68854#false} is VALID [2022-04-28 12:44:14,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {68854#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {68854#false} is VALID [2022-04-28 12:44:14,797 INFO L290 TraceCheckUtils]: 106: Hoare triple {68854#false} assume !(#t~post8 < 50);havoc #t~post8; {68854#false} is VALID [2022-04-28 12:44:14,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {68854#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {68854#false} is VALID [2022-04-28 12:44:14,797 INFO L290 TraceCheckUtils]: 104: Hoare triple {69224#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {68854#false} is VALID [2022-04-28 12:44:14,798 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {68853#true} {69224#(not (< main_~r~0 0))} #98#return; {69224#(not (< main_~r~0 0))} is VALID [2022-04-28 12:44:14,798 INFO L290 TraceCheckUtils]: 102: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,798 INFO L290 TraceCheckUtils]: 101: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,798 INFO L290 TraceCheckUtils]: 100: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,798 INFO L272 TraceCheckUtils]: 99: Hoare triple {69224#(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)); {68853#true} is VALID [2022-04-28 12:44:14,798 INFO L290 TraceCheckUtils]: 98: Hoare triple {69224#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {69224#(not (< main_~r~0 0))} is VALID [2022-04-28 12:44:14,799 INFO L290 TraceCheckUtils]: 97: Hoare triple {69224#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69224#(not (< main_~r~0 0))} is VALID [2022-04-28 12:44:14,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {69249#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69224#(not (< main_~r~0 0))} is VALID [2022-04-28 12:44:14,800 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {68853#true} {69249#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {69249#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:44:14,800 INFO L290 TraceCheckUtils]: 94: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,800 INFO L290 TraceCheckUtils]: 93: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,800 INFO L290 TraceCheckUtils]: 92: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,800 INFO L272 TraceCheckUtils]: 91: Hoare triple {69249#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,800 INFO L290 TraceCheckUtils]: 90: Hoare triple {69249#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {69249#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:44:14,800 INFO L290 TraceCheckUtils]: 89: Hoare triple {69249#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69249#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:44:14,801 INFO L290 TraceCheckUtils]: 88: Hoare triple {69249#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {69249#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:44:14,801 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {68853#true} {69249#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {69249#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:44:14,801 INFO L290 TraceCheckUtils]: 86: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,801 INFO L290 TraceCheckUtils]: 85: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,801 INFO L290 TraceCheckUtils]: 84: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,801 INFO L272 TraceCheckUtils]: 83: Hoare triple {69249#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,801 INFO L290 TraceCheckUtils]: 82: Hoare triple {69249#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {69249#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:44:14,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {69249#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69249#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:44:14,802 INFO L290 TraceCheckUtils]: 80: Hoare triple {69298#(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; {69249#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:44:14,803 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {68853#true} {69298#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {69298#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:44:14,803 INFO L290 TraceCheckUtils]: 78: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,803 INFO L290 TraceCheckUtils]: 77: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,803 INFO L290 TraceCheckUtils]: 76: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,803 INFO L272 TraceCheckUtils]: 75: Hoare triple {69298#(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)); {68853#true} is VALID [2022-04-28 12:44:14,803 INFO L290 TraceCheckUtils]: 74: Hoare triple {69298#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {69298#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:44:14,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {69298#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69298#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:44:14,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {69323#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69298#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:44:14,805 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {68853#true} {69323#(<= main_~r~0 main_~u~0)} #96#return; {69323#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:44:14,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,806 INFO L272 TraceCheckUtils]: 67: Hoare triple {69323#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,806 INFO L290 TraceCheckUtils]: 66: Hoare triple {69323#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {69323#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:44:14,806 INFO L290 TraceCheckUtils]: 65: Hoare triple {69323#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69323#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:44:14,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69323#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 12:44:14,807 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {68853#true} {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,807 INFO L290 TraceCheckUtils]: 62: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,807 INFO L290 TraceCheckUtils]: 61: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,807 INFO L272 TraceCheckUtils]: 59: Hoare triple {69348#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 50);havoc #t~post7; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,809 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {68853#true} {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,809 INFO L272 TraceCheckUtils]: 51: Hoare triple {69348#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 50);havoc #t~post6; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,810 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {68853#true} {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,810 INFO L272 TraceCheckUtils]: 43: Hoare triple {69348#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 50);havoc #t~post8; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69348#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 12:44:14,812 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {68853#true} {69421#(<= 0 (+ main_~v~0 3))} #98#return; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,812 INFO L272 TraceCheckUtils]: 35: Hoare triple {69421#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,813 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {68853#true} {69421#(<= 0 (+ main_~v~0 3))} #96#return; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,814 INFO L272 TraceCheckUtils]: 27: Hoare triple {69421#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,815 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {68853#true} {69421#(<= 0 (+ main_~v~0 3))} #94#return; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {69421#(<= 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)); {68853#true} is VALID [2022-04-28 12:44:14,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 50);havoc #t~post6; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {69421#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {68853#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69421#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 12:44:14,816 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {68853#true} {68853#true} #92#return; {68853#true} is VALID [2022-04-28 12:44:14,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,816 INFO L272 TraceCheckUtils]: 11: Hoare triple {68853#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)); {68853#true} is VALID [2022-04-28 12:44:14,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {68853#true} {68853#true} #90#return; {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {68853#true} assume !(0 == ~cond); {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {68853#true} ~cond := #in~cond; {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {68853#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {68853#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; {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {68853#true} call #t~ret9 := main(); {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68853#true} {68853#true} #102#return; {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {68853#true} assume true; {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {68853#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {68853#true} is VALID [2022-04-28 12:44:14,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {68853#true} call ULTIMATE.init(); {68853#true} is VALID [2022-04-28 12:44:14,818 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-28 12:44:14,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:44:14,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76538841] [2022-04-28 12:44:14,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:44:14,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440276468] [2022-04-28 12:44:14,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440276468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:44:14,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:44:14,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 12:44:14,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:44:14,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [337088918] [2022-04-28 12:44:14,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [337088918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:44:14,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:44:14,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:44:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459069229] [2022-04-28 12:44:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:44:14,819 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-28 12:44:14,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:44:14,819 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-28 12:44:14,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-28 12:44:14,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:44:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:14,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:44:14,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:44:14,889 INFO L87 Difference]: Start difference. First operand 592 states and 792 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-28 12:44:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:17,211 INFO L93 Difference]: Finished difference Result 894 states and 1248 transitions. [2022-04-28 12:44:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:44:17,211 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-28 12:44:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:44:17,211 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-28 12:44:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-28 12:44:17,212 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-28 12:44:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-28 12:44:17,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-28 12:44:17,333 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-28 12:44:17,366 INFO L225 Difference]: With dead ends: 894 [2022-04-28 12:44:17,366 INFO L226 Difference]: Without dead ends: 743 [2022-04-28 12:44:17,367 INFO L412 NwaCegarLoop]: 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-28 12:44:17,367 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 72 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:44:17,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 350 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:44:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-04-28 12:44:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 592. [2022-04-28 12:44:18,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:44:18,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 743 states. Second operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:18,855 INFO L74 IsIncluded]: Start isIncluded. First operand 743 states. Second operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:18,856 INFO L87 Difference]: Start difference. First operand 743 states. Second operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:18,885 INFO L93 Difference]: Finished difference Result 743 states and 1013 transitions. [2022-04-28 12:44:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1013 transitions. [2022-04-28 12:44:18,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:18,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:18,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 743 states. [2022-04-28 12:44:18,886 INFO L87 Difference]: Start difference. First operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 743 states. [2022-04-28 12:44:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:18,905 INFO L93 Difference]: Finished difference Result 743 states and 1013 transitions. [2022-04-28 12:44:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1013 transitions. [2022-04-28 12:44:18,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:18,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:18,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:44:18,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:44:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 442 states have (on average 1.2217194570135748) internal successors, (540), 452 states have internal predecessors, (540), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 792 transitions. [2022-04-28 12:44:18,922 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 792 transitions. Word has length 113 [2022-04-28 12:44:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:44:18,922 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 792 transitions. [2022-04-28 12:44:18,923 INFO L496 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-28 12:44:18,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 592 states and 792 transitions. [2022-04-28 12:44:33,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 792 edges. 791 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 792 transitions. [2022-04-28 12:44:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 12:44:33,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:44:33,089 INFO L195 NwaCegarLoop]: 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-28 12:44:33,105 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-28 12:44:33,289 WARN L477 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-28 12:44:33,289 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:44:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:44:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-28 12:44:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:33,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053229400] [2022-04-28 12:44:33,290 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:44:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-28 12:44:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:44:33,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492228735] [2022-04-28 12:44:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:44:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:44:33,301 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:44:33,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518964925] [2022-04-28 12:44:33,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:44:33,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:44:33,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:44:33,302 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-28 12:44:33,305 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-28 12:44:33,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:44:33,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:44:33,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 12:44:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:44:33,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:44:34,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {74012#true} call ULTIMATE.init(); {74012#true} is VALID [2022-04-28 12:44:34,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {74012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {74020#(<= ~counter~0 0)} assume true; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74020#(<= ~counter~0 0)} {74012#true} #102#return; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {74020#(<= ~counter~0 0)} call #t~ret9 := main(); {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {74020#(<= ~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; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {74020#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {74020#(<= ~counter~0 0)} ~cond := #in~cond; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {74020#(<= ~counter~0 0)} assume !(0 == ~cond); {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {74020#(<= ~counter~0 0)} assume true; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74020#(<= ~counter~0 0)} {74020#(<= ~counter~0 0)} #90#return; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,179 INFO L272 TraceCheckUtils]: 11: Hoare triple {74020#(<= ~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)); {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {74020#(<= ~counter~0 0)} ~cond := #in~cond; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {74020#(<= ~counter~0 0)} assume !(0 == ~cond); {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {74020#(<= ~counter~0 0)} assume true; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,180 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74020#(<= ~counter~0 0)} {74020#(<= ~counter~0 0)} #92#return; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {74020#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74020#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:34,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {74020#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74069#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:34,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {74069#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {74069#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:34,183 INFO L272 TraceCheckUtils]: 19: Hoare triple {74069#(<= ~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)); {74069#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:34,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {74069#(<= ~counter~0 1)} ~cond := #in~cond; {74069#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:34,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {74069#(<= ~counter~0 1)} assume !(0 == ~cond); {74069#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:34,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {74069#(<= ~counter~0 1)} assume true; {74069#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:34,184 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74069#(<= ~counter~0 1)} {74069#(<= ~counter~0 1)} #94#return; {74069#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:34,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {74069#(<= ~counter~0 1)} assume !!(0 != ~r~0); {74069#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:34,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {74069#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74094#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:34,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {74094#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {74094#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:34,186 INFO L272 TraceCheckUtils]: 27: Hoare triple {74094#(<= ~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)); {74094#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:34,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {74094#(<= ~counter~0 2)} ~cond := #in~cond; {74094#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:34,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {74094#(<= ~counter~0 2)} assume !(0 == ~cond); {74094#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:34,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {74094#(<= ~counter~0 2)} assume true; {74094#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:34,187 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74094#(<= ~counter~0 2)} {74094#(<= ~counter~0 2)} #96#return; {74094#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:34,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {74094#(<= ~counter~0 2)} assume !(~r~0 > 0); {74094#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:34,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {74094#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74119#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:34,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {74119#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {74119#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:34,188 INFO L272 TraceCheckUtils]: 35: Hoare triple {74119#(<= ~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)); {74119#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:34,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {74119#(<= ~counter~0 3)} ~cond := #in~cond; {74119#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:34,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {74119#(<= ~counter~0 3)} assume !(0 == ~cond); {74119#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:34,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {74119#(<= ~counter~0 3)} assume true; {74119#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:34,190 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74119#(<= ~counter~0 3)} {74119#(<= ~counter~0 3)} #98#return; {74119#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:34,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {74119#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74119#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:34,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {74119#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74144#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:34,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {74144#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {74144#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:34,191 INFO L272 TraceCheckUtils]: 43: Hoare triple {74144#(<= ~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)); {74144#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:34,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {74144#(<= ~counter~0 4)} ~cond := #in~cond; {74144#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:34,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {74144#(<= ~counter~0 4)} assume !(0 == ~cond); {74144#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:34,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {74144#(<= ~counter~0 4)} assume true; {74144#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:34,193 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74144#(<= ~counter~0 4)} {74144#(<= ~counter~0 4)} #98#return; {74144#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:34,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {74144#(<= ~counter~0 4)} assume !(~r~0 < 0); {74144#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:34,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {74144#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74169#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:34,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {74169#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {74169#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:34,194 INFO L272 TraceCheckUtils]: 51: Hoare triple {74169#(<= ~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)); {74169#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:34,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {74169#(<= ~counter~0 5)} ~cond := #in~cond; {74169#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:34,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {74169#(<= ~counter~0 5)} assume !(0 == ~cond); {74169#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:34,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {74169#(<= ~counter~0 5)} assume true; {74169#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:34,196 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74169#(<= ~counter~0 5)} {74169#(<= ~counter~0 5)} #94#return; {74169#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:34,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {74169#(<= ~counter~0 5)} assume !!(0 != ~r~0); {74169#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:34,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {74169#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74194#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:34,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {74194#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {74194#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:34,197 INFO L272 TraceCheckUtils]: 59: Hoare triple {74194#(<= ~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)); {74194#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:34,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {74194#(<= ~counter~0 6)} ~cond := #in~cond; {74194#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:34,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {74194#(<= ~counter~0 6)} assume !(0 == ~cond); {74194#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:34,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {74194#(<= ~counter~0 6)} assume true; {74194#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:34,199 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74194#(<= ~counter~0 6)} {74194#(<= ~counter~0 6)} #96#return; {74194#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:34,199 INFO L290 TraceCheckUtils]: 64: Hoare triple {74194#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74194#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:34,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {74194#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74219#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:34,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {74219#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {74219#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:34,200 INFO L272 TraceCheckUtils]: 67: Hoare triple {74219#(<= ~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)); {74219#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:34,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {74219#(<= ~counter~0 7)} ~cond := #in~cond; {74219#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:34,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {74219#(<= ~counter~0 7)} assume !(0 == ~cond); {74219#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:34,201 INFO L290 TraceCheckUtils]: 70: Hoare triple {74219#(<= ~counter~0 7)} assume true; {74219#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:34,202 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74219#(<= ~counter~0 7)} {74219#(<= ~counter~0 7)} #96#return; {74219#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:34,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {74219#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74219#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:34,203 INFO L290 TraceCheckUtils]: 73: Hoare triple {74219#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74244#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:34,203 INFO L290 TraceCheckUtils]: 74: Hoare triple {74244#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {74244#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:34,204 INFO L272 TraceCheckUtils]: 75: Hoare triple {74244#(<= ~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)); {74244#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:34,204 INFO L290 TraceCheckUtils]: 76: Hoare triple {74244#(<= ~counter~0 8)} ~cond := #in~cond; {74244#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:34,204 INFO L290 TraceCheckUtils]: 77: Hoare triple {74244#(<= ~counter~0 8)} assume !(0 == ~cond); {74244#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:34,204 INFO L290 TraceCheckUtils]: 78: Hoare triple {74244#(<= ~counter~0 8)} assume true; {74244#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:34,205 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74244#(<= ~counter~0 8)} {74244#(<= ~counter~0 8)} #96#return; {74244#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:34,205 INFO L290 TraceCheckUtils]: 80: Hoare triple {74244#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74244#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:34,206 INFO L290 TraceCheckUtils]: 81: Hoare triple {74244#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74269#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:34,206 INFO L290 TraceCheckUtils]: 82: Hoare triple {74269#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {74269#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:34,207 INFO L272 TraceCheckUtils]: 83: Hoare triple {74269#(<= ~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)); {74269#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:34,207 INFO L290 TraceCheckUtils]: 84: Hoare triple {74269#(<= ~counter~0 9)} ~cond := #in~cond; {74269#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:34,207 INFO L290 TraceCheckUtils]: 85: Hoare triple {74269#(<= ~counter~0 9)} assume !(0 == ~cond); {74269#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:34,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {74269#(<= ~counter~0 9)} assume true; {74269#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:34,208 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74269#(<= ~counter~0 9)} {74269#(<= ~counter~0 9)} #96#return; {74269#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:34,208 INFO L290 TraceCheckUtils]: 88: Hoare triple {74269#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74269#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:34,209 INFO L290 TraceCheckUtils]: 89: Hoare triple {74269#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74294#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:34,209 INFO L290 TraceCheckUtils]: 90: Hoare triple {74294#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {74294#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:34,210 INFO L272 TraceCheckUtils]: 91: Hoare triple {74294#(<= ~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)); {74294#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:34,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {74294#(<= ~counter~0 10)} ~cond := #in~cond; {74294#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:34,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {74294#(<= ~counter~0 10)} assume !(0 == ~cond); {74294#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:34,210 INFO L290 TraceCheckUtils]: 94: Hoare triple {74294#(<= ~counter~0 10)} assume true; {74294#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:34,211 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74294#(<= ~counter~0 10)} {74294#(<= ~counter~0 10)} #96#return; {74294#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:34,211 INFO L290 TraceCheckUtils]: 96: Hoare triple {74294#(<= ~counter~0 10)} assume !(~r~0 > 0); {74294#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:34,212 INFO L290 TraceCheckUtils]: 97: Hoare triple {74294#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74319#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:34,213 INFO L290 TraceCheckUtils]: 98: Hoare triple {74319#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {74319#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:34,213 INFO L272 TraceCheckUtils]: 99: Hoare triple {74319#(<= ~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)); {74319#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:34,214 INFO L290 TraceCheckUtils]: 100: Hoare triple {74319#(<= ~counter~0 11)} ~cond := #in~cond; {74319#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:34,214 INFO L290 TraceCheckUtils]: 101: Hoare triple {74319#(<= ~counter~0 11)} assume !(0 == ~cond); {74319#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:34,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {74319#(<= ~counter~0 11)} assume true; {74319#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:34,215 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74319#(<= ~counter~0 11)} {74319#(<= ~counter~0 11)} #98#return; {74319#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:34,215 INFO L290 TraceCheckUtils]: 104: Hoare triple {74319#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74319#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:34,215 INFO L290 TraceCheckUtils]: 105: Hoare triple {74319#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74344#(<= |main_#t~post8| 11)} is VALID [2022-04-28 12:44:34,216 INFO L290 TraceCheckUtils]: 106: Hoare triple {74344#(<= |main_#t~post8| 11)} assume !(#t~post8 < 50);havoc #t~post8; {74013#false} is VALID [2022-04-28 12:44:34,216 INFO L290 TraceCheckUtils]: 107: Hoare triple {74013#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74013#false} is VALID [2022-04-28 12:44:34,216 INFO L290 TraceCheckUtils]: 108: Hoare triple {74013#false} assume !(#t~post6 < 50);havoc #t~post6; {74013#false} is VALID [2022-04-28 12:44:34,216 INFO L272 TraceCheckUtils]: 109: Hoare triple {74013#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74013#false} is VALID [2022-04-28 12:44:34,216 INFO L290 TraceCheckUtils]: 110: Hoare triple {74013#false} ~cond := #in~cond; {74013#false} is VALID [2022-04-28 12:44:34,216 INFO L290 TraceCheckUtils]: 111: Hoare triple {74013#false} assume 0 == ~cond; {74013#false} is VALID [2022-04-28 12:44:34,216 INFO L290 TraceCheckUtils]: 112: Hoare triple {74013#false} assume !false; {74013#false} is VALID [2022-04-28 12:44:34,216 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-28 12:44:34,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:44:34,726 INFO L290 TraceCheckUtils]: 112: Hoare triple {74013#false} assume !false; {74013#false} is VALID [2022-04-28 12:44:34,726 INFO L290 TraceCheckUtils]: 111: Hoare triple {74013#false} assume 0 == ~cond; {74013#false} is VALID [2022-04-28 12:44:34,726 INFO L290 TraceCheckUtils]: 110: Hoare triple {74013#false} ~cond := #in~cond; {74013#false} is VALID [2022-04-28 12:44:34,726 INFO L272 TraceCheckUtils]: 109: Hoare triple {74013#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74013#false} is VALID [2022-04-28 12:44:34,726 INFO L290 TraceCheckUtils]: 108: Hoare triple {74013#false} assume !(#t~post6 < 50);havoc #t~post6; {74013#false} is VALID [2022-04-28 12:44:34,727 INFO L290 TraceCheckUtils]: 107: Hoare triple {74013#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74013#false} is VALID [2022-04-28 12:44:34,727 INFO L290 TraceCheckUtils]: 106: Hoare triple {74384#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {74013#false} is VALID [2022-04-28 12:44:34,727 INFO L290 TraceCheckUtils]: 105: Hoare triple {74388#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74384#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:44:34,727 INFO L290 TraceCheckUtils]: 104: Hoare triple {74388#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74388#(< ~counter~0 50)} is VALID [2022-04-28 12:44:34,727 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74012#true} {74388#(< ~counter~0 50)} #98#return; {74388#(< ~counter~0 50)} is VALID [2022-04-28 12:44:34,727 INFO L290 TraceCheckUtils]: 102: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,728 INFO L290 TraceCheckUtils]: 101: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,728 INFO L290 TraceCheckUtils]: 100: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,728 INFO L272 TraceCheckUtils]: 99: Hoare triple {74388#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,728 INFO L290 TraceCheckUtils]: 98: Hoare triple {74388#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {74388#(< ~counter~0 50)} is VALID [2022-04-28 12:44:34,729 INFO L290 TraceCheckUtils]: 97: Hoare triple {74413#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74388#(< ~counter~0 50)} is VALID [2022-04-28 12:44:34,729 INFO L290 TraceCheckUtils]: 96: Hoare triple {74413#(< ~counter~0 49)} assume !(~r~0 > 0); {74413#(< ~counter~0 49)} is VALID [2022-04-28 12:44:34,730 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74012#true} {74413#(< ~counter~0 49)} #96#return; {74413#(< ~counter~0 49)} is VALID [2022-04-28 12:44:34,730 INFO L290 TraceCheckUtils]: 94: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,730 INFO L290 TraceCheckUtils]: 93: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,730 INFO L290 TraceCheckUtils]: 92: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,730 INFO L272 TraceCheckUtils]: 91: Hoare triple {74413#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,730 INFO L290 TraceCheckUtils]: 90: Hoare triple {74413#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {74413#(< ~counter~0 49)} is VALID [2022-04-28 12:44:34,731 INFO L290 TraceCheckUtils]: 89: Hoare triple {74438#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74413#(< ~counter~0 49)} is VALID [2022-04-28 12:44:34,731 INFO L290 TraceCheckUtils]: 88: Hoare triple {74438#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74438#(< ~counter~0 48)} is VALID [2022-04-28 12:44:34,731 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74012#true} {74438#(< ~counter~0 48)} #96#return; {74438#(< ~counter~0 48)} is VALID [2022-04-28 12:44:34,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,731 INFO L290 TraceCheckUtils]: 85: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,731 INFO L272 TraceCheckUtils]: 83: Hoare triple {74438#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {74438#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {74438#(< ~counter~0 48)} is VALID [2022-04-28 12:44:34,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {74463#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74438#(< ~counter~0 48)} is VALID [2022-04-28 12:44:34,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {74463#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74463#(< ~counter~0 47)} is VALID [2022-04-28 12:44:34,733 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74012#true} {74463#(< ~counter~0 47)} #96#return; {74463#(< ~counter~0 47)} is VALID [2022-04-28 12:44:34,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,733 INFO L290 TraceCheckUtils]: 77: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,733 INFO L290 TraceCheckUtils]: 76: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,733 INFO L272 TraceCheckUtils]: 75: Hoare triple {74463#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {74463#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {74463#(< ~counter~0 47)} is VALID [2022-04-28 12:44:34,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {74488#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74463#(< ~counter~0 47)} is VALID [2022-04-28 12:44:34,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {74488#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74488#(< ~counter~0 46)} is VALID [2022-04-28 12:44:34,734 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74012#true} {74488#(< ~counter~0 46)} #96#return; {74488#(< ~counter~0 46)} is VALID [2022-04-28 12:44:34,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,734 INFO L272 TraceCheckUtils]: 67: Hoare triple {74488#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {74488#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {74488#(< ~counter~0 46)} is VALID [2022-04-28 12:44:34,735 INFO L290 TraceCheckUtils]: 65: Hoare triple {74513#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74488#(< ~counter~0 46)} is VALID [2022-04-28 12:44:34,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {74513#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74513#(< ~counter~0 45)} is VALID [2022-04-28 12:44:34,757 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74012#true} {74513#(< ~counter~0 45)} #96#return; {74513#(< ~counter~0 45)} is VALID [2022-04-28 12:44:34,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,757 INFO L290 TraceCheckUtils]: 60: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,758 INFO L272 TraceCheckUtils]: 59: Hoare triple {74513#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {74513#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {74513#(< ~counter~0 45)} is VALID [2022-04-28 12:44:34,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {74538#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74513#(< ~counter~0 45)} is VALID [2022-04-28 12:44:34,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {74538#(< ~counter~0 44)} assume !!(0 != ~r~0); {74538#(< ~counter~0 44)} is VALID [2022-04-28 12:44:34,760 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74012#true} {74538#(< ~counter~0 44)} #94#return; {74538#(< ~counter~0 44)} is VALID [2022-04-28 12:44:34,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,761 INFO L272 TraceCheckUtils]: 51: Hoare triple {74538#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {74538#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {74538#(< ~counter~0 44)} is VALID [2022-04-28 12:44:34,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {74563#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74538#(< ~counter~0 44)} is VALID [2022-04-28 12:44:34,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {74563#(< ~counter~0 43)} assume !(~r~0 < 0); {74563#(< ~counter~0 43)} is VALID [2022-04-28 12:44:34,763 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74012#true} {74563#(< ~counter~0 43)} #98#return; {74563#(< ~counter~0 43)} is VALID [2022-04-28 12:44:34,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,763 INFO L272 TraceCheckUtils]: 43: Hoare triple {74563#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {74563#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {74563#(< ~counter~0 43)} is VALID [2022-04-28 12:44:34,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {74588#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74563#(< ~counter~0 43)} is VALID [2022-04-28 12:44:34,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {74588#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74588#(< ~counter~0 42)} is VALID [2022-04-28 12:44:34,765 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74012#true} {74588#(< ~counter~0 42)} #98#return; {74588#(< ~counter~0 42)} is VALID [2022-04-28 12:44:34,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,765 INFO L272 TraceCheckUtils]: 35: Hoare triple {74588#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {74588#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {74588#(< ~counter~0 42)} is VALID [2022-04-28 12:44:34,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {74613#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74588#(< ~counter~0 42)} is VALID [2022-04-28 12:44:34,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {74613#(< ~counter~0 41)} assume !(~r~0 > 0); {74613#(< ~counter~0 41)} is VALID [2022-04-28 12:44:34,767 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74012#true} {74613#(< ~counter~0 41)} #96#return; {74613#(< ~counter~0 41)} is VALID [2022-04-28 12:44:34,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,767 INFO L272 TraceCheckUtils]: 27: Hoare triple {74613#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {74613#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {74613#(< ~counter~0 41)} is VALID [2022-04-28 12:44:34,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {74638#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74613#(< ~counter~0 41)} is VALID [2022-04-28 12:44:34,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {74638#(< ~counter~0 40)} assume !!(0 != ~r~0); {74638#(< ~counter~0 40)} is VALID [2022-04-28 12:44:34,769 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74012#true} {74638#(< ~counter~0 40)} #94#return; {74638#(< ~counter~0 40)} is VALID [2022-04-28 12:44:34,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,769 INFO L272 TraceCheckUtils]: 19: Hoare triple {74638#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {74638#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {74638#(< ~counter~0 40)} is VALID [2022-04-28 12:44:34,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {74663#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74638#(< ~counter~0 40)} is VALID [2022-04-28 12:44:34,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {74663#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74663#(< ~counter~0 39)} is VALID [2022-04-28 12:44:34,771 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74012#true} {74663#(< ~counter~0 39)} #92#return; {74663#(< ~counter~0 39)} is VALID [2022-04-28 12:44:34,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,771 INFO L272 TraceCheckUtils]: 11: Hoare triple {74663#(< ~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)); {74012#true} is VALID [2022-04-28 12:44:34,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74012#true} {74663#(< ~counter~0 39)} #90#return; {74663#(< ~counter~0 39)} is VALID [2022-04-28 12:44:34,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {74012#true} assume true; {74012#true} is VALID [2022-04-28 12:44:34,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {74012#true} assume !(0 == ~cond); {74012#true} is VALID [2022-04-28 12:44:34,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {74012#true} ~cond := #in~cond; {74012#true} is VALID [2022-04-28 12:44:34,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {74663#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74012#true} is VALID [2022-04-28 12:44:34,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {74663#(< ~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; {74663#(< ~counter~0 39)} is VALID [2022-04-28 12:44:34,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {74663#(< ~counter~0 39)} call #t~ret9 := main(); {74663#(< ~counter~0 39)} is VALID [2022-04-28 12:44:34,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74663#(< ~counter~0 39)} {74012#true} #102#return; {74663#(< ~counter~0 39)} is VALID [2022-04-28 12:44:34,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {74663#(< ~counter~0 39)} assume true; {74663#(< ~counter~0 39)} is VALID [2022-04-28 12:44:34,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {74012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {74663#(< ~counter~0 39)} is VALID [2022-04-28 12:44:34,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {74012#true} call ULTIMATE.init(); {74012#true} is VALID [2022-04-28 12:44:34,774 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-28 12:44:34,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:44:34,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492228735] [2022-04-28 12:44:34,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:44:34,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518964925] [2022-04-28 12:44:34,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518964925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:44:34,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:44:34,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 12:44:34,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:44:34,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053229400] [2022-04-28 12:44:34,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053229400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:44:34,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:44:34,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:44:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766064807] [2022-04-28 12:44:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:44:34,775 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-28 12:44:34,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:44:34,775 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-28 12:44:34,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:34,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:44:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:44:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 12:44:34,861 INFO L87 Difference]: Start difference. First operand 592 states and 792 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-28 12:44:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:36,932 INFO L93 Difference]: Finished difference Result 817 states and 1128 transitions. [2022-04-28 12:44:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 12:44:36,932 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-28 12:44:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:44:36,932 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-28 12:44:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-28 12:44:36,934 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-28 12:44:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-28 12:44:36,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-28 12:44:37,154 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-28 12:44:37,170 INFO L225 Difference]: With dead ends: 817 [2022-04-28 12:44:37,170 INFO L226 Difference]: Without dead ends: 620 [2022-04-28 12:44:37,170 INFO L412 NwaCegarLoop]: 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-28 12:44:37,171 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 144 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:44:37,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 287 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:44:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-04-28 12:44:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 610. [2022-04-28 12:44:38,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:44:38,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 620 states. Second operand has 610 states, 460 states have (on average 1.2217391304347827) internal successors, (562), 464 states have internal predecessors, (562), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:38,150 INFO L74 IsIncluded]: Start isIncluded. First operand 620 states. Second operand has 610 states, 460 states have (on average 1.2217391304347827) internal successors, (562), 464 states have internal predecessors, (562), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:38,150 INFO L87 Difference]: Start difference. First operand 620 states. Second operand has 610 states, 460 states have (on average 1.2217391304347827) internal successors, (562), 464 states have internal predecessors, (562), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:38,163 INFO L93 Difference]: Finished difference Result 620 states and 824 transitions. [2022-04-28 12:44:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 824 transitions. [2022-04-28 12:44:38,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:38,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:38,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 460 states have (on average 1.2217391304347827) internal successors, (562), 464 states have internal predecessors, (562), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 620 states. [2022-04-28 12:44:38,165 INFO L87 Difference]: Start difference. First operand has 610 states, 460 states have (on average 1.2217391304347827) internal successors, (562), 464 states have internal predecessors, (562), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 620 states. [2022-04-28 12:44:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:38,178 INFO L93 Difference]: Finished difference Result 620 states and 824 transitions. [2022-04-28 12:44:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 824 transitions. [2022-04-28 12:44:38,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:38,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:38,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:44:38,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:44:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 460 states have (on average 1.2217391304347827) internal successors, (562), 464 states have internal predecessors, (562), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 814 transitions. [2022-04-28 12:44:38,196 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 814 transitions. Word has length 113 [2022-04-28 12:44:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:44:38,196 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 814 transitions. [2022-04-28 12:44:38,196 INFO L496 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-28 12:44:38,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 610 states and 814 transitions. [2022-04-28 12:44:53,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 814 edges. 811 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 814 transitions. [2022-04-28 12:44:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 12:44:53,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:44:53,538 INFO L195 NwaCegarLoop]: 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-28 12:44:53,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-28 12:44:53,738 WARN L477 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-28 12:44:53,738 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:44:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:44:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-28 12:44:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:53,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [315696151] [2022-04-28 12:44:53,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:44:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-28 12:44:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:44:53,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885936532] [2022-04-28 12:44:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:44:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:44:53,751 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:44:53,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845316901] [2022-04-28 12:44:53,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:44:53,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:44:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:44:53,752 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-28 12:44:53,764 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-28 12:44:53,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:44:53,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:44:53,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 12:44:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:44:53,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:44:54,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {78829#true} call ULTIMATE.init(); {78829#true} is VALID [2022-04-28 12:44:54,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {78829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {78837#(<= ~counter~0 0)} assume true; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78837#(<= ~counter~0 0)} {78829#true} #102#return; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {78837#(<= ~counter~0 0)} call #t~ret9 := main(); {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {78837#(<= ~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; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,424 INFO L272 TraceCheckUtils]: 6: Hoare triple {78837#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {78837#(<= ~counter~0 0)} ~cond := #in~cond; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {78837#(<= ~counter~0 0)} assume !(0 == ~cond); {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {78837#(<= ~counter~0 0)} assume true; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,426 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78837#(<= ~counter~0 0)} {78837#(<= ~counter~0 0)} #90#return; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,426 INFO L272 TraceCheckUtils]: 11: Hoare triple {78837#(<= ~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)); {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {78837#(<= ~counter~0 0)} ~cond := #in~cond; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {78837#(<= ~counter~0 0)} assume !(0 == ~cond); {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {78837#(<= ~counter~0 0)} assume true; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,427 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78837#(<= ~counter~0 0)} {78837#(<= ~counter~0 0)} #92#return; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {78837#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {78837#(<= ~counter~0 0)} is VALID [2022-04-28 12:44:54,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {78837#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78886#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:54,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {78886#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {78886#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:54,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {78886#(<= ~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)); {78886#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:54,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {78886#(<= ~counter~0 1)} ~cond := #in~cond; {78886#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:54,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {78886#(<= ~counter~0 1)} assume !(0 == ~cond); {78886#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:54,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {78886#(<= ~counter~0 1)} assume true; {78886#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:54,431 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {78886#(<= ~counter~0 1)} {78886#(<= ~counter~0 1)} #94#return; {78886#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:54,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {78886#(<= ~counter~0 1)} assume !!(0 != ~r~0); {78886#(<= ~counter~0 1)} is VALID [2022-04-28 12:44:54,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {78886#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78911#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:54,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {78911#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {78911#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:54,433 INFO L272 TraceCheckUtils]: 27: Hoare triple {78911#(<= ~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)); {78911#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:54,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {78911#(<= ~counter~0 2)} ~cond := #in~cond; {78911#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:54,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {78911#(<= ~counter~0 2)} assume !(0 == ~cond); {78911#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:54,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {78911#(<= ~counter~0 2)} assume true; {78911#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:54,434 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {78911#(<= ~counter~0 2)} {78911#(<= ~counter~0 2)} #96#return; {78911#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:54,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {78911#(<= ~counter~0 2)} assume !(~r~0 > 0); {78911#(<= ~counter~0 2)} is VALID [2022-04-28 12:44:54,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {78911#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78936#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:54,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {78936#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {78936#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:54,436 INFO L272 TraceCheckUtils]: 35: Hoare triple {78936#(<= ~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)); {78936#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:54,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {78936#(<= ~counter~0 3)} ~cond := #in~cond; {78936#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:54,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {78936#(<= ~counter~0 3)} assume !(0 == ~cond); {78936#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:54,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {78936#(<= ~counter~0 3)} assume true; {78936#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:54,437 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {78936#(<= ~counter~0 3)} {78936#(<= ~counter~0 3)} #98#return; {78936#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:54,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {78936#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {78936#(<= ~counter~0 3)} is VALID [2022-04-28 12:44:54,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {78936#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78961#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:54,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {78961#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {78961#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:54,439 INFO L272 TraceCheckUtils]: 43: Hoare triple {78961#(<= ~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)); {78961#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:54,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {78961#(<= ~counter~0 4)} ~cond := #in~cond; {78961#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:54,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {78961#(<= ~counter~0 4)} assume !(0 == ~cond); {78961#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:54,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {78961#(<= ~counter~0 4)} assume true; {78961#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:54,440 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {78961#(<= ~counter~0 4)} {78961#(<= ~counter~0 4)} #98#return; {78961#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:54,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {78961#(<= ~counter~0 4)} assume !(~r~0 < 0); {78961#(<= ~counter~0 4)} is VALID [2022-04-28 12:44:54,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {78961#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78986#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:54,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {78986#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {78986#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:54,442 INFO L272 TraceCheckUtils]: 51: Hoare triple {78986#(<= ~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)); {78986#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:54,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {78986#(<= ~counter~0 5)} ~cond := #in~cond; {78986#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:54,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {78986#(<= ~counter~0 5)} assume !(0 == ~cond); {78986#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:54,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {78986#(<= ~counter~0 5)} assume true; {78986#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:54,443 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {78986#(<= ~counter~0 5)} {78986#(<= ~counter~0 5)} #94#return; {78986#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:54,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {78986#(<= ~counter~0 5)} assume !!(0 != ~r~0); {78986#(<= ~counter~0 5)} is VALID [2022-04-28 12:44:54,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {78986#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79011#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:54,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {79011#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {79011#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:54,445 INFO L272 TraceCheckUtils]: 59: Hoare triple {79011#(<= ~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)); {79011#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:54,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {79011#(<= ~counter~0 6)} ~cond := #in~cond; {79011#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:54,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {79011#(<= ~counter~0 6)} assume !(0 == ~cond); {79011#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:54,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {79011#(<= ~counter~0 6)} assume true; {79011#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:54,446 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79011#(<= ~counter~0 6)} {79011#(<= ~counter~0 6)} #96#return; {79011#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:54,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {79011#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79011#(<= ~counter~0 6)} is VALID [2022-04-28 12:44:54,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {79011#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79036#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:54,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {79036#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {79036#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:54,448 INFO L272 TraceCheckUtils]: 67: Hoare triple {79036#(<= ~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)); {79036#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:54,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {79036#(<= ~counter~0 7)} ~cond := #in~cond; {79036#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:54,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {79036#(<= ~counter~0 7)} assume !(0 == ~cond); {79036#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:54,449 INFO L290 TraceCheckUtils]: 70: Hoare triple {79036#(<= ~counter~0 7)} assume true; {79036#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:54,449 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79036#(<= ~counter~0 7)} {79036#(<= ~counter~0 7)} #96#return; {79036#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:54,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {79036#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79036#(<= ~counter~0 7)} is VALID [2022-04-28 12:44:54,450 INFO L290 TraceCheckUtils]: 73: Hoare triple {79036#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79061#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:54,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {79061#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {79061#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:54,451 INFO L272 TraceCheckUtils]: 75: Hoare triple {79061#(<= ~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)); {79061#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:54,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {79061#(<= ~counter~0 8)} ~cond := #in~cond; {79061#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:54,451 INFO L290 TraceCheckUtils]: 77: Hoare triple {79061#(<= ~counter~0 8)} assume !(0 == ~cond); {79061#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:54,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {79061#(<= ~counter~0 8)} assume true; {79061#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:54,452 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79061#(<= ~counter~0 8)} {79061#(<= ~counter~0 8)} #96#return; {79061#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:54,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {79061#(<= ~counter~0 8)} assume !(~r~0 > 0); {79061#(<= ~counter~0 8)} is VALID [2022-04-28 12:44:54,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {79061#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79086#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:54,453 INFO L290 TraceCheckUtils]: 82: Hoare triple {79086#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {79086#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:54,454 INFO L272 TraceCheckUtils]: 83: Hoare triple {79086#(<= ~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)); {79086#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:54,454 INFO L290 TraceCheckUtils]: 84: Hoare triple {79086#(<= ~counter~0 9)} ~cond := #in~cond; {79086#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:54,454 INFO L290 TraceCheckUtils]: 85: Hoare triple {79086#(<= ~counter~0 9)} assume !(0 == ~cond); {79086#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:54,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {79086#(<= ~counter~0 9)} assume true; {79086#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:54,455 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79086#(<= ~counter~0 9)} {79086#(<= ~counter~0 9)} #98#return; {79086#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:54,455 INFO L290 TraceCheckUtils]: 88: Hoare triple {79086#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79086#(<= ~counter~0 9)} is VALID [2022-04-28 12:44:54,456 INFO L290 TraceCheckUtils]: 89: Hoare triple {79086#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79111#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:54,456 INFO L290 TraceCheckUtils]: 90: Hoare triple {79111#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {79111#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:54,457 INFO L272 TraceCheckUtils]: 91: Hoare triple {79111#(<= ~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)); {79111#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:54,457 INFO L290 TraceCheckUtils]: 92: Hoare triple {79111#(<= ~counter~0 10)} ~cond := #in~cond; {79111#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:54,457 INFO L290 TraceCheckUtils]: 93: Hoare triple {79111#(<= ~counter~0 10)} assume !(0 == ~cond); {79111#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:54,458 INFO L290 TraceCheckUtils]: 94: Hoare triple {79111#(<= ~counter~0 10)} assume true; {79111#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:54,458 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79111#(<= ~counter~0 10)} {79111#(<= ~counter~0 10)} #98#return; {79111#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:54,458 INFO L290 TraceCheckUtils]: 96: Hoare triple {79111#(<= ~counter~0 10)} assume !(~r~0 < 0); {79111#(<= ~counter~0 10)} is VALID [2022-04-28 12:44:54,459 INFO L290 TraceCheckUtils]: 97: Hoare triple {79111#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79136#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:54,459 INFO L290 TraceCheckUtils]: 98: Hoare triple {79136#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {79136#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:54,460 INFO L272 TraceCheckUtils]: 99: Hoare triple {79136#(<= ~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)); {79136#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:54,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {79136#(<= ~counter~0 11)} ~cond := #in~cond; {79136#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:54,460 INFO L290 TraceCheckUtils]: 101: Hoare triple {79136#(<= ~counter~0 11)} assume !(0 == ~cond); {79136#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:54,461 INFO L290 TraceCheckUtils]: 102: Hoare triple {79136#(<= ~counter~0 11)} assume true; {79136#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:54,461 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79136#(<= ~counter~0 11)} {79136#(<= ~counter~0 11)} #94#return; {79136#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:54,461 INFO L290 TraceCheckUtils]: 104: Hoare triple {79136#(<= ~counter~0 11)} assume !!(0 != ~r~0); {79136#(<= ~counter~0 11)} is VALID [2022-04-28 12:44:54,462 INFO L290 TraceCheckUtils]: 105: Hoare triple {79136#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79161#(<= |main_#t~post7| 11)} is VALID [2022-04-28 12:44:54,462 INFO L290 TraceCheckUtils]: 106: Hoare triple {79161#(<= |main_#t~post7| 11)} assume !(#t~post7 < 50);havoc #t~post7; {78830#false} is VALID [2022-04-28 12:44:54,462 INFO L290 TraceCheckUtils]: 107: Hoare triple {78830#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78830#false} is VALID [2022-04-28 12:44:54,462 INFO L290 TraceCheckUtils]: 108: Hoare triple {78830#false} assume !(#t~post8 < 50);havoc #t~post8; {78830#false} is VALID [2022-04-28 12:44:54,462 INFO L290 TraceCheckUtils]: 109: Hoare triple {78830#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78830#false} is VALID [2022-04-28 12:44:54,462 INFO L290 TraceCheckUtils]: 110: Hoare triple {78830#false} assume !(#t~post6 < 50);havoc #t~post6; {78830#false} is VALID [2022-04-28 12:44:54,462 INFO L272 TraceCheckUtils]: 111: Hoare triple {78830#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78830#false} is VALID [2022-04-28 12:44:54,462 INFO L290 TraceCheckUtils]: 112: Hoare triple {78830#false} ~cond := #in~cond; {78830#false} is VALID [2022-04-28 12:44:54,462 INFO L290 TraceCheckUtils]: 113: Hoare triple {78830#false} assume 0 == ~cond; {78830#false} is VALID [2022-04-28 12:44:54,463 INFO L290 TraceCheckUtils]: 114: Hoare triple {78830#false} assume !false; {78830#false} is VALID [2022-04-28 12:44:54,463 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-28 12:44:54,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:44:55,072 INFO L290 TraceCheckUtils]: 114: Hoare triple {78830#false} assume !false; {78830#false} is VALID [2022-04-28 12:44:55,072 INFO L290 TraceCheckUtils]: 113: Hoare triple {78830#false} assume 0 == ~cond; {78830#false} is VALID [2022-04-28 12:44:55,072 INFO L290 TraceCheckUtils]: 112: Hoare triple {78830#false} ~cond := #in~cond; {78830#false} is VALID [2022-04-28 12:44:55,072 INFO L272 TraceCheckUtils]: 111: Hoare triple {78830#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {78830#false} is VALID [2022-04-28 12:44:55,072 INFO L290 TraceCheckUtils]: 110: Hoare triple {78830#false} assume !(#t~post6 < 50);havoc #t~post6; {78830#false} is VALID [2022-04-28 12:44:55,072 INFO L290 TraceCheckUtils]: 109: Hoare triple {78830#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78830#false} is VALID [2022-04-28 12:44:55,072 INFO L290 TraceCheckUtils]: 108: Hoare triple {78830#false} assume !(#t~post8 < 50);havoc #t~post8; {78830#false} is VALID [2022-04-28 12:44:55,072 INFO L290 TraceCheckUtils]: 107: Hoare triple {78830#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78830#false} is VALID [2022-04-28 12:44:55,079 INFO L290 TraceCheckUtils]: 106: Hoare triple {79213#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {78830#false} is VALID [2022-04-28 12:44:55,079 INFO L290 TraceCheckUtils]: 105: Hoare triple {79217#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79213#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:44:55,079 INFO L290 TraceCheckUtils]: 104: Hoare triple {79217#(< ~counter~0 50)} assume !!(0 != ~r~0); {79217#(< ~counter~0 50)} is VALID [2022-04-28 12:44:55,080 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {78829#true} {79217#(< ~counter~0 50)} #94#return; {79217#(< ~counter~0 50)} is VALID [2022-04-28 12:44:55,080 INFO L290 TraceCheckUtils]: 102: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,080 INFO L272 TraceCheckUtils]: 99: Hoare triple {79217#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,080 INFO L290 TraceCheckUtils]: 98: Hoare triple {79217#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {79217#(< ~counter~0 50)} is VALID [2022-04-28 12:44:55,081 INFO L290 TraceCheckUtils]: 97: Hoare triple {79242#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79217#(< ~counter~0 50)} is VALID [2022-04-28 12:44:55,082 INFO L290 TraceCheckUtils]: 96: Hoare triple {79242#(< ~counter~0 49)} assume !(~r~0 < 0); {79242#(< ~counter~0 49)} is VALID [2022-04-28 12:44:55,082 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {78829#true} {79242#(< ~counter~0 49)} #98#return; {79242#(< ~counter~0 49)} is VALID [2022-04-28 12:44:55,082 INFO L290 TraceCheckUtils]: 94: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,082 INFO L290 TraceCheckUtils]: 93: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,082 INFO L290 TraceCheckUtils]: 92: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,082 INFO L272 TraceCheckUtils]: 91: Hoare triple {79242#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,082 INFO L290 TraceCheckUtils]: 90: Hoare triple {79242#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {79242#(< ~counter~0 49)} is VALID [2022-04-28 12:44:55,083 INFO L290 TraceCheckUtils]: 89: Hoare triple {79267#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79242#(< ~counter~0 49)} is VALID [2022-04-28 12:44:55,083 INFO L290 TraceCheckUtils]: 88: Hoare triple {79267#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79267#(< ~counter~0 48)} is VALID [2022-04-28 12:44:55,083 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {78829#true} {79267#(< ~counter~0 48)} #98#return; {79267#(< ~counter~0 48)} is VALID [2022-04-28 12:44:55,083 INFO L290 TraceCheckUtils]: 86: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,084 INFO L290 TraceCheckUtils]: 85: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,084 INFO L290 TraceCheckUtils]: 84: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,084 INFO L272 TraceCheckUtils]: 83: Hoare triple {79267#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,084 INFO L290 TraceCheckUtils]: 82: Hoare triple {79267#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {79267#(< ~counter~0 48)} is VALID [2022-04-28 12:44:55,084 INFO L290 TraceCheckUtils]: 81: Hoare triple {79292#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79267#(< ~counter~0 48)} is VALID [2022-04-28 12:44:55,085 INFO L290 TraceCheckUtils]: 80: Hoare triple {79292#(< ~counter~0 47)} assume !(~r~0 > 0); {79292#(< ~counter~0 47)} is VALID [2022-04-28 12:44:55,085 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {78829#true} {79292#(< ~counter~0 47)} #96#return; {79292#(< ~counter~0 47)} is VALID [2022-04-28 12:44:55,085 INFO L290 TraceCheckUtils]: 78: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,085 INFO L290 TraceCheckUtils]: 77: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,085 INFO L290 TraceCheckUtils]: 76: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,085 INFO L272 TraceCheckUtils]: 75: Hoare triple {79292#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,092 INFO L290 TraceCheckUtils]: 74: Hoare triple {79292#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {79292#(< ~counter~0 47)} is VALID [2022-04-28 12:44:55,093 INFO L290 TraceCheckUtils]: 73: Hoare triple {79317#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79292#(< ~counter~0 47)} is VALID [2022-04-28 12:44:55,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {79317#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79317#(< ~counter~0 46)} is VALID [2022-04-28 12:44:55,094 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {78829#true} {79317#(< ~counter~0 46)} #96#return; {79317#(< ~counter~0 46)} is VALID [2022-04-28 12:44:55,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,094 INFO L290 TraceCheckUtils]: 69: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,094 INFO L290 TraceCheckUtils]: 68: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,094 INFO L272 TraceCheckUtils]: 67: Hoare triple {79317#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {79317#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {79317#(< ~counter~0 46)} is VALID [2022-04-28 12:44:55,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {79342#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79317#(< ~counter~0 46)} is VALID [2022-04-28 12:44:55,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {79342#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79342#(< ~counter~0 45)} is VALID [2022-04-28 12:44:55,095 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {78829#true} {79342#(< ~counter~0 45)} #96#return; {79342#(< ~counter~0 45)} is VALID [2022-04-28 12:44:55,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,095 INFO L272 TraceCheckUtils]: 59: Hoare triple {79342#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {79342#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {79342#(< ~counter~0 45)} is VALID [2022-04-28 12:44:55,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {79367#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79342#(< ~counter~0 45)} is VALID [2022-04-28 12:44:55,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {79367#(< ~counter~0 44)} assume !!(0 != ~r~0); {79367#(< ~counter~0 44)} is VALID [2022-04-28 12:44:55,097 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {78829#true} {79367#(< ~counter~0 44)} #94#return; {79367#(< ~counter~0 44)} is VALID [2022-04-28 12:44:55,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,097 INFO L272 TraceCheckUtils]: 51: Hoare triple {79367#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {79367#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {79367#(< ~counter~0 44)} is VALID [2022-04-28 12:44:55,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {79392#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79367#(< ~counter~0 44)} is VALID [2022-04-28 12:44:55,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {79392#(< ~counter~0 43)} assume !(~r~0 < 0); {79392#(< ~counter~0 43)} is VALID [2022-04-28 12:44:55,098 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {78829#true} {79392#(< ~counter~0 43)} #98#return; {79392#(< ~counter~0 43)} is VALID [2022-04-28 12:44:55,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,098 INFO L272 TraceCheckUtils]: 43: Hoare triple {79392#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {79392#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {79392#(< ~counter~0 43)} is VALID [2022-04-28 12:44:55,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {79417#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79392#(< ~counter~0 43)} is VALID [2022-04-28 12:44:55,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {79417#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79417#(< ~counter~0 42)} is VALID [2022-04-28 12:44:55,100 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {78829#true} {79417#(< ~counter~0 42)} #98#return; {79417#(< ~counter~0 42)} is VALID [2022-04-28 12:44:55,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,100 INFO L272 TraceCheckUtils]: 35: Hoare triple {79417#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {79417#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {79417#(< ~counter~0 42)} is VALID [2022-04-28 12:44:55,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {79442#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79417#(< ~counter~0 42)} is VALID [2022-04-28 12:44:55,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {79442#(< ~counter~0 41)} assume !(~r~0 > 0); {79442#(< ~counter~0 41)} is VALID [2022-04-28 12:44:55,101 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {78829#true} {79442#(< ~counter~0 41)} #96#return; {79442#(< ~counter~0 41)} is VALID [2022-04-28 12:44:55,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,101 INFO L272 TraceCheckUtils]: 27: Hoare triple {79442#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {79442#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {79442#(< ~counter~0 41)} is VALID [2022-04-28 12:44:55,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {79467#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79442#(< ~counter~0 41)} is VALID [2022-04-28 12:44:55,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {79467#(< ~counter~0 40)} assume !!(0 != ~r~0); {79467#(< ~counter~0 40)} is VALID [2022-04-28 12:44:55,103 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {78829#true} {79467#(< ~counter~0 40)} #94#return; {79467#(< ~counter~0 40)} is VALID [2022-04-28 12:44:55,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,103 INFO L272 TraceCheckUtils]: 19: Hoare triple {79467#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {79467#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {79467#(< ~counter~0 40)} is VALID [2022-04-28 12:44:55,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {79492#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79467#(< ~counter~0 40)} is VALID [2022-04-28 12:44:55,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {79492#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79492#(< ~counter~0 39)} is VALID [2022-04-28 12:44:55,104 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78829#true} {79492#(< ~counter~0 39)} #92#return; {79492#(< ~counter~0 39)} is VALID [2022-04-28 12:44:55,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,104 INFO L272 TraceCheckUtils]: 11: Hoare triple {79492#(< ~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)); {78829#true} is VALID [2022-04-28 12:44:55,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78829#true} {79492#(< ~counter~0 39)} #90#return; {79492#(< ~counter~0 39)} is VALID [2022-04-28 12:44:55,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {78829#true} assume true; {78829#true} is VALID [2022-04-28 12:44:55,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {78829#true} assume !(0 == ~cond); {78829#true} is VALID [2022-04-28 12:44:55,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {78829#true} ~cond := #in~cond; {78829#true} is VALID [2022-04-28 12:44:55,105 INFO L272 TraceCheckUtils]: 6: Hoare triple {79492#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {78829#true} is VALID [2022-04-28 12:44:55,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {79492#(< ~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; {79492#(< ~counter~0 39)} is VALID [2022-04-28 12:44:55,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {79492#(< ~counter~0 39)} call #t~ret9 := main(); {79492#(< ~counter~0 39)} is VALID [2022-04-28 12:44:55,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79492#(< ~counter~0 39)} {78829#true} #102#return; {79492#(< ~counter~0 39)} is VALID [2022-04-28 12:44:55,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {79492#(< ~counter~0 39)} assume true; {79492#(< ~counter~0 39)} is VALID [2022-04-28 12:44:55,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {78829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79492#(< ~counter~0 39)} is VALID [2022-04-28 12:44:55,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {78829#true} call ULTIMATE.init(); {78829#true} is VALID [2022-04-28 12:44:55,106 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-28 12:44:55,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:44:55,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885936532] [2022-04-28 12:44:55,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:44:55,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845316901] [2022-04-28 12:44:55,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845316901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:44:55,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:44:55,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 12:44:55,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:44:55,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [315696151] [2022-04-28 12:44:55,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [315696151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:44:55,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:44:55,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:44:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715366529] [2022-04-28 12:44:55,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:44:55,108 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-28 12:44:55,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:44:55,108 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-28 12:44:55,166 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-28 12:44:55,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:44:55,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:55,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:44:55,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 12:44:55,167 INFO L87 Difference]: Start difference. First operand 610 states and 814 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-28 12:44:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:57,051 INFO L93 Difference]: Finished difference Result 827 states and 1141 transitions. [2022-04-28 12:44:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 12:44:57,051 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-28 12:44:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:44:57,052 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-28 12:44:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-28 12:44:57,053 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-28 12:44:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-28 12:44:57,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-28 12:44:57,217 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-28 12:44:57,233 INFO L225 Difference]: With dead ends: 827 [2022-04-28 12:44:57,233 INFO L226 Difference]: Without dead ends: 626 [2022-04-28 12:44:57,234 INFO L412 NwaCegarLoop]: 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-28 12:44:57,234 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 171 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:44:57,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 263 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:44:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-04-28 12:44:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-04-28 12:44:58,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:44:58,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 626 states. Second operand has 626 states, 476 states have (on average 1.2142857142857142) internal successors, (578), 476 states have internal predecessors, (578), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:58,524 INFO L74 IsIncluded]: Start isIncluded. First operand 626 states. Second operand has 626 states, 476 states have (on average 1.2142857142857142) internal successors, (578), 476 states have internal predecessors, (578), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:58,525 INFO L87 Difference]: Start difference. First operand 626 states. Second operand has 626 states, 476 states have (on average 1.2142857142857142) internal successors, (578), 476 states have internal predecessors, (578), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:58,538 INFO L93 Difference]: Finished difference Result 626 states and 830 transitions. [2022-04-28 12:44:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 830 transitions. [2022-04-28 12:44:58,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:58,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:58,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 626 states, 476 states have (on average 1.2142857142857142) internal successors, (578), 476 states have internal predecessors, (578), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 626 states. [2022-04-28 12:44:58,539 INFO L87 Difference]: Start difference. First operand has 626 states, 476 states have (on average 1.2142857142857142) internal successors, (578), 476 states have internal predecessors, (578), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 626 states. [2022-04-28 12:44:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:58,553 INFO L93 Difference]: Finished difference Result 626 states and 830 transitions. [2022-04-28 12:44:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 830 transitions. [2022-04-28 12:44:58,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:58,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:58,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:44:58,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:44:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 476 states have (on average 1.2142857142857142) internal successors, (578), 476 states have internal predecessors, (578), 127 states have call successors, (127), 24 states have call predecessors, (127), 22 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 12:44:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 830 transitions. [2022-04-28 12:44:58,572 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 830 transitions. Word has length 115 [2022-04-28 12:44:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:44:58,572 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 830 transitions. [2022-04-28 12:44:58,572 INFO L496 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-28 12:44:58,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 626 states and 830 transitions. [2022-04-28 12:45:15,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 830 edges. 827 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 830 transitions. [2022-04-28 12:45:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 12:45:15,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:45:15,303 INFO L195 NwaCegarLoop]: 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-28 12:45:15,307 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-28 12:45:15,503 WARN L477 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-28 12:45:15,503 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:45:15,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:45:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-28 12:45:15,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:15,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729344703] [2022-04-28 12:45:15,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:45:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-28 12:45:15,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:45:15,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952122700] [2022-04-28 12:45:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:45:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:45:15,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:45:15,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402340744] [2022-04-28 12:45:15,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:45:15,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:45:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:45:15,517 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-28 12:45:15,517 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-28 12:45:15,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:45:15,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:45:15,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 12:45:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:15,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:45:16,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {83724#true} call ULTIMATE.init(); {83724#true} is VALID [2022-04-28 12:45:16,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {83724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {83732#(<= ~counter~0 0)} assume true; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83732#(<= ~counter~0 0)} {83724#true} #102#return; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {83732#(<= ~counter~0 0)} call #t~ret9 := main(); {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {83732#(<= ~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; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,201 INFO L272 TraceCheckUtils]: 6: Hoare triple {83732#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {83732#(<= ~counter~0 0)} ~cond := #in~cond; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {83732#(<= ~counter~0 0)} assume !(0 == ~cond); {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {83732#(<= ~counter~0 0)} assume true; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {83732#(<= ~counter~0 0)} {83732#(<= ~counter~0 0)} #90#return; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,202 INFO L272 TraceCheckUtils]: 11: Hoare triple {83732#(<= ~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)); {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {83732#(<= ~counter~0 0)} ~cond := #in~cond; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {83732#(<= ~counter~0 0)} assume !(0 == ~cond); {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {83732#(<= ~counter~0 0)} assume true; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,203 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {83732#(<= ~counter~0 0)} {83732#(<= ~counter~0 0)} #92#return; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {83732#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {83732#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:16,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {83732#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {83781#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:16,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {83781#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {83781#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:16,206 INFO L272 TraceCheckUtils]: 19: Hoare triple {83781#(<= ~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)); {83781#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:16,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {83781#(<= ~counter~0 1)} ~cond := #in~cond; {83781#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:16,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {83781#(<= ~counter~0 1)} assume !(0 == ~cond); {83781#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:16,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {83781#(<= ~counter~0 1)} assume true; {83781#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:16,207 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {83781#(<= ~counter~0 1)} {83781#(<= ~counter~0 1)} #94#return; {83781#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:16,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {83781#(<= ~counter~0 1)} assume !!(0 != ~r~0); {83781#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:16,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {83781#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {83806#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:16,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {83806#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {83806#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:16,208 INFO L272 TraceCheckUtils]: 27: Hoare triple {83806#(<= ~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)); {83806#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:16,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {83806#(<= ~counter~0 2)} ~cond := #in~cond; {83806#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:16,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {83806#(<= ~counter~0 2)} assume !(0 == ~cond); {83806#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:16,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {83806#(<= ~counter~0 2)} assume true; {83806#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:16,209 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {83806#(<= ~counter~0 2)} {83806#(<= ~counter~0 2)} #96#return; {83806#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:16,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {83806#(<= ~counter~0 2)} assume !(~r~0 > 0); {83806#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:16,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {83806#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {83831#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:16,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {83831#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {83831#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:16,211 INFO L272 TraceCheckUtils]: 35: Hoare triple {83831#(<= ~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)); {83831#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:16,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {83831#(<= ~counter~0 3)} ~cond := #in~cond; {83831#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:16,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {83831#(<= ~counter~0 3)} assume !(0 == ~cond); {83831#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:16,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {83831#(<= ~counter~0 3)} assume true; {83831#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:16,213 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {83831#(<= ~counter~0 3)} {83831#(<= ~counter~0 3)} #98#return; {83831#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:16,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {83831#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {83831#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:16,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {83831#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {83856#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:16,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {83856#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {83856#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:16,215 INFO L272 TraceCheckUtils]: 43: Hoare triple {83856#(<= ~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)); {83856#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:16,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {83856#(<= ~counter~0 4)} ~cond := #in~cond; {83856#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:16,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {83856#(<= ~counter~0 4)} assume !(0 == ~cond); {83856#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:16,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {83856#(<= ~counter~0 4)} assume true; {83856#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:16,216 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {83856#(<= ~counter~0 4)} {83856#(<= ~counter~0 4)} #98#return; {83856#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:16,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {83856#(<= ~counter~0 4)} assume !(~r~0 < 0); {83856#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:16,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {83856#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {83881#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:16,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {83881#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {83881#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:16,217 INFO L272 TraceCheckUtils]: 51: Hoare triple {83881#(<= ~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)); {83881#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:16,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {83881#(<= ~counter~0 5)} ~cond := #in~cond; {83881#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:16,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {83881#(<= ~counter~0 5)} assume !(0 == ~cond); {83881#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:16,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {83881#(<= ~counter~0 5)} assume true; {83881#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:16,218 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {83881#(<= ~counter~0 5)} {83881#(<= ~counter~0 5)} #94#return; {83881#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:16,218 INFO L290 TraceCheckUtils]: 56: Hoare triple {83881#(<= ~counter~0 5)} assume !!(0 != ~r~0); {83881#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:16,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {83881#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {83906#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:16,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {83906#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {83906#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:16,220 INFO L272 TraceCheckUtils]: 59: Hoare triple {83906#(<= ~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)); {83906#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:16,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {83906#(<= ~counter~0 6)} ~cond := #in~cond; {83906#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:16,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {83906#(<= ~counter~0 6)} assume !(0 == ~cond); {83906#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:16,221 INFO L290 TraceCheckUtils]: 62: Hoare triple {83906#(<= ~counter~0 6)} assume true; {83906#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:16,221 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {83906#(<= ~counter~0 6)} {83906#(<= ~counter~0 6)} #96#return; {83906#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:16,221 INFO L290 TraceCheckUtils]: 64: Hoare triple {83906#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {83906#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:16,222 INFO L290 TraceCheckUtils]: 65: Hoare triple {83906#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {83931#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:16,222 INFO L290 TraceCheckUtils]: 66: Hoare triple {83931#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {83931#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:16,223 INFO L272 TraceCheckUtils]: 67: Hoare triple {83931#(<= ~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)); {83931#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:16,223 INFO L290 TraceCheckUtils]: 68: Hoare triple {83931#(<= ~counter~0 7)} ~cond := #in~cond; {83931#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:16,223 INFO L290 TraceCheckUtils]: 69: Hoare triple {83931#(<= ~counter~0 7)} assume !(0 == ~cond); {83931#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:16,223 INFO L290 TraceCheckUtils]: 70: Hoare triple {83931#(<= ~counter~0 7)} assume true; {83931#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:16,224 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {83931#(<= ~counter~0 7)} {83931#(<= ~counter~0 7)} #96#return; {83931#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:16,224 INFO L290 TraceCheckUtils]: 72: Hoare triple {83931#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {83931#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:16,225 INFO L290 TraceCheckUtils]: 73: Hoare triple {83931#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {83956#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:16,225 INFO L290 TraceCheckUtils]: 74: Hoare triple {83956#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {83956#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:16,225 INFO L272 TraceCheckUtils]: 75: Hoare triple {83956#(<= ~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)); {83956#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:16,226 INFO L290 TraceCheckUtils]: 76: Hoare triple {83956#(<= ~counter~0 8)} ~cond := #in~cond; {83956#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:16,226 INFO L290 TraceCheckUtils]: 77: Hoare triple {83956#(<= ~counter~0 8)} assume !(0 == ~cond); {83956#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:16,226 INFO L290 TraceCheckUtils]: 78: Hoare triple {83956#(<= ~counter~0 8)} assume true; {83956#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:16,226 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {83956#(<= ~counter~0 8)} {83956#(<= ~counter~0 8)} #96#return; {83956#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:16,227 INFO L290 TraceCheckUtils]: 80: Hoare triple {83956#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {83956#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:16,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {83956#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {83981#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:16,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {83981#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {83981#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:16,228 INFO L272 TraceCheckUtils]: 83: Hoare triple {83981#(<= ~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)); {83981#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:16,228 INFO L290 TraceCheckUtils]: 84: Hoare triple {83981#(<= ~counter~0 9)} ~cond := #in~cond; {83981#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:16,229 INFO L290 TraceCheckUtils]: 85: Hoare triple {83981#(<= ~counter~0 9)} assume !(0 == ~cond); {83981#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:16,229 INFO L290 TraceCheckUtils]: 86: Hoare triple {83981#(<= ~counter~0 9)} assume true; {83981#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:16,229 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {83981#(<= ~counter~0 9)} {83981#(<= ~counter~0 9)} #96#return; {83981#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:16,230 INFO L290 TraceCheckUtils]: 88: Hoare triple {83981#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {83981#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:16,230 INFO L290 TraceCheckUtils]: 89: Hoare triple {83981#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84006#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:16,231 INFO L290 TraceCheckUtils]: 90: Hoare triple {84006#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {84006#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:16,231 INFO L272 TraceCheckUtils]: 91: Hoare triple {84006#(<= ~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)); {84006#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:16,231 INFO L290 TraceCheckUtils]: 92: Hoare triple {84006#(<= ~counter~0 10)} ~cond := #in~cond; {84006#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:16,231 INFO L290 TraceCheckUtils]: 93: Hoare triple {84006#(<= ~counter~0 10)} assume !(0 == ~cond); {84006#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:16,232 INFO L290 TraceCheckUtils]: 94: Hoare triple {84006#(<= ~counter~0 10)} assume true; {84006#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:16,232 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84006#(<= ~counter~0 10)} {84006#(<= ~counter~0 10)} #96#return; {84006#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:16,232 INFO L290 TraceCheckUtils]: 96: Hoare triple {84006#(<= ~counter~0 10)} assume !(~r~0 > 0); {84006#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:16,233 INFO L290 TraceCheckUtils]: 97: Hoare triple {84006#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84031#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:16,233 INFO L290 TraceCheckUtils]: 98: Hoare triple {84031#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {84031#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:16,234 INFO L272 TraceCheckUtils]: 99: Hoare triple {84031#(<= ~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)); {84031#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:16,234 INFO L290 TraceCheckUtils]: 100: Hoare triple {84031#(<= ~counter~0 11)} ~cond := #in~cond; {84031#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:16,234 INFO L290 TraceCheckUtils]: 101: Hoare triple {84031#(<= ~counter~0 11)} assume !(0 == ~cond); {84031#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:16,234 INFO L290 TraceCheckUtils]: 102: Hoare triple {84031#(<= ~counter~0 11)} assume true; {84031#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:16,235 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84031#(<= ~counter~0 11)} {84031#(<= ~counter~0 11)} #98#return; {84031#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:16,235 INFO L290 TraceCheckUtils]: 104: Hoare triple {84031#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84031#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:16,236 INFO L290 TraceCheckUtils]: 105: Hoare triple {84031#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84056#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:16,236 INFO L290 TraceCheckUtils]: 106: Hoare triple {84056#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {84056#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:16,237 INFO L272 TraceCheckUtils]: 107: Hoare triple {84056#(<= ~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)); {84056#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:16,237 INFO L290 TraceCheckUtils]: 108: Hoare triple {84056#(<= ~counter~0 12)} ~cond := #in~cond; {84056#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:16,237 INFO L290 TraceCheckUtils]: 109: Hoare triple {84056#(<= ~counter~0 12)} assume !(0 == ~cond); {84056#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:16,237 INFO L290 TraceCheckUtils]: 110: Hoare triple {84056#(<= ~counter~0 12)} assume true; {84056#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:16,238 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84056#(<= ~counter~0 12)} {84056#(<= ~counter~0 12)} #98#return; {84056#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:16,238 INFO L290 TraceCheckUtils]: 112: Hoare triple {84056#(<= ~counter~0 12)} assume !(~r~0 < 0); {84056#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:16,238 INFO L290 TraceCheckUtils]: 113: Hoare triple {84056#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84081#(<= |main_#t~post6| 12)} is VALID [2022-04-28 12:45:16,239 INFO L290 TraceCheckUtils]: 114: Hoare triple {84081#(<= |main_#t~post6| 12)} assume !(#t~post6 < 50);havoc #t~post6; {83725#false} is VALID [2022-04-28 12:45:16,239 INFO L272 TraceCheckUtils]: 115: Hoare triple {83725#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83725#false} is VALID [2022-04-28 12:45:16,239 INFO L290 TraceCheckUtils]: 116: Hoare triple {83725#false} ~cond := #in~cond; {83725#false} is VALID [2022-04-28 12:45:16,239 INFO L290 TraceCheckUtils]: 117: Hoare triple {83725#false} assume 0 == ~cond; {83725#false} is VALID [2022-04-28 12:45:16,239 INFO L290 TraceCheckUtils]: 118: Hoare triple {83725#false} assume !false; {83725#false} is VALID [2022-04-28 12:45:16,239 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-28 12:45:16,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:45:16,733 INFO L290 TraceCheckUtils]: 118: Hoare triple {83725#false} assume !false; {83725#false} is VALID [2022-04-28 12:45:16,733 INFO L290 TraceCheckUtils]: 117: Hoare triple {83725#false} assume 0 == ~cond; {83725#false} is VALID [2022-04-28 12:45:16,733 INFO L290 TraceCheckUtils]: 116: Hoare triple {83725#false} ~cond := #in~cond; {83725#false} is VALID [2022-04-28 12:45:16,733 INFO L272 TraceCheckUtils]: 115: Hoare triple {83725#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {83725#false} is VALID [2022-04-28 12:45:16,733 INFO L290 TraceCheckUtils]: 114: Hoare triple {84109#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {83725#false} is VALID [2022-04-28 12:45:16,734 INFO L290 TraceCheckUtils]: 113: Hoare triple {84113#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84109#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:45:16,734 INFO L290 TraceCheckUtils]: 112: Hoare triple {84113#(< ~counter~0 50)} assume !(~r~0 < 0); {84113#(< ~counter~0 50)} is VALID [2022-04-28 12:45:16,734 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {83724#true} {84113#(< ~counter~0 50)} #98#return; {84113#(< ~counter~0 50)} is VALID [2022-04-28 12:45:16,734 INFO L290 TraceCheckUtils]: 110: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,734 INFO L290 TraceCheckUtils]: 109: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,734 INFO L290 TraceCheckUtils]: 108: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,734 INFO L272 TraceCheckUtils]: 107: Hoare triple {84113#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,734 INFO L290 TraceCheckUtils]: 106: Hoare triple {84113#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {84113#(< ~counter~0 50)} is VALID [2022-04-28 12:45:16,736 INFO L290 TraceCheckUtils]: 105: Hoare triple {84138#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84113#(< ~counter~0 50)} is VALID [2022-04-28 12:45:16,736 INFO L290 TraceCheckUtils]: 104: Hoare triple {84138#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84138#(< ~counter~0 49)} is VALID [2022-04-28 12:45:16,736 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {83724#true} {84138#(< ~counter~0 49)} #98#return; {84138#(< ~counter~0 49)} is VALID [2022-04-28 12:45:16,736 INFO L290 TraceCheckUtils]: 102: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,737 INFO L290 TraceCheckUtils]: 101: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,737 INFO L290 TraceCheckUtils]: 100: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,737 INFO L272 TraceCheckUtils]: 99: Hoare triple {84138#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,737 INFO L290 TraceCheckUtils]: 98: Hoare triple {84138#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {84138#(< ~counter~0 49)} is VALID [2022-04-28 12:45:16,737 INFO L290 TraceCheckUtils]: 97: Hoare triple {84163#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84138#(< ~counter~0 49)} is VALID [2022-04-28 12:45:16,738 INFO L290 TraceCheckUtils]: 96: Hoare triple {84163#(< ~counter~0 48)} assume !(~r~0 > 0); {84163#(< ~counter~0 48)} is VALID [2022-04-28 12:45:16,738 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {83724#true} {84163#(< ~counter~0 48)} #96#return; {84163#(< ~counter~0 48)} is VALID [2022-04-28 12:45:16,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,738 INFO L290 TraceCheckUtils]: 92: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,738 INFO L272 TraceCheckUtils]: 91: Hoare triple {84163#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,738 INFO L290 TraceCheckUtils]: 90: Hoare triple {84163#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {84163#(< ~counter~0 48)} is VALID [2022-04-28 12:45:16,739 INFO L290 TraceCheckUtils]: 89: Hoare triple {84188#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84163#(< ~counter~0 48)} is VALID [2022-04-28 12:45:16,739 INFO L290 TraceCheckUtils]: 88: Hoare triple {84188#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84188#(< ~counter~0 47)} is VALID [2022-04-28 12:45:16,739 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {83724#true} {84188#(< ~counter~0 47)} #96#return; {84188#(< ~counter~0 47)} is VALID [2022-04-28 12:45:16,740 INFO L290 TraceCheckUtils]: 86: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,740 INFO L290 TraceCheckUtils]: 85: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,740 INFO L290 TraceCheckUtils]: 84: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,740 INFO L272 TraceCheckUtils]: 83: Hoare triple {84188#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,740 INFO L290 TraceCheckUtils]: 82: Hoare triple {84188#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {84188#(< ~counter~0 47)} is VALID [2022-04-28 12:45:16,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {84213#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84188#(< ~counter~0 47)} is VALID [2022-04-28 12:45:16,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {84213#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84213#(< ~counter~0 46)} is VALID [2022-04-28 12:45:16,741 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {83724#true} {84213#(< ~counter~0 46)} #96#return; {84213#(< ~counter~0 46)} is VALID [2022-04-28 12:45:16,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,741 INFO L290 TraceCheckUtils]: 77: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,741 INFO L290 TraceCheckUtils]: 76: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,741 INFO L272 TraceCheckUtils]: 75: Hoare triple {84213#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {84213#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {84213#(< ~counter~0 46)} is VALID [2022-04-28 12:45:16,742 INFO L290 TraceCheckUtils]: 73: Hoare triple {84238#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84213#(< ~counter~0 46)} is VALID [2022-04-28 12:45:16,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {84238#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84238#(< ~counter~0 45)} is VALID [2022-04-28 12:45:16,743 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {83724#true} {84238#(< ~counter~0 45)} #96#return; {84238#(< ~counter~0 45)} is VALID [2022-04-28 12:45:16,743 INFO L290 TraceCheckUtils]: 70: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,743 INFO L290 TraceCheckUtils]: 69: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,743 INFO L272 TraceCheckUtils]: 67: Hoare triple {84238#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {84238#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {84238#(< ~counter~0 45)} is VALID [2022-04-28 12:45:16,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {84263#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84238#(< ~counter~0 45)} is VALID [2022-04-28 12:45:16,744 INFO L290 TraceCheckUtils]: 64: Hoare triple {84263#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84263#(< ~counter~0 44)} is VALID [2022-04-28 12:45:16,744 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {83724#true} {84263#(< ~counter~0 44)} #96#return; {84263#(< ~counter~0 44)} is VALID [2022-04-28 12:45:16,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,744 INFO L272 TraceCheckUtils]: 59: Hoare triple {84263#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {84263#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {84263#(< ~counter~0 44)} is VALID [2022-04-28 12:45:16,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {84288#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84263#(< ~counter~0 44)} is VALID [2022-04-28 12:45:16,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {84288#(< ~counter~0 43)} assume !!(0 != ~r~0); {84288#(< ~counter~0 43)} is VALID [2022-04-28 12:45:16,746 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {83724#true} {84288#(< ~counter~0 43)} #94#return; {84288#(< ~counter~0 43)} is VALID [2022-04-28 12:45:16,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,746 INFO L272 TraceCheckUtils]: 51: Hoare triple {84288#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {84288#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {84288#(< ~counter~0 43)} is VALID [2022-04-28 12:45:16,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {84313#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84288#(< ~counter~0 43)} is VALID [2022-04-28 12:45:16,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {84313#(< ~counter~0 42)} assume !(~r~0 < 0); {84313#(< ~counter~0 42)} is VALID [2022-04-28 12:45:16,747 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {83724#true} {84313#(< ~counter~0 42)} #98#return; {84313#(< ~counter~0 42)} is VALID [2022-04-28 12:45:16,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,747 INFO L272 TraceCheckUtils]: 43: Hoare triple {84313#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {84313#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {84313#(< ~counter~0 42)} is VALID [2022-04-28 12:45:16,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {84338#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84313#(< ~counter~0 42)} is VALID [2022-04-28 12:45:16,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {84338#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84338#(< ~counter~0 41)} is VALID [2022-04-28 12:45:16,749 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {83724#true} {84338#(< ~counter~0 41)} #98#return; {84338#(< ~counter~0 41)} is VALID [2022-04-28 12:45:16,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,749 INFO L272 TraceCheckUtils]: 35: Hoare triple {84338#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {84338#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {84338#(< ~counter~0 41)} is VALID [2022-04-28 12:45:16,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {84363#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84338#(< ~counter~0 41)} is VALID [2022-04-28 12:45:16,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {84363#(< ~counter~0 40)} assume !(~r~0 > 0); {84363#(< ~counter~0 40)} is VALID [2022-04-28 12:45:16,750 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {83724#true} {84363#(< ~counter~0 40)} #96#return; {84363#(< ~counter~0 40)} is VALID [2022-04-28 12:45:16,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,751 INFO L272 TraceCheckUtils]: 27: Hoare triple {84363#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {84363#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {84363#(< ~counter~0 40)} is VALID [2022-04-28 12:45:16,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {84388#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84363#(< ~counter~0 40)} is VALID [2022-04-28 12:45:16,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {84388#(< ~counter~0 39)} assume !!(0 != ~r~0); {84388#(< ~counter~0 39)} is VALID [2022-04-28 12:45:16,752 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {83724#true} {84388#(< ~counter~0 39)} #94#return; {84388#(< ~counter~0 39)} is VALID [2022-04-28 12:45:16,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,752 INFO L272 TraceCheckUtils]: 19: Hoare triple {84388#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {84388#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {84388#(< ~counter~0 39)} is VALID [2022-04-28 12:45:16,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {84413#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84388#(< ~counter~0 39)} is VALID [2022-04-28 12:45:16,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {84413#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84413#(< ~counter~0 38)} is VALID [2022-04-28 12:45:16,754 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {83724#true} {84413#(< ~counter~0 38)} #92#return; {84413#(< ~counter~0 38)} is VALID [2022-04-28 12:45:16,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {84413#(< ~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)); {83724#true} is VALID [2022-04-28 12:45:16,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {83724#true} {84413#(< ~counter~0 38)} #90#return; {84413#(< ~counter~0 38)} is VALID [2022-04-28 12:45:16,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {83724#true} assume true; {83724#true} is VALID [2022-04-28 12:45:16,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {83724#true} assume !(0 == ~cond); {83724#true} is VALID [2022-04-28 12:45:16,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {83724#true} ~cond := #in~cond; {83724#true} is VALID [2022-04-28 12:45:16,754 INFO L272 TraceCheckUtils]: 6: Hoare triple {84413#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {83724#true} is VALID [2022-04-28 12:45:16,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {84413#(< ~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; {84413#(< ~counter~0 38)} is VALID [2022-04-28 12:45:16,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {84413#(< ~counter~0 38)} call #t~ret9 := main(); {84413#(< ~counter~0 38)} is VALID [2022-04-28 12:45:16,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84413#(< ~counter~0 38)} {83724#true} #102#return; {84413#(< ~counter~0 38)} is VALID [2022-04-28 12:45:16,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {84413#(< ~counter~0 38)} assume true; {84413#(< ~counter~0 38)} is VALID [2022-04-28 12:45:16,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {83724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84413#(< ~counter~0 38)} is VALID [2022-04-28 12:45:16,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {83724#true} call ULTIMATE.init(); {83724#true} is VALID [2022-04-28 12:45:16,756 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-28 12:45:16,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:45:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952122700] [2022-04-28 12:45:16,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:45:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402340744] [2022-04-28 12:45:16,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402340744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:45:16,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:45:16,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 12:45:16,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:45:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729344703] [2022-04-28 12:45:16,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729344703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:16,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:16,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 12:45:16,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385997852] [2022-04-28 12:45:16,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:45:16,757 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-28 12:45:16,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:45:16,757 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-28 12:45:16,834 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-28 12:45:16,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 12:45:16,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:16,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 12:45:16,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 12:45:16,835 INFO L87 Difference]: Start difference. First operand 626 states and 830 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-28 12:45:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:19,103 INFO L93 Difference]: Finished difference Result 685 states and 910 transitions. [2022-04-28 12:45:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 12:45:19,103 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-28 12:45:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:45:19,103 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-28 12:45:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-28 12:45:19,105 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-28 12:45:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-28 12:45:19,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-28 12:45:19,268 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-28 12:45:19,286 INFO L225 Difference]: With dead ends: 685 [2022-04-28 12:45:19,286 INFO L226 Difference]: Without dead ends: 674 [2022-04-28 12:45:19,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=620, Invalid=862, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 12:45:19,287 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 175 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:45:19,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 299 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:45:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-04-28 12:45:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 652. [2022-04-28 12:45:20,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:45:20,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 652 states, 487 states have (on average 1.211498973305955) internal successors, (590), 497 states have internal predecessors, (590), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:45:20,363 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 652 states, 487 states have (on average 1.211498973305955) internal successors, (590), 497 states have internal predecessors, (590), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:45:20,363 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 652 states, 487 states have (on average 1.211498973305955) internal successors, (590), 497 states have internal predecessors, (590), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:45:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:20,378 INFO L93 Difference]: Finished difference Result 674 states and 894 transitions. [2022-04-28 12:45:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 894 transitions. [2022-04-28 12:45:20,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:20,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:20,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 652 states, 487 states have (on average 1.211498973305955) internal successors, (590), 497 states have internal predecessors, (590), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 674 states. [2022-04-28 12:45:20,380 INFO L87 Difference]: Start difference. First operand has 652 states, 487 states have (on average 1.211498973305955) internal successors, (590), 497 states have internal predecessors, (590), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 674 states. [2022-04-28 12:45:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:20,395 INFO L93 Difference]: Finished difference Result 674 states and 894 transitions. [2022-04-28 12:45:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 894 transitions. [2022-04-28 12:45:20,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:20,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:20,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:45:20,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:45:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 487 states have (on average 1.211498973305955) internal successors, (590), 497 states have internal predecessors, (590), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:45:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 868 transitions. [2022-04-28 12:45:20,415 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 868 transitions. Word has length 119 [2022-04-28 12:45:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:45:20,415 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 868 transitions. [2022-04-28 12:45:20,415 INFO L496 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-28 12:45:20,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 652 states and 868 transitions. [2022-04-28 12:45:37,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 868 edges. 864 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 868 transitions. [2022-04-28 12:45:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 12:45:37,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:45:37,433 INFO L195 NwaCegarLoop]: 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-28 12:45:37,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 12:45:37,634 WARN L477 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-28 12:45:37,634 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:45:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:45:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-28 12:45:37,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:37,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1467671486] [2022-04-28 12:45:37,635 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:45:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-28 12:45:37,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:45:37,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956238880] [2022-04-28 12:45:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:45:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:45:37,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:45:37,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653510979] [2022-04-28 12:45:37,646 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:45:37,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:45:37,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:45:37,668 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-28 12:45:37,669 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-28 12:45:38,219 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 12:45:38,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:45:38,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 12:45:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:38,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:45:38,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {88507#true} call ULTIMATE.init(); {88507#true} is VALID [2022-04-28 12:45:38,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {88507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {88515#(<= ~counter~0 0)} assume true; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88515#(<= ~counter~0 0)} {88507#true} #102#return; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {88515#(<= ~counter~0 0)} call #t~ret9 := main(); {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {88515#(<= ~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; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {88515#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {88515#(<= ~counter~0 0)} ~cond := #in~cond; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {88515#(<= ~counter~0 0)} assume !(0 == ~cond); {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {88515#(<= ~counter~0 0)} assume true; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {88515#(<= ~counter~0 0)} {88515#(<= ~counter~0 0)} #90#return; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {88515#(<= ~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)); {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {88515#(<= ~counter~0 0)} ~cond := #in~cond; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {88515#(<= ~counter~0 0)} assume !(0 == ~cond); {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {88515#(<= ~counter~0 0)} assume true; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {88515#(<= ~counter~0 0)} {88515#(<= ~counter~0 0)} #92#return; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {88515#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {88515#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:38,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {88515#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {88564#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:38,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {88564#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {88564#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:38,856 INFO L272 TraceCheckUtils]: 19: Hoare triple {88564#(<= ~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)); {88564#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:38,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {88564#(<= ~counter~0 1)} ~cond := #in~cond; {88564#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:38,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {88564#(<= ~counter~0 1)} assume !(0 == ~cond); {88564#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:38,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {88564#(<= ~counter~0 1)} assume true; {88564#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:38,857 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {88564#(<= ~counter~0 1)} {88564#(<= ~counter~0 1)} #94#return; {88564#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:38,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {88564#(<= ~counter~0 1)} assume !!(0 != ~r~0); {88564#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:38,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {88564#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88589#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:38,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {88589#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {88589#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:38,859 INFO L272 TraceCheckUtils]: 27: Hoare triple {88589#(<= ~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)); {88589#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:38,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {88589#(<= ~counter~0 2)} ~cond := #in~cond; {88589#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:38,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {88589#(<= ~counter~0 2)} assume !(0 == ~cond); {88589#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:38,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {88589#(<= ~counter~0 2)} assume true; {88589#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:38,860 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {88589#(<= ~counter~0 2)} {88589#(<= ~counter~0 2)} #96#return; {88589#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:38,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {88589#(<= ~counter~0 2)} assume !(~r~0 > 0); {88589#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:38,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {88589#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {88614#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:38,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {88614#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {88614#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:38,862 INFO L272 TraceCheckUtils]: 35: Hoare triple {88614#(<= ~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)); {88614#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:38,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {88614#(<= ~counter~0 3)} ~cond := #in~cond; {88614#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:38,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {88614#(<= ~counter~0 3)} assume !(0 == ~cond); {88614#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:38,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {88614#(<= ~counter~0 3)} assume true; {88614#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:38,864 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {88614#(<= ~counter~0 3)} {88614#(<= ~counter~0 3)} #98#return; {88614#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:38,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {88614#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {88614#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:38,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {88614#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {88639#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:38,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {88639#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {88639#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:38,866 INFO L272 TraceCheckUtils]: 43: Hoare triple {88639#(<= ~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)); {88639#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:38,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {88639#(<= ~counter~0 4)} ~cond := #in~cond; {88639#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:38,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {88639#(<= ~counter~0 4)} assume !(0 == ~cond); {88639#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:38,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {88639#(<= ~counter~0 4)} assume true; {88639#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:38,867 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {88639#(<= ~counter~0 4)} {88639#(<= ~counter~0 4)} #98#return; {88639#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:38,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {88639#(<= ~counter~0 4)} assume !(~r~0 < 0); {88639#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:38,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {88639#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {88664#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:38,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {88664#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {88664#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:38,869 INFO L272 TraceCheckUtils]: 51: Hoare triple {88664#(<= ~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)); {88664#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:38,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {88664#(<= ~counter~0 5)} ~cond := #in~cond; {88664#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:38,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {88664#(<= ~counter~0 5)} assume !(0 == ~cond); {88664#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:38,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {88664#(<= ~counter~0 5)} assume true; {88664#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:38,870 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {88664#(<= ~counter~0 5)} {88664#(<= ~counter~0 5)} #94#return; {88664#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:38,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {88664#(<= ~counter~0 5)} assume !!(0 != ~r~0); {88664#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:38,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {88664#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88689#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:38,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {88689#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {88689#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:38,872 INFO L272 TraceCheckUtils]: 59: Hoare triple {88689#(<= ~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)); {88689#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:38,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {88689#(<= ~counter~0 6)} ~cond := #in~cond; {88689#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:38,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {88689#(<= ~counter~0 6)} assume !(0 == ~cond); {88689#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:38,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {88689#(<= ~counter~0 6)} assume true; {88689#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:38,873 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {88689#(<= ~counter~0 6)} {88689#(<= ~counter~0 6)} #96#return; {88689#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:38,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {88689#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {88689#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:38,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {88689#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88714#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:38,874 INFO L290 TraceCheckUtils]: 66: Hoare triple {88714#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {88714#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:38,875 INFO L272 TraceCheckUtils]: 67: Hoare triple {88714#(<= ~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)); {88714#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:38,875 INFO L290 TraceCheckUtils]: 68: Hoare triple {88714#(<= ~counter~0 7)} ~cond := #in~cond; {88714#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:38,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {88714#(<= ~counter~0 7)} assume !(0 == ~cond); {88714#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:38,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {88714#(<= ~counter~0 7)} assume true; {88714#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:38,876 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {88714#(<= ~counter~0 7)} {88714#(<= ~counter~0 7)} #96#return; {88714#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:38,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {88714#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {88714#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:38,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {88714#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88739#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:38,878 INFO L290 TraceCheckUtils]: 74: Hoare triple {88739#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {88739#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:38,878 INFO L272 TraceCheckUtils]: 75: Hoare triple {88739#(<= ~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)); {88739#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:38,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {88739#(<= ~counter~0 8)} ~cond := #in~cond; {88739#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:38,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {88739#(<= ~counter~0 8)} assume !(0 == ~cond); {88739#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:38,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {88739#(<= ~counter~0 8)} assume true; {88739#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:38,879 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {88739#(<= ~counter~0 8)} {88739#(<= ~counter~0 8)} #96#return; {88739#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:38,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {88739#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {88739#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:38,881 INFO L290 TraceCheckUtils]: 81: Hoare triple {88739#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88764#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:38,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {88764#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {88764#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:38,882 INFO L272 TraceCheckUtils]: 83: Hoare triple {88764#(<= ~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)); {88764#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:38,882 INFO L290 TraceCheckUtils]: 84: Hoare triple {88764#(<= ~counter~0 9)} ~cond := #in~cond; {88764#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:38,882 INFO L290 TraceCheckUtils]: 85: Hoare triple {88764#(<= ~counter~0 9)} assume !(0 == ~cond); {88764#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:38,882 INFO L290 TraceCheckUtils]: 86: Hoare triple {88764#(<= ~counter~0 9)} assume true; {88764#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:38,883 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {88764#(<= ~counter~0 9)} {88764#(<= ~counter~0 9)} #96#return; {88764#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:38,883 INFO L290 TraceCheckUtils]: 88: Hoare triple {88764#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {88764#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:38,884 INFO L290 TraceCheckUtils]: 89: Hoare triple {88764#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88789#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:38,884 INFO L290 TraceCheckUtils]: 90: Hoare triple {88789#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {88789#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:38,885 INFO L272 TraceCheckUtils]: 91: Hoare triple {88789#(<= ~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)); {88789#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:38,885 INFO L290 TraceCheckUtils]: 92: Hoare triple {88789#(<= ~counter~0 10)} ~cond := #in~cond; {88789#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:38,885 INFO L290 TraceCheckUtils]: 93: Hoare triple {88789#(<= ~counter~0 10)} assume !(0 == ~cond); {88789#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:38,885 INFO L290 TraceCheckUtils]: 94: Hoare triple {88789#(<= ~counter~0 10)} assume true; {88789#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:38,886 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {88789#(<= ~counter~0 10)} {88789#(<= ~counter~0 10)} #96#return; {88789#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:38,886 INFO L290 TraceCheckUtils]: 96: Hoare triple {88789#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {88789#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:38,887 INFO L290 TraceCheckUtils]: 97: Hoare triple {88789#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88814#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:38,887 INFO L290 TraceCheckUtils]: 98: Hoare triple {88814#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {88814#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:38,888 INFO L272 TraceCheckUtils]: 99: Hoare triple {88814#(<= ~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)); {88814#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:38,888 INFO L290 TraceCheckUtils]: 100: Hoare triple {88814#(<= ~counter~0 11)} ~cond := #in~cond; {88814#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:38,888 INFO L290 TraceCheckUtils]: 101: Hoare triple {88814#(<= ~counter~0 11)} assume !(0 == ~cond); {88814#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:38,889 INFO L290 TraceCheckUtils]: 102: Hoare triple {88814#(<= ~counter~0 11)} assume true; {88814#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:38,889 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {88814#(<= ~counter~0 11)} {88814#(<= ~counter~0 11)} #96#return; {88814#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:38,889 INFO L290 TraceCheckUtils]: 104: Hoare triple {88814#(<= ~counter~0 11)} assume !(~r~0 > 0); {88814#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:38,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {88814#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {88839#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:38,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {88839#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {88839#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:38,891 INFO L272 TraceCheckUtils]: 107: Hoare triple {88839#(<= ~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)); {88839#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:38,891 INFO L290 TraceCheckUtils]: 108: Hoare triple {88839#(<= ~counter~0 12)} ~cond := #in~cond; {88839#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:38,891 INFO L290 TraceCheckUtils]: 109: Hoare triple {88839#(<= ~counter~0 12)} assume !(0 == ~cond); {88839#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:38,892 INFO L290 TraceCheckUtils]: 110: Hoare triple {88839#(<= ~counter~0 12)} assume true; {88839#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:38,892 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {88839#(<= ~counter~0 12)} {88839#(<= ~counter~0 12)} #98#return; {88839#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:38,892 INFO L290 TraceCheckUtils]: 112: Hoare triple {88839#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {88839#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:38,893 INFO L290 TraceCheckUtils]: 113: Hoare triple {88839#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {88864#(<= |main_#t~post8| 12)} is VALID [2022-04-28 12:45:38,893 INFO L290 TraceCheckUtils]: 114: Hoare triple {88864#(<= |main_#t~post8| 12)} assume !(#t~post8 < 50);havoc #t~post8; {88508#false} is VALID [2022-04-28 12:45:38,893 INFO L290 TraceCheckUtils]: 115: Hoare triple {88508#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {88508#false} is VALID [2022-04-28 12:45:38,893 INFO L290 TraceCheckUtils]: 116: Hoare triple {88508#false} assume !(#t~post6 < 50);havoc #t~post6; {88508#false} is VALID [2022-04-28 12:45:38,893 INFO L272 TraceCheckUtils]: 117: Hoare triple {88508#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {88508#false} is VALID [2022-04-28 12:45:38,893 INFO L290 TraceCheckUtils]: 118: Hoare triple {88508#false} ~cond := #in~cond; {88508#false} is VALID [2022-04-28 12:45:38,893 INFO L290 TraceCheckUtils]: 119: Hoare triple {88508#false} assume 0 == ~cond; {88508#false} is VALID [2022-04-28 12:45:38,893 INFO L290 TraceCheckUtils]: 120: Hoare triple {88508#false} assume !false; {88508#false} is VALID [2022-04-28 12:45:38,894 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-28 12:45:38,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:45:39,517 INFO L290 TraceCheckUtils]: 120: Hoare triple {88508#false} assume !false; {88508#false} is VALID [2022-04-28 12:45:39,518 INFO L290 TraceCheckUtils]: 119: Hoare triple {88508#false} assume 0 == ~cond; {88508#false} is VALID [2022-04-28 12:45:39,518 INFO L290 TraceCheckUtils]: 118: Hoare triple {88508#false} ~cond := #in~cond; {88508#false} is VALID [2022-04-28 12:45:39,518 INFO L272 TraceCheckUtils]: 117: Hoare triple {88508#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {88508#false} is VALID [2022-04-28 12:45:39,518 INFO L290 TraceCheckUtils]: 116: Hoare triple {88508#false} assume !(#t~post6 < 50);havoc #t~post6; {88508#false} is VALID [2022-04-28 12:45:39,518 INFO L290 TraceCheckUtils]: 115: Hoare triple {88508#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {88508#false} is VALID [2022-04-28 12:45:39,518 INFO L290 TraceCheckUtils]: 114: Hoare triple {88904#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {88508#false} is VALID [2022-04-28 12:45:39,518 INFO L290 TraceCheckUtils]: 113: Hoare triple {88908#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {88904#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:45:39,518 INFO L290 TraceCheckUtils]: 112: Hoare triple {88908#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {88908#(< ~counter~0 50)} is VALID [2022-04-28 12:45:39,519 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {88507#true} {88908#(< ~counter~0 50)} #98#return; {88908#(< ~counter~0 50)} is VALID [2022-04-28 12:45:39,519 INFO L290 TraceCheckUtils]: 110: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,519 INFO L290 TraceCheckUtils]: 109: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,519 INFO L290 TraceCheckUtils]: 108: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,519 INFO L272 TraceCheckUtils]: 107: Hoare triple {88908#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,519 INFO L290 TraceCheckUtils]: 106: Hoare triple {88908#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {88908#(< ~counter~0 50)} is VALID [2022-04-28 12:45:39,522 INFO L290 TraceCheckUtils]: 105: Hoare triple {88933#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {88908#(< ~counter~0 50)} is VALID [2022-04-28 12:45:39,522 INFO L290 TraceCheckUtils]: 104: Hoare triple {88933#(< ~counter~0 49)} assume !(~r~0 > 0); {88933#(< ~counter~0 49)} is VALID [2022-04-28 12:45:39,522 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {88507#true} {88933#(< ~counter~0 49)} #96#return; {88933#(< ~counter~0 49)} is VALID [2022-04-28 12:45:39,522 INFO L290 TraceCheckUtils]: 102: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,522 INFO L290 TraceCheckUtils]: 101: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,523 INFO L290 TraceCheckUtils]: 100: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,523 INFO L272 TraceCheckUtils]: 99: Hoare triple {88933#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,523 INFO L290 TraceCheckUtils]: 98: Hoare triple {88933#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {88933#(< ~counter~0 49)} is VALID [2022-04-28 12:45:39,524 INFO L290 TraceCheckUtils]: 97: Hoare triple {88958#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88933#(< ~counter~0 49)} is VALID [2022-04-28 12:45:39,524 INFO L290 TraceCheckUtils]: 96: Hoare triple {88958#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {88958#(< ~counter~0 48)} is VALID [2022-04-28 12:45:39,524 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {88507#true} {88958#(< ~counter~0 48)} #96#return; {88958#(< ~counter~0 48)} is VALID [2022-04-28 12:45:39,524 INFO L290 TraceCheckUtils]: 94: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,524 INFO L290 TraceCheckUtils]: 92: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,524 INFO L272 TraceCheckUtils]: 91: Hoare triple {88958#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,524 INFO L290 TraceCheckUtils]: 90: Hoare triple {88958#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {88958#(< ~counter~0 48)} is VALID [2022-04-28 12:45:39,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {88983#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88958#(< ~counter~0 48)} is VALID [2022-04-28 12:45:39,525 INFO L290 TraceCheckUtils]: 88: Hoare triple {88983#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {88983#(< ~counter~0 47)} is VALID [2022-04-28 12:45:39,526 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {88507#true} {88983#(< ~counter~0 47)} #96#return; {88983#(< ~counter~0 47)} is VALID [2022-04-28 12:45:39,526 INFO L290 TraceCheckUtils]: 86: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,526 INFO L290 TraceCheckUtils]: 84: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,526 INFO L272 TraceCheckUtils]: 83: Hoare triple {88983#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,526 INFO L290 TraceCheckUtils]: 82: Hoare triple {88983#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {88983#(< ~counter~0 47)} is VALID [2022-04-28 12:45:39,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {89008#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {88983#(< ~counter~0 47)} is VALID [2022-04-28 12:45:39,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {89008#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89008#(< ~counter~0 46)} is VALID [2022-04-28 12:45:39,527 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {88507#true} {89008#(< ~counter~0 46)} #96#return; {89008#(< ~counter~0 46)} is VALID [2022-04-28 12:45:39,527 INFO L290 TraceCheckUtils]: 78: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,528 INFO L290 TraceCheckUtils]: 77: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,528 INFO L290 TraceCheckUtils]: 76: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,528 INFO L272 TraceCheckUtils]: 75: Hoare triple {89008#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,528 INFO L290 TraceCheckUtils]: 74: Hoare triple {89008#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {89008#(< ~counter~0 46)} is VALID [2022-04-28 12:45:39,529 INFO L290 TraceCheckUtils]: 73: Hoare triple {89033#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89008#(< ~counter~0 46)} is VALID [2022-04-28 12:45:39,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {89033#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89033#(< ~counter~0 45)} is VALID [2022-04-28 12:45:39,529 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {88507#true} {89033#(< ~counter~0 45)} #96#return; {89033#(< ~counter~0 45)} is VALID [2022-04-28 12:45:39,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,529 INFO L272 TraceCheckUtils]: 67: Hoare triple {89033#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,530 INFO L290 TraceCheckUtils]: 66: Hoare triple {89033#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {89033#(< ~counter~0 45)} is VALID [2022-04-28 12:45:39,530 INFO L290 TraceCheckUtils]: 65: Hoare triple {89058#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89033#(< ~counter~0 45)} is VALID [2022-04-28 12:45:39,530 INFO L290 TraceCheckUtils]: 64: Hoare triple {89058#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89058#(< ~counter~0 44)} is VALID [2022-04-28 12:45:39,531 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {88507#true} {89058#(< ~counter~0 44)} #96#return; {89058#(< ~counter~0 44)} is VALID [2022-04-28 12:45:39,531 INFO L290 TraceCheckUtils]: 62: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,531 INFO L290 TraceCheckUtils]: 61: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,531 INFO L290 TraceCheckUtils]: 60: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,531 INFO L272 TraceCheckUtils]: 59: Hoare triple {89058#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {89058#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {89058#(< ~counter~0 44)} is VALID [2022-04-28 12:45:39,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {89083#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89058#(< ~counter~0 44)} is VALID [2022-04-28 12:45:39,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {89083#(< ~counter~0 43)} assume !!(0 != ~r~0); {89083#(< ~counter~0 43)} is VALID [2022-04-28 12:45:39,532 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {88507#true} {89083#(< ~counter~0 43)} #94#return; {89083#(< ~counter~0 43)} is VALID [2022-04-28 12:45:39,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,533 INFO L272 TraceCheckUtils]: 51: Hoare triple {89083#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {89083#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {89083#(< ~counter~0 43)} is VALID [2022-04-28 12:45:39,534 INFO L290 TraceCheckUtils]: 49: Hoare triple {89108#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89083#(< ~counter~0 43)} is VALID [2022-04-28 12:45:39,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {89108#(< ~counter~0 42)} assume !(~r~0 < 0); {89108#(< ~counter~0 42)} is VALID [2022-04-28 12:45:39,534 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {88507#true} {89108#(< ~counter~0 42)} #98#return; {89108#(< ~counter~0 42)} is VALID [2022-04-28 12:45:39,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,534 INFO L272 TraceCheckUtils]: 43: Hoare triple {89108#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {89108#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {89108#(< ~counter~0 42)} is VALID [2022-04-28 12:45:39,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {89133#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89108#(< ~counter~0 42)} is VALID [2022-04-28 12:45:39,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {89133#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89133#(< ~counter~0 41)} is VALID [2022-04-28 12:45:39,536 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {88507#true} {89133#(< ~counter~0 41)} #98#return; {89133#(< ~counter~0 41)} is VALID [2022-04-28 12:45:39,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,536 INFO L272 TraceCheckUtils]: 35: Hoare triple {89133#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {89133#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {89133#(< ~counter~0 41)} is VALID [2022-04-28 12:45:39,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {89158#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89133#(< ~counter~0 41)} is VALID [2022-04-28 12:45:39,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {89158#(< ~counter~0 40)} assume !(~r~0 > 0); {89158#(< ~counter~0 40)} is VALID [2022-04-28 12:45:39,538 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {88507#true} {89158#(< ~counter~0 40)} #96#return; {89158#(< ~counter~0 40)} is VALID [2022-04-28 12:45:39,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,538 INFO L272 TraceCheckUtils]: 27: Hoare triple {89158#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {89158#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {89158#(< ~counter~0 40)} is VALID [2022-04-28 12:45:39,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {89183#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89158#(< ~counter~0 40)} is VALID [2022-04-28 12:45:39,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {89183#(< ~counter~0 39)} assume !!(0 != ~r~0); {89183#(< ~counter~0 39)} is VALID [2022-04-28 12:45:39,539 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {88507#true} {89183#(< ~counter~0 39)} #94#return; {89183#(< ~counter~0 39)} is VALID [2022-04-28 12:45:39,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,539 INFO L272 TraceCheckUtils]: 19: Hoare triple {89183#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {89183#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {89183#(< ~counter~0 39)} is VALID [2022-04-28 12:45:39,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {89208#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89183#(< ~counter~0 39)} is VALID [2022-04-28 12:45:39,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {89208#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89208#(< ~counter~0 38)} is VALID [2022-04-28 12:45:39,541 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {88507#true} {89208#(< ~counter~0 38)} #92#return; {89208#(< ~counter~0 38)} is VALID [2022-04-28 12:45:39,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,541 INFO L272 TraceCheckUtils]: 11: Hoare triple {89208#(< ~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)); {88507#true} is VALID [2022-04-28 12:45:39,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {88507#true} {89208#(< ~counter~0 38)} #90#return; {89208#(< ~counter~0 38)} is VALID [2022-04-28 12:45:39,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {88507#true} assume true; {88507#true} is VALID [2022-04-28 12:45:39,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {88507#true} assume !(0 == ~cond); {88507#true} is VALID [2022-04-28 12:45:39,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {88507#true} ~cond := #in~cond; {88507#true} is VALID [2022-04-28 12:45:39,542 INFO L272 TraceCheckUtils]: 6: Hoare triple {89208#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {88507#true} is VALID [2022-04-28 12:45:39,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {89208#(< ~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; {89208#(< ~counter~0 38)} is VALID [2022-04-28 12:45:39,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {89208#(< ~counter~0 38)} call #t~ret9 := main(); {89208#(< ~counter~0 38)} is VALID [2022-04-28 12:45:39,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89208#(< ~counter~0 38)} {88507#true} #102#return; {89208#(< ~counter~0 38)} is VALID [2022-04-28 12:45:39,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {89208#(< ~counter~0 38)} assume true; {89208#(< ~counter~0 38)} is VALID [2022-04-28 12:45:39,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {88507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89208#(< ~counter~0 38)} is VALID [2022-04-28 12:45:39,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {88507#true} call ULTIMATE.init(); {88507#true} is VALID [2022-04-28 12:45:39,543 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-28 12:45:39,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:45:39,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956238880] [2022-04-28 12:45:39,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:45:39,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653510979] [2022-04-28 12:45:39,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653510979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:45:39,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:45:39,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 12:45:39,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:45:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1467671486] [2022-04-28 12:45:39,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1467671486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:39,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:39,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 12:45:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761899269] [2022-04-28 12:45:39,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:45:39,544 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-28 12:45:39,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:45:39,544 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-28 12:45:39,618 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-28 12:45:39,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 12:45:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 12:45:39,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 12:45:39,618 INFO L87 Difference]: Start difference. First operand 652 states and 868 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-28 12:45:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:41,912 INFO L93 Difference]: Finished difference Result 877 states and 1204 transitions. [2022-04-28 12:45:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 12:45:41,912 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-28 12:45:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:45:41,912 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-28 12:45:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-28 12:45:41,914 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-28 12:45:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-28 12:45:41,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-28 12:45:42,136 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-28 12:45:42,154 INFO L225 Difference]: With dead ends: 877 [2022-04-28 12:45:42,154 INFO L226 Difference]: Without dead ends: 680 [2022-04-28 12:45:42,156 INFO L412 NwaCegarLoop]: 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-28 12:45:42,156 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 203 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:45:42,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 272 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:45:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-04-28 12:45:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 670. [2022-04-28 12:45:43,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:45:43,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 680 states. Second operand has 670 states, 505 states have (on average 1.2118811881188118) internal successors, (612), 509 states have internal predecessors, (612), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:45:43,795 INFO L74 IsIncluded]: Start isIncluded. First operand 680 states. Second operand has 670 states, 505 states have (on average 1.2118811881188118) internal successors, (612), 509 states have internal predecessors, (612), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:45:43,795 INFO L87 Difference]: Start difference. First operand 680 states. Second operand has 670 states, 505 states have (on average 1.2118811881188118) internal successors, (612), 509 states have internal predecessors, (612), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:45:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:43,810 INFO L93 Difference]: Finished difference Result 680 states and 900 transitions. [2022-04-28 12:45:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 900 transitions. [2022-04-28 12:45:43,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:43,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:43,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 670 states, 505 states have (on average 1.2118811881188118) internal successors, (612), 509 states have internal predecessors, (612), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 680 states. [2022-04-28 12:45:43,812 INFO L87 Difference]: Start difference. First operand has 670 states, 505 states have (on average 1.2118811881188118) internal successors, (612), 509 states have internal predecessors, (612), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 680 states. [2022-04-28 12:45:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:43,826 INFO L93 Difference]: Finished difference Result 680 states and 900 transitions. [2022-04-28 12:45:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 900 transitions. [2022-04-28 12:45:43,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:43,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:43,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:45:43,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:45:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 505 states have (on average 1.2118811881188118) internal successors, (612), 509 states have internal predecessors, (612), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:45:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 890 transitions. [2022-04-28 12:45:43,847 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 890 transitions. Word has length 121 [2022-04-28 12:45:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:45:43,847 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 890 transitions. [2022-04-28 12:45:43,848 INFO L496 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-28 12:45:43,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 670 states and 890 transitions. [2022-04-28 12:45:58,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 890 edges. 889 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 890 transitions. [2022-04-28 12:45:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 12:45:58,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:45:58,528 INFO L195 NwaCegarLoop]: 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-28 12:45:58,533 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-28 12:45:58,728 WARN L477 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-28 12:45:58,729 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:45:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:45:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-28 12:45:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:58,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [853187] [2022-04-28 12:45:58,729 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:45:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-28 12:45:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:45:58,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020531016] [2022-04-28 12:45:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:45:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:45:58,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:45:58,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33574456] [2022-04-28 12:45:58,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:45:58,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:45:58,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:45:58,742 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-28 12:45:58,745 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-28 12:45:58,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:45:58,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:45:58,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 12:45:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:58,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:45:59,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {93736#true} call ULTIMATE.init(); {93736#true} is VALID [2022-04-28 12:45:59,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {93736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {93744#(<= ~counter~0 0)} assume true; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93744#(<= ~counter~0 0)} {93736#true} #102#return; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {93744#(<= ~counter~0 0)} call #t~ret9 := main(); {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {93744#(<= ~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; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {93744#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {93744#(<= ~counter~0 0)} ~cond := #in~cond; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {93744#(<= ~counter~0 0)} assume !(0 == ~cond); {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {93744#(<= ~counter~0 0)} assume true; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {93744#(<= ~counter~0 0)} {93744#(<= ~counter~0 0)} #90#return; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,446 INFO L272 TraceCheckUtils]: 11: Hoare triple {93744#(<= ~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)); {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {93744#(<= ~counter~0 0)} ~cond := #in~cond; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {93744#(<= ~counter~0 0)} assume !(0 == ~cond); {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {93744#(<= ~counter~0 0)} assume true; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {93744#(<= ~counter~0 0)} {93744#(<= ~counter~0 0)} #92#return; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {93744#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {93744#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:59,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {93744#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {93793#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:59,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {93793#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {93793#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:59,450 INFO L272 TraceCheckUtils]: 19: Hoare triple {93793#(<= ~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)); {93793#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:59,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {93793#(<= ~counter~0 1)} ~cond := #in~cond; {93793#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:59,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {93793#(<= ~counter~0 1)} assume !(0 == ~cond); {93793#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:59,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {93793#(<= ~counter~0 1)} assume true; {93793#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:59,451 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {93793#(<= ~counter~0 1)} {93793#(<= ~counter~0 1)} #94#return; {93793#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:59,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {93793#(<= ~counter~0 1)} assume !!(0 != ~r~0); {93793#(<= ~counter~0 1)} is VALID [2022-04-28 12:45:59,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {93793#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {93818#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:59,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {93818#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {93818#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:59,453 INFO L272 TraceCheckUtils]: 27: Hoare triple {93818#(<= ~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)); {93818#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:59,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {93818#(<= ~counter~0 2)} ~cond := #in~cond; {93818#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:59,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {93818#(<= ~counter~0 2)} assume !(0 == ~cond); {93818#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:59,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {93818#(<= ~counter~0 2)} assume true; {93818#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:59,454 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {93818#(<= ~counter~0 2)} {93818#(<= ~counter~0 2)} #96#return; {93818#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:59,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {93818#(<= ~counter~0 2)} assume !(~r~0 > 0); {93818#(<= ~counter~0 2)} is VALID [2022-04-28 12:45:59,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {93818#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93843#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:59,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {93843#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {93843#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:59,456 INFO L272 TraceCheckUtils]: 35: Hoare triple {93843#(<= ~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)); {93843#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:59,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {93843#(<= ~counter~0 3)} ~cond := #in~cond; {93843#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:59,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {93843#(<= ~counter~0 3)} assume !(0 == ~cond); {93843#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:59,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {93843#(<= ~counter~0 3)} assume true; {93843#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:59,469 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {93843#(<= ~counter~0 3)} {93843#(<= ~counter~0 3)} #98#return; {93843#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:59,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {93843#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {93843#(<= ~counter~0 3)} is VALID [2022-04-28 12:45:59,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {93843#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93868#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:59,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {93868#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {93868#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:59,472 INFO L272 TraceCheckUtils]: 43: Hoare triple {93868#(<= ~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)); {93868#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:59,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {93868#(<= ~counter~0 4)} ~cond := #in~cond; {93868#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:59,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {93868#(<= ~counter~0 4)} assume !(0 == ~cond); {93868#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:59,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {93868#(<= ~counter~0 4)} assume true; {93868#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:59,472 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {93868#(<= ~counter~0 4)} {93868#(<= ~counter~0 4)} #98#return; {93868#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:59,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {93868#(<= ~counter~0 4)} assume !(~r~0 < 0); {93868#(<= ~counter~0 4)} is VALID [2022-04-28 12:45:59,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {93868#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {93893#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:59,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {93893#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {93893#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:59,474 INFO L272 TraceCheckUtils]: 51: Hoare triple {93893#(<= ~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)); {93893#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:59,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {93893#(<= ~counter~0 5)} ~cond := #in~cond; {93893#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:59,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {93893#(<= ~counter~0 5)} assume !(0 == ~cond); {93893#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:59,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {93893#(<= ~counter~0 5)} assume true; {93893#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:59,474 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {93893#(<= ~counter~0 5)} {93893#(<= ~counter~0 5)} #94#return; {93893#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:59,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {93893#(<= ~counter~0 5)} assume !!(0 != ~r~0); {93893#(<= ~counter~0 5)} is VALID [2022-04-28 12:45:59,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {93893#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {93918#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:59,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {93918#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {93918#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:59,476 INFO L272 TraceCheckUtils]: 59: Hoare triple {93918#(<= ~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)); {93918#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:59,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {93918#(<= ~counter~0 6)} ~cond := #in~cond; {93918#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:59,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {93918#(<= ~counter~0 6)} assume !(0 == ~cond); {93918#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:59,476 INFO L290 TraceCheckUtils]: 62: Hoare triple {93918#(<= ~counter~0 6)} assume true; {93918#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:59,476 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {93918#(<= ~counter~0 6)} {93918#(<= ~counter~0 6)} #96#return; {93918#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:59,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {93918#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {93918#(<= ~counter~0 6)} is VALID [2022-04-28 12:45:59,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {93918#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {93943#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:59,477 INFO L290 TraceCheckUtils]: 66: Hoare triple {93943#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {93943#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:59,478 INFO L272 TraceCheckUtils]: 67: Hoare triple {93943#(<= ~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)); {93943#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:59,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {93943#(<= ~counter~0 7)} ~cond := #in~cond; {93943#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:59,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {93943#(<= ~counter~0 7)} assume !(0 == ~cond); {93943#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:59,478 INFO L290 TraceCheckUtils]: 70: Hoare triple {93943#(<= ~counter~0 7)} assume true; {93943#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:59,479 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {93943#(<= ~counter~0 7)} {93943#(<= ~counter~0 7)} #96#return; {93943#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:59,479 INFO L290 TraceCheckUtils]: 72: Hoare triple {93943#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {93943#(<= ~counter~0 7)} is VALID [2022-04-28 12:45:59,479 INFO L290 TraceCheckUtils]: 73: Hoare triple {93943#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {93968#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:59,480 INFO L290 TraceCheckUtils]: 74: Hoare triple {93968#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {93968#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:59,480 INFO L272 TraceCheckUtils]: 75: Hoare triple {93968#(<= ~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)); {93968#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:59,480 INFO L290 TraceCheckUtils]: 76: Hoare triple {93968#(<= ~counter~0 8)} ~cond := #in~cond; {93968#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:59,480 INFO L290 TraceCheckUtils]: 77: Hoare triple {93968#(<= ~counter~0 8)} assume !(0 == ~cond); {93968#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:59,480 INFO L290 TraceCheckUtils]: 78: Hoare triple {93968#(<= ~counter~0 8)} assume true; {93968#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:59,481 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {93968#(<= ~counter~0 8)} {93968#(<= ~counter~0 8)} #96#return; {93968#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:59,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {93968#(<= ~counter~0 8)} assume !(~r~0 > 0); {93968#(<= ~counter~0 8)} is VALID [2022-04-28 12:45:59,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {93968#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93993#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:59,482 INFO L290 TraceCheckUtils]: 82: Hoare triple {93993#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {93993#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:59,482 INFO L272 TraceCheckUtils]: 83: Hoare triple {93993#(<= ~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)); {93993#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:59,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {93993#(<= ~counter~0 9)} ~cond := #in~cond; {93993#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:59,482 INFO L290 TraceCheckUtils]: 85: Hoare triple {93993#(<= ~counter~0 9)} assume !(0 == ~cond); {93993#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:59,482 INFO L290 TraceCheckUtils]: 86: Hoare triple {93993#(<= ~counter~0 9)} assume true; {93993#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:59,483 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {93993#(<= ~counter~0 9)} {93993#(<= ~counter~0 9)} #98#return; {93993#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:59,483 INFO L290 TraceCheckUtils]: 88: Hoare triple {93993#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {93993#(<= ~counter~0 9)} is VALID [2022-04-28 12:45:59,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {93993#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94018#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:59,484 INFO L290 TraceCheckUtils]: 90: Hoare triple {94018#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {94018#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:59,484 INFO L272 TraceCheckUtils]: 91: Hoare triple {94018#(<= ~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)); {94018#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:59,484 INFO L290 TraceCheckUtils]: 92: Hoare triple {94018#(<= ~counter~0 10)} ~cond := #in~cond; {94018#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:59,484 INFO L290 TraceCheckUtils]: 93: Hoare triple {94018#(<= ~counter~0 10)} assume !(0 == ~cond); {94018#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:59,485 INFO L290 TraceCheckUtils]: 94: Hoare triple {94018#(<= ~counter~0 10)} assume true; {94018#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:59,485 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94018#(<= ~counter~0 10)} {94018#(<= ~counter~0 10)} #98#return; {94018#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:59,485 INFO L290 TraceCheckUtils]: 96: Hoare triple {94018#(<= ~counter~0 10)} assume !(~r~0 < 0); {94018#(<= ~counter~0 10)} is VALID [2022-04-28 12:45:59,486 INFO L290 TraceCheckUtils]: 97: Hoare triple {94018#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94043#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:59,486 INFO L290 TraceCheckUtils]: 98: Hoare triple {94043#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {94043#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:59,486 INFO L272 TraceCheckUtils]: 99: Hoare triple {94043#(<= ~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)); {94043#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:59,486 INFO L290 TraceCheckUtils]: 100: Hoare triple {94043#(<= ~counter~0 11)} ~cond := #in~cond; {94043#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:59,486 INFO L290 TraceCheckUtils]: 101: Hoare triple {94043#(<= ~counter~0 11)} assume !(0 == ~cond); {94043#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:59,487 INFO L290 TraceCheckUtils]: 102: Hoare triple {94043#(<= ~counter~0 11)} assume true; {94043#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:59,487 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94043#(<= ~counter~0 11)} {94043#(<= ~counter~0 11)} #94#return; {94043#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:59,487 INFO L290 TraceCheckUtils]: 104: Hoare triple {94043#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94043#(<= ~counter~0 11)} is VALID [2022-04-28 12:45:59,488 INFO L290 TraceCheckUtils]: 105: Hoare triple {94043#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94068#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:59,488 INFO L290 TraceCheckUtils]: 106: Hoare triple {94068#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {94068#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:59,488 INFO L272 TraceCheckUtils]: 107: Hoare triple {94068#(<= ~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)); {94068#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:59,488 INFO L290 TraceCheckUtils]: 108: Hoare triple {94068#(<= ~counter~0 12)} ~cond := #in~cond; {94068#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:59,488 INFO L290 TraceCheckUtils]: 109: Hoare triple {94068#(<= ~counter~0 12)} assume !(0 == ~cond); {94068#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:59,489 INFO L290 TraceCheckUtils]: 110: Hoare triple {94068#(<= ~counter~0 12)} assume true; {94068#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:59,489 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94068#(<= ~counter~0 12)} {94068#(<= ~counter~0 12)} #96#return; {94068#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:59,489 INFO L290 TraceCheckUtils]: 112: Hoare triple {94068#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94068#(<= ~counter~0 12)} is VALID [2022-04-28 12:45:59,489 INFO L290 TraceCheckUtils]: 113: Hoare triple {94068#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94093#(<= |main_#t~post7| 12)} is VALID [2022-04-28 12:45:59,490 INFO L290 TraceCheckUtils]: 114: Hoare triple {94093#(<= |main_#t~post7| 12)} assume !(#t~post7 < 50);havoc #t~post7; {93737#false} is VALID [2022-04-28 12:45:59,490 INFO L290 TraceCheckUtils]: 115: Hoare triple {93737#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93737#false} is VALID [2022-04-28 12:45:59,490 INFO L290 TraceCheckUtils]: 116: Hoare triple {93737#false} assume !(#t~post8 < 50);havoc #t~post8; {93737#false} is VALID [2022-04-28 12:45:59,490 INFO L290 TraceCheckUtils]: 117: Hoare triple {93737#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {93737#false} is VALID [2022-04-28 12:45:59,490 INFO L290 TraceCheckUtils]: 118: Hoare triple {93737#false} assume !(#t~post6 < 50);havoc #t~post6; {93737#false} is VALID [2022-04-28 12:45:59,490 INFO L272 TraceCheckUtils]: 119: Hoare triple {93737#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {93737#false} is VALID [2022-04-28 12:45:59,490 INFO L290 TraceCheckUtils]: 120: Hoare triple {93737#false} ~cond := #in~cond; {93737#false} is VALID [2022-04-28 12:45:59,490 INFO L290 TraceCheckUtils]: 121: Hoare triple {93737#false} assume 0 == ~cond; {93737#false} is VALID [2022-04-28 12:45:59,490 INFO L290 TraceCheckUtils]: 122: Hoare triple {93737#false} assume !false; {93737#false} is VALID [2022-04-28 12:45:59,490 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-28 12:45:59,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 122: Hoare triple {93737#false} assume !false; {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 121: Hoare triple {93737#false} assume 0 == ~cond; {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 120: Hoare triple {93737#false} ~cond := #in~cond; {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L272 TraceCheckUtils]: 119: Hoare triple {93737#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 118: Hoare triple {93737#false} assume !(#t~post6 < 50);havoc #t~post6; {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 117: Hoare triple {93737#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 116: Hoare triple {93737#false} assume !(#t~post8 < 50);havoc #t~post8; {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 115: Hoare triple {93737#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 114: Hoare triple {94145#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {93737#false} is VALID [2022-04-28 12:45:59,876 INFO L290 TraceCheckUtils]: 113: Hoare triple {94149#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94145#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:45:59,877 INFO L290 TraceCheckUtils]: 112: Hoare triple {94149#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94149#(< ~counter~0 50)} is VALID [2022-04-28 12:45:59,877 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {93736#true} {94149#(< ~counter~0 50)} #96#return; {94149#(< ~counter~0 50)} is VALID [2022-04-28 12:45:59,877 INFO L290 TraceCheckUtils]: 110: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,877 INFO L290 TraceCheckUtils]: 109: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,877 INFO L290 TraceCheckUtils]: 108: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,877 INFO L272 TraceCheckUtils]: 107: Hoare triple {94149#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,877 INFO L290 TraceCheckUtils]: 106: Hoare triple {94149#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {94149#(< ~counter~0 50)} is VALID [2022-04-28 12:45:59,879 INFO L290 TraceCheckUtils]: 105: Hoare triple {94174#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94149#(< ~counter~0 50)} is VALID [2022-04-28 12:45:59,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {94174#(< ~counter~0 49)} assume !!(0 != ~r~0); {94174#(< ~counter~0 49)} is VALID [2022-04-28 12:45:59,880 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {93736#true} {94174#(< ~counter~0 49)} #94#return; {94174#(< ~counter~0 49)} is VALID [2022-04-28 12:45:59,880 INFO L290 TraceCheckUtils]: 102: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,880 INFO L290 TraceCheckUtils]: 101: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,880 INFO L290 TraceCheckUtils]: 100: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,880 INFO L272 TraceCheckUtils]: 99: Hoare triple {94174#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,880 INFO L290 TraceCheckUtils]: 98: Hoare triple {94174#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {94174#(< ~counter~0 49)} is VALID [2022-04-28 12:45:59,881 INFO L290 TraceCheckUtils]: 97: Hoare triple {94199#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94174#(< ~counter~0 49)} is VALID [2022-04-28 12:45:59,881 INFO L290 TraceCheckUtils]: 96: Hoare triple {94199#(< ~counter~0 48)} assume !(~r~0 < 0); {94199#(< ~counter~0 48)} is VALID [2022-04-28 12:45:59,881 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {93736#true} {94199#(< ~counter~0 48)} #98#return; {94199#(< ~counter~0 48)} is VALID [2022-04-28 12:45:59,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,881 INFO L290 TraceCheckUtils]: 93: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,881 INFO L290 TraceCheckUtils]: 92: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,881 INFO L272 TraceCheckUtils]: 91: Hoare triple {94199#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,881 INFO L290 TraceCheckUtils]: 90: Hoare triple {94199#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {94199#(< ~counter~0 48)} is VALID [2022-04-28 12:45:59,882 INFO L290 TraceCheckUtils]: 89: Hoare triple {94224#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94199#(< ~counter~0 48)} is VALID [2022-04-28 12:45:59,882 INFO L290 TraceCheckUtils]: 88: Hoare triple {94224#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94224#(< ~counter~0 47)} is VALID [2022-04-28 12:45:59,883 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {93736#true} {94224#(< ~counter~0 47)} #98#return; {94224#(< ~counter~0 47)} is VALID [2022-04-28 12:45:59,883 INFO L290 TraceCheckUtils]: 86: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,883 INFO L290 TraceCheckUtils]: 85: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,883 INFO L290 TraceCheckUtils]: 84: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,883 INFO L272 TraceCheckUtils]: 83: Hoare triple {94224#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,883 INFO L290 TraceCheckUtils]: 82: Hoare triple {94224#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {94224#(< ~counter~0 47)} is VALID [2022-04-28 12:45:59,884 INFO L290 TraceCheckUtils]: 81: Hoare triple {94249#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94224#(< ~counter~0 47)} is VALID [2022-04-28 12:45:59,884 INFO L290 TraceCheckUtils]: 80: Hoare triple {94249#(< ~counter~0 46)} assume !(~r~0 > 0); {94249#(< ~counter~0 46)} is VALID [2022-04-28 12:45:59,884 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {93736#true} {94249#(< ~counter~0 46)} #96#return; {94249#(< ~counter~0 46)} is VALID [2022-04-28 12:45:59,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,884 INFO L290 TraceCheckUtils]: 77: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,884 INFO L290 TraceCheckUtils]: 76: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,884 INFO L272 TraceCheckUtils]: 75: Hoare triple {94249#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {94249#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {94249#(< ~counter~0 46)} is VALID [2022-04-28 12:45:59,885 INFO L290 TraceCheckUtils]: 73: Hoare triple {94274#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94249#(< ~counter~0 46)} is VALID [2022-04-28 12:45:59,885 INFO L290 TraceCheckUtils]: 72: Hoare triple {94274#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94274#(< ~counter~0 45)} is VALID [2022-04-28 12:45:59,886 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {93736#true} {94274#(< ~counter~0 45)} #96#return; {94274#(< ~counter~0 45)} is VALID [2022-04-28 12:45:59,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,886 INFO L290 TraceCheckUtils]: 69: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,886 INFO L290 TraceCheckUtils]: 68: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,886 INFO L272 TraceCheckUtils]: 67: Hoare triple {94274#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,886 INFO L290 TraceCheckUtils]: 66: Hoare triple {94274#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {94274#(< ~counter~0 45)} is VALID [2022-04-28 12:45:59,887 INFO L290 TraceCheckUtils]: 65: Hoare triple {94299#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94274#(< ~counter~0 45)} is VALID [2022-04-28 12:45:59,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {94299#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94299#(< ~counter~0 44)} is VALID [2022-04-28 12:45:59,887 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {93736#true} {94299#(< ~counter~0 44)} #96#return; {94299#(< ~counter~0 44)} is VALID [2022-04-28 12:45:59,887 INFO L290 TraceCheckUtils]: 62: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,887 INFO L272 TraceCheckUtils]: 59: Hoare triple {94299#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,888 INFO L290 TraceCheckUtils]: 58: Hoare triple {94299#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {94299#(< ~counter~0 44)} is VALID [2022-04-28 12:45:59,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {94324#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94299#(< ~counter~0 44)} is VALID [2022-04-28 12:45:59,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {94324#(< ~counter~0 43)} assume !!(0 != ~r~0); {94324#(< ~counter~0 43)} is VALID [2022-04-28 12:45:59,889 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {93736#true} {94324#(< ~counter~0 43)} #94#return; {94324#(< ~counter~0 43)} is VALID [2022-04-28 12:45:59,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,889 INFO L272 TraceCheckUtils]: 51: Hoare triple {94324#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {94324#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {94324#(< ~counter~0 43)} is VALID [2022-04-28 12:45:59,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {94349#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94324#(< ~counter~0 43)} is VALID [2022-04-28 12:45:59,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {94349#(< ~counter~0 42)} assume !(~r~0 < 0); {94349#(< ~counter~0 42)} is VALID [2022-04-28 12:45:59,890 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {93736#true} {94349#(< ~counter~0 42)} #98#return; {94349#(< ~counter~0 42)} is VALID [2022-04-28 12:45:59,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,891 INFO L272 TraceCheckUtils]: 43: Hoare triple {94349#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {94349#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {94349#(< ~counter~0 42)} is VALID [2022-04-28 12:45:59,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {94374#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94349#(< ~counter~0 42)} is VALID [2022-04-28 12:45:59,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {94374#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94374#(< ~counter~0 41)} is VALID [2022-04-28 12:45:59,892 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {93736#true} {94374#(< ~counter~0 41)} #98#return; {94374#(< ~counter~0 41)} is VALID [2022-04-28 12:45:59,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,892 INFO L272 TraceCheckUtils]: 35: Hoare triple {94374#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {94374#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {94374#(< ~counter~0 41)} is VALID [2022-04-28 12:45:59,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {94399#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94374#(< ~counter~0 41)} is VALID [2022-04-28 12:45:59,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {94399#(< ~counter~0 40)} assume !(~r~0 > 0); {94399#(< ~counter~0 40)} is VALID [2022-04-28 12:45:59,893 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {93736#true} {94399#(< ~counter~0 40)} #96#return; {94399#(< ~counter~0 40)} is VALID [2022-04-28 12:45:59,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,894 INFO L272 TraceCheckUtils]: 27: Hoare triple {94399#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {94399#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {94399#(< ~counter~0 40)} is VALID [2022-04-28 12:45:59,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {94424#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94399#(< ~counter~0 40)} is VALID [2022-04-28 12:45:59,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {94424#(< ~counter~0 39)} assume !!(0 != ~r~0); {94424#(< ~counter~0 39)} is VALID [2022-04-28 12:45:59,895 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {93736#true} {94424#(< ~counter~0 39)} #94#return; {94424#(< ~counter~0 39)} is VALID [2022-04-28 12:45:59,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,895 INFO L272 TraceCheckUtils]: 19: Hoare triple {94424#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {94424#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {94424#(< ~counter~0 39)} is VALID [2022-04-28 12:45:59,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {94449#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94424#(< ~counter~0 39)} is VALID [2022-04-28 12:45:59,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {94449#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94449#(< ~counter~0 38)} is VALID [2022-04-28 12:45:59,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {93736#true} {94449#(< ~counter~0 38)} #92#return; {94449#(< ~counter~0 38)} is VALID [2022-04-28 12:45:59,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,897 INFO L272 TraceCheckUtils]: 11: Hoare triple {94449#(< ~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)); {93736#true} is VALID [2022-04-28 12:45:59,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {93736#true} {94449#(< ~counter~0 38)} #90#return; {94449#(< ~counter~0 38)} is VALID [2022-04-28 12:45:59,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {93736#true} assume true; {93736#true} is VALID [2022-04-28 12:45:59,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {93736#true} assume !(0 == ~cond); {93736#true} is VALID [2022-04-28 12:45:59,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {93736#true} ~cond := #in~cond; {93736#true} is VALID [2022-04-28 12:45:59,897 INFO L272 TraceCheckUtils]: 6: Hoare triple {94449#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {93736#true} is VALID [2022-04-28 12:45:59,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {94449#(< ~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; {94449#(< ~counter~0 38)} is VALID [2022-04-28 12:45:59,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {94449#(< ~counter~0 38)} call #t~ret9 := main(); {94449#(< ~counter~0 38)} is VALID [2022-04-28 12:45:59,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94449#(< ~counter~0 38)} {93736#true} #102#return; {94449#(< ~counter~0 38)} is VALID [2022-04-28 12:45:59,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {94449#(< ~counter~0 38)} assume true; {94449#(< ~counter~0 38)} is VALID [2022-04-28 12:45:59,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {93736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94449#(< ~counter~0 38)} is VALID [2022-04-28 12:45:59,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {93736#true} call ULTIMATE.init(); {93736#true} is VALID [2022-04-28 12:45:59,898 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-28 12:45:59,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:45:59,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020531016] [2022-04-28 12:45:59,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:45:59,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33574456] [2022-04-28 12:45:59,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33574456] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:45:59,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:45:59,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 12:45:59,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:45:59,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [853187] [2022-04-28 12:45:59,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [853187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:59,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:59,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 12:45:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132324240] [2022-04-28 12:45:59,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:45:59,900 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-28 12:45:59,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:45:59,900 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-28 12:45:59,975 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-28 12:45:59,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 12:45:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 12:45:59,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 12:45:59,976 INFO L87 Difference]: Start difference. First operand 670 states and 890 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-28 12:46:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:02,114 INFO L93 Difference]: Finished difference Result 887 states and 1217 transitions. [2022-04-28 12:46:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 12:46:02,114 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-28 12:46:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:46:02,114 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-28 12:46:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-28 12:46:02,125 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-28 12:46:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-28 12:46:02,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-28 12:46:02,328 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-28 12:46:02,363 INFO L225 Difference]: With dead ends: 887 [2022-04-28 12:46:02,363 INFO L226 Difference]: Without dead ends: 686 [2022-04-28 12:46:02,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=691, Invalid=949, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 12:46:02,365 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 186 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:46:02,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 283 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:46:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-04-28 12:46:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2022-04-28 12:46:03,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:46:03,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 686 states. Second operand has 686 states, 521 states have (on average 1.2053742802303262) internal successors, (628), 521 states have internal predecessors, (628), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:46:03,601 INFO L74 IsIncluded]: Start isIncluded. First operand 686 states. Second operand has 686 states, 521 states have (on average 1.2053742802303262) internal successors, (628), 521 states have internal predecessors, (628), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:46:03,601 INFO L87 Difference]: Start difference. First operand 686 states. Second operand has 686 states, 521 states have (on average 1.2053742802303262) internal successors, (628), 521 states have internal predecessors, (628), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:46:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:03,616 INFO L93 Difference]: Finished difference Result 686 states and 906 transitions. [2022-04-28 12:46:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 906 transitions. [2022-04-28 12:46:03,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:46:03,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:46:03,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 686 states, 521 states have (on average 1.2053742802303262) internal successors, (628), 521 states have internal predecessors, (628), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 686 states. [2022-04-28 12:46:03,618 INFO L87 Difference]: Start difference. First operand has 686 states, 521 states have (on average 1.2053742802303262) internal successors, (628), 521 states have internal predecessors, (628), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 686 states. [2022-04-28 12:46:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:03,633 INFO L93 Difference]: Finished difference Result 686 states and 906 transitions. [2022-04-28 12:46:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 906 transitions. [2022-04-28 12:46:03,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:46:03,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:46:03,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:46:03,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:46:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 521 states have (on average 1.2053742802303262) internal successors, (628), 521 states have internal predecessors, (628), 140 states have call successors, (140), 26 states have call predecessors, (140), 24 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 12:46:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 906 transitions. [2022-04-28 12:46:03,654 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 906 transitions. Word has length 123 [2022-04-28 12:46:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:46:03,654 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 906 transitions. [2022-04-28 12:46:03,654 INFO L496 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-28 12:46:03,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 686 states and 906 transitions. [2022-04-28 12:46:20,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 906 edges. 904 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:46:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 906 transitions. [2022-04-28 12:46:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 12:46:20,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:46:20,806 INFO L195 NwaCegarLoop]: 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-28 12:46:20,825 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-28 12:46:21,006 WARN L477 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-28 12:46:21,006 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:46:21,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:46:21,007 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-28 12:46:21,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:46:21,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393398256] [2022-04-28 12:46:21,007 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:46:21,007 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-28 12:46:21,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:46:21,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743926545] [2022-04-28 12:46:21,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:46:21,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:46:21,035 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:46:21,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638336498] [2022-04-28 12:46:21,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:46:21,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:46:21,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:46:21,045 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-28 12:46:21,046 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-28 12:46:21,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:46:21,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:46:21,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 12:46:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:46:21,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:46:21,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {99043#true} call ULTIMATE.init(); {99043#true} is VALID [2022-04-28 12:46:21,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {99043#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {99051#(<= ~counter~0 0)} assume true; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99051#(<= ~counter~0 0)} {99043#true} #102#return; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {99051#(<= ~counter~0 0)} call #t~ret9 := main(); {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {99051#(<= ~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; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {99051#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {99051#(<= ~counter~0 0)} ~cond := #in~cond; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {99051#(<= ~counter~0 0)} assume !(0 == ~cond); {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {99051#(<= ~counter~0 0)} assume true; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99051#(<= ~counter~0 0)} {99051#(<= ~counter~0 0)} #90#return; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,706 INFO L272 TraceCheckUtils]: 11: Hoare triple {99051#(<= ~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)); {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {99051#(<= ~counter~0 0)} ~cond := #in~cond; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {99051#(<= ~counter~0 0)} assume !(0 == ~cond); {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {99051#(<= ~counter~0 0)} assume true; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99051#(<= ~counter~0 0)} {99051#(<= ~counter~0 0)} #92#return; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {99051#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {99051#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:21,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {99051#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99100#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:21,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {99100#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {99100#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:21,709 INFO L272 TraceCheckUtils]: 19: Hoare triple {99100#(<= ~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)); {99100#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:21,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {99100#(<= ~counter~0 1)} ~cond := #in~cond; {99100#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:21,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {99100#(<= ~counter~0 1)} assume !(0 == ~cond); {99100#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:21,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {99100#(<= ~counter~0 1)} assume true; {99100#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:21,710 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99100#(<= ~counter~0 1)} {99100#(<= ~counter~0 1)} #94#return; {99100#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:21,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {99100#(<= ~counter~0 1)} assume !!(0 != ~r~0); {99100#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:21,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {99100#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99125#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:21,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {99125#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {99125#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:21,711 INFO L272 TraceCheckUtils]: 27: Hoare triple {99125#(<= ~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)); {99125#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:21,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {99125#(<= ~counter~0 2)} ~cond := #in~cond; {99125#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:21,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {99125#(<= ~counter~0 2)} assume !(0 == ~cond); {99125#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:21,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {99125#(<= ~counter~0 2)} assume true; {99125#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:21,712 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99125#(<= ~counter~0 2)} {99125#(<= ~counter~0 2)} #96#return; {99125#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:21,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {99125#(<= ~counter~0 2)} assume !(~r~0 > 0); {99125#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:21,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {99125#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99150#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:21,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {99150#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {99150#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:21,713 INFO L272 TraceCheckUtils]: 35: Hoare triple {99150#(<= ~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)); {99150#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:21,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {99150#(<= ~counter~0 3)} ~cond := #in~cond; {99150#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:21,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {99150#(<= ~counter~0 3)} assume !(0 == ~cond); {99150#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:21,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {99150#(<= ~counter~0 3)} assume true; {99150#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:21,714 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99150#(<= ~counter~0 3)} {99150#(<= ~counter~0 3)} #98#return; {99150#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:21,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {99150#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99150#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:21,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {99150#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99175#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:21,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {99175#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {99175#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:21,716 INFO L272 TraceCheckUtils]: 43: Hoare triple {99175#(<= ~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)); {99175#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:21,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {99175#(<= ~counter~0 4)} ~cond := #in~cond; {99175#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:21,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {99175#(<= ~counter~0 4)} assume !(0 == ~cond); {99175#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:21,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {99175#(<= ~counter~0 4)} assume true; {99175#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:21,716 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99175#(<= ~counter~0 4)} {99175#(<= ~counter~0 4)} #98#return; {99175#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:21,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {99175#(<= ~counter~0 4)} assume !(~r~0 < 0); {99175#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:21,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {99175#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99200#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:21,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {99200#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {99200#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:21,718 INFO L272 TraceCheckUtils]: 51: Hoare triple {99200#(<= ~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)); {99200#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:21,718 INFO L290 TraceCheckUtils]: 52: Hoare triple {99200#(<= ~counter~0 5)} ~cond := #in~cond; {99200#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:21,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {99200#(<= ~counter~0 5)} assume !(0 == ~cond); {99200#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:21,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {99200#(<= ~counter~0 5)} assume true; {99200#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:21,718 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99200#(<= ~counter~0 5)} {99200#(<= ~counter~0 5)} #94#return; {99200#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:21,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {99200#(<= ~counter~0 5)} assume !!(0 != ~r~0); {99200#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:21,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {99200#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99225#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:21,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {99225#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {99225#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:21,720 INFO L272 TraceCheckUtils]: 59: Hoare triple {99225#(<= ~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)); {99225#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:21,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {99225#(<= ~counter~0 6)} ~cond := #in~cond; {99225#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:21,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {99225#(<= ~counter~0 6)} assume !(0 == ~cond); {99225#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:21,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {99225#(<= ~counter~0 6)} assume true; {99225#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:21,720 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99225#(<= ~counter~0 6)} {99225#(<= ~counter~0 6)} #96#return; {99225#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:21,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {99225#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99225#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:21,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {99225#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99250#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:21,722 INFO L290 TraceCheckUtils]: 66: Hoare triple {99250#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {99250#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:21,722 INFO L272 TraceCheckUtils]: 67: Hoare triple {99250#(<= ~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)); {99250#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:21,722 INFO L290 TraceCheckUtils]: 68: Hoare triple {99250#(<= ~counter~0 7)} ~cond := #in~cond; {99250#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:21,722 INFO L290 TraceCheckUtils]: 69: Hoare triple {99250#(<= ~counter~0 7)} assume !(0 == ~cond); {99250#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:21,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {99250#(<= ~counter~0 7)} assume true; {99250#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:21,723 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99250#(<= ~counter~0 7)} {99250#(<= ~counter~0 7)} #96#return; {99250#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:21,723 INFO L290 TraceCheckUtils]: 72: Hoare triple {99250#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99250#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:21,723 INFO L290 TraceCheckUtils]: 73: Hoare triple {99250#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99275#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:21,724 INFO L290 TraceCheckUtils]: 74: Hoare triple {99275#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {99275#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:21,724 INFO L272 TraceCheckUtils]: 75: Hoare triple {99275#(<= ~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)); {99275#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:21,724 INFO L290 TraceCheckUtils]: 76: Hoare triple {99275#(<= ~counter~0 8)} ~cond := #in~cond; {99275#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:21,724 INFO L290 TraceCheckUtils]: 77: Hoare triple {99275#(<= ~counter~0 8)} assume !(0 == ~cond); {99275#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:21,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {99275#(<= ~counter~0 8)} assume true; {99275#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:21,725 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99275#(<= ~counter~0 8)} {99275#(<= ~counter~0 8)} #96#return; {99275#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:21,725 INFO L290 TraceCheckUtils]: 80: Hoare triple {99275#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99275#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:21,726 INFO L290 TraceCheckUtils]: 81: Hoare triple {99275#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99300#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:21,726 INFO L290 TraceCheckUtils]: 82: Hoare triple {99300#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {99300#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:21,726 INFO L272 TraceCheckUtils]: 83: Hoare triple {99300#(<= ~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)); {99300#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:21,726 INFO L290 TraceCheckUtils]: 84: Hoare triple {99300#(<= ~counter~0 9)} ~cond := #in~cond; {99300#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:21,726 INFO L290 TraceCheckUtils]: 85: Hoare triple {99300#(<= ~counter~0 9)} assume !(0 == ~cond); {99300#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:21,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {99300#(<= ~counter~0 9)} assume true; {99300#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:21,727 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99300#(<= ~counter~0 9)} {99300#(<= ~counter~0 9)} #96#return; {99300#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:21,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {99300#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99300#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:21,728 INFO L290 TraceCheckUtils]: 89: Hoare triple {99300#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99325#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:21,728 INFO L290 TraceCheckUtils]: 90: Hoare triple {99325#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {99325#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:21,728 INFO L272 TraceCheckUtils]: 91: Hoare triple {99325#(<= ~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)); {99325#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:21,728 INFO L290 TraceCheckUtils]: 92: Hoare triple {99325#(<= ~counter~0 10)} ~cond := #in~cond; {99325#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:21,728 INFO L290 TraceCheckUtils]: 93: Hoare triple {99325#(<= ~counter~0 10)} assume !(0 == ~cond); {99325#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:21,729 INFO L290 TraceCheckUtils]: 94: Hoare triple {99325#(<= ~counter~0 10)} assume true; {99325#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:21,729 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99325#(<= ~counter~0 10)} {99325#(<= ~counter~0 10)} #96#return; {99325#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:21,729 INFO L290 TraceCheckUtils]: 96: Hoare triple {99325#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99325#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:21,730 INFO L290 TraceCheckUtils]: 97: Hoare triple {99325#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99350#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:21,730 INFO L290 TraceCheckUtils]: 98: Hoare triple {99350#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {99350#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:21,730 INFO L272 TraceCheckUtils]: 99: Hoare triple {99350#(<= ~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)); {99350#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:21,730 INFO L290 TraceCheckUtils]: 100: Hoare triple {99350#(<= ~counter~0 11)} ~cond := #in~cond; {99350#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:21,730 INFO L290 TraceCheckUtils]: 101: Hoare triple {99350#(<= ~counter~0 11)} assume !(0 == ~cond); {99350#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:21,731 INFO L290 TraceCheckUtils]: 102: Hoare triple {99350#(<= ~counter~0 11)} assume true; {99350#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:21,731 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99350#(<= ~counter~0 11)} {99350#(<= ~counter~0 11)} #96#return; {99350#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:21,731 INFO L290 TraceCheckUtils]: 104: Hoare triple {99350#(<= ~counter~0 11)} assume !(~r~0 > 0); {99350#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:21,732 INFO L290 TraceCheckUtils]: 105: Hoare triple {99350#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99375#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:21,732 INFO L290 TraceCheckUtils]: 106: Hoare triple {99375#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {99375#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:21,732 INFO L272 TraceCheckUtils]: 107: Hoare triple {99375#(<= ~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)); {99375#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:21,732 INFO L290 TraceCheckUtils]: 108: Hoare triple {99375#(<= ~counter~0 12)} ~cond := #in~cond; {99375#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:21,733 INFO L290 TraceCheckUtils]: 109: Hoare triple {99375#(<= ~counter~0 12)} assume !(0 == ~cond); {99375#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:21,733 INFO L290 TraceCheckUtils]: 110: Hoare triple {99375#(<= ~counter~0 12)} assume true; {99375#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:21,733 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99375#(<= ~counter~0 12)} {99375#(<= ~counter~0 12)} #98#return; {99375#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:21,733 INFO L290 TraceCheckUtils]: 112: Hoare triple {99375#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99375#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:21,734 INFO L290 TraceCheckUtils]: 113: Hoare triple {99375#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99400#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:21,734 INFO L290 TraceCheckUtils]: 114: Hoare triple {99400#(<= ~counter~0 13)} assume !!(#t~post8 < 50);havoc #t~post8; {99400#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:21,734 INFO L272 TraceCheckUtils]: 115: Hoare triple {99400#(<= ~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)); {99400#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:21,735 INFO L290 TraceCheckUtils]: 116: Hoare triple {99400#(<= ~counter~0 13)} ~cond := #in~cond; {99400#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:21,735 INFO L290 TraceCheckUtils]: 117: Hoare triple {99400#(<= ~counter~0 13)} assume !(0 == ~cond); {99400#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:21,735 INFO L290 TraceCheckUtils]: 118: Hoare triple {99400#(<= ~counter~0 13)} assume true; {99400#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:21,735 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99400#(<= ~counter~0 13)} {99400#(<= ~counter~0 13)} #98#return; {99400#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:21,735 INFO L290 TraceCheckUtils]: 120: Hoare triple {99400#(<= ~counter~0 13)} assume !(~r~0 < 0); {99400#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:21,736 INFO L290 TraceCheckUtils]: 121: Hoare triple {99400#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99425#(<= |main_#t~post6| 13)} is VALID [2022-04-28 12:46:21,736 INFO L290 TraceCheckUtils]: 122: Hoare triple {99425#(<= |main_#t~post6| 13)} assume !(#t~post6 < 50);havoc #t~post6; {99044#false} is VALID [2022-04-28 12:46:21,736 INFO L272 TraceCheckUtils]: 123: Hoare triple {99044#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99044#false} is VALID [2022-04-28 12:46:21,736 INFO L290 TraceCheckUtils]: 124: Hoare triple {99044#false} ~cond := #in~cond; {99044#false} is VALID [2022-04-28 12:46:21,736 INFO L290 TraceCheckUtils]: 125: Hoare triple {99044#false} assume 0 == ~cond; {99044#false} is VALID [2022-04-28 12:46:21,736 INFO L290 TraceCheckUtils]: 126: Hoare triple {99044#false} assume !false; {99044#false} is VALID [2022-04-28 12:46:21,736 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-28 12:46:21,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:46:22,206 INFO L290 TraceCheckUtils]: 126: Hoare triple {99044#false} assume !false; {99044#false} is VALID [2022-04-28 12:46:22,206 INFO L290 TraceCheckUtils]: 125: Hoare triple {99044#false} assume 0 == ~cond; {99044#false} is VALID [2022-04-28 12:46:22,206 INFO L290 TraceCheckUtils]: 124: Hoare triple {99044#false} ~cond := #in~cond; {99044#false} is VALID [2022-04-28 12:46:22,206 INFO L272 TraceCheckUtils]: 123: Hoare triple {99044#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99044#false} is VALID [2022-04-28 12:46:22,206 INFO L290 TraceCheckUtils]: 122: Hoare triple {99453#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {99044#false} is VALID [2022-04-28 12:46:22,207 INFO L290 TraceCheckUtils]: 121: Hoare triple {99457#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99453#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:46:22,207 INFO L290 TraceCheckUtils]: 120: Hoare triple {99457#(< ~counter~0 50)} assume !(~r~0 < 0); {99457#(< ~counter~0 50)} is VALID [2022-04-28 12:46:22,207 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99043#true} {99457#(< ~counter~0 50)} #98#return; {99457#(< ~counter~0 50)} is VALID [2022-04-28 12:46:22,207 INFO L290 TraceCheckUtils]: 118: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,207 INFO L290 TraceCheckUtils]: 117: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,207 INFO L290 TraceCheckUtils]: 116: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,207 INFO L272 TraceCheckUtils]: 115: Hoare triple {99457#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,207 INFO L290 TraceCheckUtils]: 114: Hoare triple {99457#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {99457#(< ~counter~0 50)} is VALID [2022-04-28 12:46:22,209 INFO L290 TraceCheckUtils]: 113: Hoare triple {99482#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99457#(< ~counter~0 50)} is VALID [2022-04-28 12:46:22,209 INFO L290 TraceCheckUtils]: 112: Hoare triple {99482#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99482#(< ~counter~0 49)} is VALID [2022-04-28 12:46:22,210 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99043#true} {99482#(< ~counter~0 49)} #98#return; {99482#(< ~counter~0 49)} is VALID [2022-04-28 12:46:22,210 INFO L290 TraceCheckUtils]: 110: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,210 INFO L290 TraceCheckUtils]: 109: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,210 INFO L290 TraceCheckUtils]: 108: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,210 INFO L272 TraceCheckUtils]: 107: Hoare triple {99482#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,210 INFO L290 TraceCheckUtils]: 106: Hoare triple {99482#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {99482#(< ~counter~0 49)} is VALID [2022-04-28 12:46:22,211 INFO L290 TraceCheckUtils]: 105: Hoare triple {99507#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99482#(< ~counter~0 49)} is VALID [2022-04-28 12:46:22,211 INFO L290 TraceCheckUtils]: 104: Hoare triple {99507#(< ~counter~0 48)} assume !(~r~0 > 0); {99507#(< ~counter~0 48)} is VALID [2022-04-28 12:46:22,211 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99043#true} {99507#(< ~counter~0 48)} #96#return; {99507#(< ~counter~0 48)} is VALID [2022-04-28 12:46:22,211 INFO L290 TraceCheckUtils]: 102: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,211 INFO L290 TraceCheckUtils]: 101: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,211 INFO L290 TraceCheckUtils]: 100: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,211 INFO L272 TraceCheckUtils]: 99: Hoare triple {99507#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,212 INFO L290 TraceCheckUtils]: 98: Hoare triple {99507#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {99507#(< ~counter~0 48)} is VALID [2022-04-28 12:46:22,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {99532#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99507#(< ~counter~0 48)} is VALID [2022-04-28 12:46:22,214 INFO L290 TraceCheckUtils]: 96: Hoare triple {99532#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99532#(< ~counter~0 47)} is VALID [2022-04-28 12:46:22,214 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99043#true} {99532#(< ~counter~0 47)} #96#return; {99532#(< ~counter~0 47)} is VALID [2022-04-28 12:46:22,214 INFO L290 TraceCheckUtils]: 94: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,214 INFO L290 TraceCheckUtils]: 93: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,214 INFO L290 TraceCheckUtils]: 92: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,214 INFO L272 TraceCheckUtils]: 91: Hoare triple {99532#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,214 INFO L290 TraceCheckUtils]: 90: Hoare triple {99532#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {99532#(< ~counter~0 47)} is VALID [2022-04-28 12:46:22,215 INFO L290 TraceCheckUtils]: 89: Hoare triple {99557#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99532#(< ~counter~0 47)} is VALID [2022-04-28 12:46:22,215 INFO L290 TraceCheckUtils]: 88: Hoare triple {99557#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99557#(< ~counter~0 46)} is VALID [2022-04-28 12:46:22,215 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99043#true} {99557#(< ~counter~0 46)} #96#return; {99557#(< ~counter~0 46)} is VALID [2022-04-28 12:46:22,215 INFO L290 TraceCheckUtils]: 86: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,216 INFO L290 TraceCheckUtils]: 85: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,216 INFO L290 TraceCheckUtils]: 84: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,216 INFO L272 TraceCheckUtils]: 83: Hoare triple {99557#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,216 INFO L290 TraceCheckUtils]: 82: Hoare triple {99557#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {99557#(< ~counter~0 46)} is VALID [2022-04-28 12:46:22,217 INFO L290 TraceCheckUtils]: 81: Hoare triple {99582#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99557#(< ~counter~0 46)} is VALID [2022-04-28 12:46:22,217 INFO L290 TraceCheckUtils]: 80: Hoare triple {99582#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99582#(< ~counter~0 45)} is VALID [2022-04-28 12:46:22,217 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99043#true} {99582#(< ~counter~0 45)} #96#return; {99582#(< ~counter~0 45)} is VALID [2022-04-28 12:46:22,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,217 INFO L290 TraceCheckUtils]: 77: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,217 INFO L272 TraceCheckUtils]: 75: Hoare triple {99582#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {99582#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {99582#(< ~counter~0 45)} is VALID [2022-04-28 12:46:22,218 INFO L290 TraceCheckUtils]: 73: Hoare triple {99607#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99582#(< ~counter~0 45)} is VALID [2022-04-28 12:46:22,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {99607#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99607#(< ~counter~0 44)} is VALID [2022-04-28 12:46:22,219 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99043#true} {99607#(< ~counter~0 44)} #96#return; {99607#(< ~counter~0 44)} is VALID [2022-04-28 12:46:22,219 INFO L290 TraceCheckUtils]: 70: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,219 INFO L290 TraceCheckUtils]: 69: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,219 INFO L290 TraceCheckUtils]: 68: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,219 INFO L272 TraceCheckUtils]: 67: Hoare triple {99607#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,219 INFO L290 TraceCheckUtils]: 66: Hoare triple {99607#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {99607#(< ~counter~0 44)} is VALID [2022-04-28 12:46:22,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {99632#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99607#(< ~counter~0 44)} is VALID [2022-04-28 12:46:22,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {99632#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99632#(< ~counter~0 43)} is VALID [2022-04-28 12:46:22,220 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99043#true} {99632#(< ~counter~0 43)} #96#return; {99632#(< ~counter~0 43)} is VALID [2022-04-28 12:46:22,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,220 INFO L290 TraceCheckUtils]: 60: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,220 INFO L272 TraceCheckUtils]: 59: Hoare triple {99632#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {99632#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {99632#(< ~counter~0 43)} is VALID [2022-04-28 12:46:22,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {99657#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99632#(< ~counter~0 43)} is VALID [2022-04-28 12:46:22,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {99657#(< ~counter~0 42)} assume !!(0 != ~r~0); {99657#(< ~counter~0 42)} is VALID [2022-04-28 12:46:22,222 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99043#true} {99657#(< ~counter~0 42)} #94#return; {99657#(< ~counter~0 42)} is VALID [2022-04-28 12:46:22,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,222 INFO L272 TraceCheckUtils]: 51: Hoare triple {99657#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {99657#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {99657#(< ~counter~0 42)} is VALID [2022-04-28 12:46:22,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {99682#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99657#(< ~counter~0 42)} is VALID [2022-04-28 12:46:22,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {99682#(< ~counter~0 41)} assume !(~r~0 < 0); {99682#(< ~counter~0 41)} is VALID [2022-04-28 12:46:22,223 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99043#true} {99682#(< ~counter~0 41)} #98#return; {99682#(< ~counter~0 41)} is VALID [2022-04-28 12:46:22,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,224 INFO L272 TraceCheckUtils]: 43: Hoare triple {99682#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {99682#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {99682#(< ~counter~0 41)} is VALID [2022-04-28 12:46:22,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {99707#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99682#(< ~counter~0 41)} is VALID [2022-04-28 12:46:22,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {99707#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99707#(< ~counter~0 40)} is VALID [2022-04-28 12:46:22,225 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99043#true} {99707#(< ~counter~0 40)} #98#return; {99707#(< ~counter~0 40)} is VALID [2022-04-28 12:46:22,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,225 INFO L272 TraceCheckUtils]: 35: Hoare triple {99707#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {99707#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {99707#(< ~counter~0 40)} is VALID [2022-04-28 12:46:22,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {99732#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99707#(< ~counter~0 40)} is VALID [2022-04-28 12:46:22,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {99732#(< ~counter~0 39)} assume !(~r~0 > 0); {99732#(< ~counter~0 39)} is VALID [2022-04-28 12:46:22,226 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99043#true} {99732#(< ~counter~0 39)} #96#return; {99732#(< ~counter~0 39)} is VALID [2022-04-28 12:46:22,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,227 INFO L272 TraceCheckUtils]: 27: Hoare triple {99732#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {99732#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {99732#(< ~counter~0 39)} is VALID [2022-04-28 12:46:22,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {99757#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99732#(< ~counter~0 39)} is VALID [2022-04-28 12:46:22,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {99757#(< ~counter~0 38)} assume !!(0 != ~r~0); {99757#(< ~counter~0 38)} is VALID [2022-04-28 12:46:22,228 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99043#true} {99757#(< ~counter~0 38)} #94#return; {99757#(< ~counter~0 38)} is VALID [2022-04-28 12:46:22,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,228 INFO L272 TraceCheckUtils]: 19: Hoare triple {99757#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {99757#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {99757#(< ~counter~0 38)} is VALID [2022-04-28 12:46:22,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {99782#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99757#(< ~counter~0 38)} is VALID [2022-04-28 12:46:22,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {99782#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {99782#(< ~counter~0 37)} is VALID [2022-04-28 12:46:22,230 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99043#true} {99782#(< ~counter~0 37)} #92#return; {99782#(< ~counter~0 37)} is VALID [2022-04-28 12:46:22,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,230 INFO L272 TraceCheckUtils]: 11: Hoare triple {99782#(< ~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)); {99043#true} is VALID [2022-04-28 12:46:22,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99043#true} {99782#(< ~counter~0 37)} #90#return; {99782#(< ~counter~0 37)} is VALID [2022-04-28 12:46:22,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {99043#true} assume true; {99043#true} is VALID [2022-04-28 12:46:22,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {99043#true} assume !(0 == ~cond); {99043#true} is VALID [2022-04-28 12:46:22,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {99043#true} ~cond := #in~cond; {99043#true} is VALID [2022-04-28 12:46:22,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {99782#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99043#true} is VALID [2022-04-28 12:46:22,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {99782#(< ~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; {99782#(< ~counter~0 37)} is VALID [2022-04-28 12:46:22,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {99782#(< ~counter~0 37)} call #t~ret9 := main(); {99782#(< ~counter~0 37)} is VALID [2022-04-28 12:46:22,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99782#(< ~counter~0 37)} {99043#true} #102#return; {99782#(< ~counter~0 37)} is VALID [2022-04-28 12:46:22,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {99782#(< ~counter~0 37)} assume true; {99782#(< ~counter~0 37)} is VALID [2022-04-28 12:46:22,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {99043#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {99782#(< ~counter~0 37)} is VALID [2022-04-28 12:46:22,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {99043#true} call ULTIMATE.init(); {99043#true} is VALID [2022-04-28 12:46:22,232 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-28 12:46:22,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:46:22,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743926545] [2022-04-28 12:46:22,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:46:22,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638336498] [2022-04-28 12:46:22,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638336498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:46:22,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:46:22,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 12:46:22,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:46:22,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393398256] [2022-04-28 12:46:22,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393398256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:46:22,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:46:22,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 12:46:22,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433982541] [2022-04-28 12:46:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:46:22,233 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-28 12:46:22,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:46:22,233 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-28 12:46:22,308 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-28 12:46:22,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 12:46:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:46:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 12:46:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 12:46:22,309 INFO L87 Difference]: Start difference. First operand 686 states and 906 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-28 12:46:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:24,682 INFO L93 Difference]: Finished difference Result 745 states and 986 transitions. [2022-04-28 12:46:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 12:46:24,682 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-28 12:46:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:46:24,682 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-28 12:46:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-28 12:46:24,684 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-28 12:46:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-28 12:46:24,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-28 12:46:24,865 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-28 12:46:24,890 INFO L225 Difference]: With dead ends: 745 [2022-04-28 12:46:24,890 INFO L226 Difference]: Without dead ends: 734 [2022-04-28 12:46:24,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=723, Invalid=999, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 12:46:24,891 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 243 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:46:24,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 295 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:46:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-04-28 12:46:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 712. [2022-04-28 12:46:26,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:46:26,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 734 states. Second operand has 712 states, 532 states have (on average 1.2030075187969924) internal successors, (640), 542 states have internal predecessors, (640), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:46:26,091 INFO L74 IsIncluded]: Start isIncluded. First operand 734 states. Second operand has 712 states, 532 states have (on average 1.2030075187969924) internal successors, (640), 542 states have internal predecessors, (640), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:46:26,091 INFO L87 Difference]: Start difference. First operand 734 states. Second operand has 712 states, 532 states have (on average 1.2030075187969924) internal successors, (640), 542 states have internal predecessors, (640), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:46:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:26,108 INFO L93 Difference]: Finished difference Result 734 states and 970 transitions. [2022-04-28 12:46:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 970 transitions. [2022-04-28 12:46:26,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:46:26,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:46:26,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 712 states, 532 states have (on average 1.2030075187969924) internal successors, (640), 542 states have internal predecessors, (640), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 734 states. [2022-04-28 12:46:26,110 INFO L87 Difference]: Start difference. First operand has 712 states, 532 states have (on average 1.2030075187969924) internal successors, (640), 542 states have internal predecessors, (640), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 734 states. [2022-04-28 12:46:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:26,126 INFO L93 Difference]: Finished difference Result 734 states and 970 transitions. [2022-04-28 12:46:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 970 transitions. [2022-04-28 12:46:26,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:46:26,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:46:26,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:46:26,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:46:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 532 states have (on average 1.2030075187969924) internal successors, (640), 542 states have internal predecessors, (640), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:46:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 944 transitions. [2022-04-28 12:46:26,149 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 944 transitions. Word has length 127 [2022-04-28 12:46:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:46:26,150 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 944 transitions. [2022-04-28 12:46:26,150 INFO L496 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-28 12:46:26,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 712 states and 944 transitions. [2022-04-28 12:46:43,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 944 edges. 941 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:46:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 944 transitions. [2022-04-28 12:46:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 12:46:43,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:46:43,744 INFO L195 NwaCegarLoop]: 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-28 12:46:43,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 12:46:43,944 WARN L477 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-28 12:46:43,944 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:46:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:46:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-28 12:46:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:46:43,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [138023531] [2022-04-28 12:46:43,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:46:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-28 12:46:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:46:43,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921032808] [2022-04-28 12:46:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:46:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:46:43,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:46:43,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231953015] [2022-04-28 12:46:43,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:46:43,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:46:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:46:43,958 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-28 12:46:43,965 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-28 12:46:44,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:46:44,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:46:44,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 12:46:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:46:44,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:46:44,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {104238#true} call ULTIMATE.init(); {104238#true} is VALID [2022-04-28 12:46:44,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {104238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {104246#(<= ~counter~0 0)} assume true; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104246#(<= ~counter~0 0)} {104238#true} #102#return; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {104246#(<= ~counter~0 0)} call #t~ret9 := main(); {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {104246#(<= ~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; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,583 INFO L272 TraceCheckUtils]: 6: Hoare triple {104246#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {104246#(<= ~counter~0 0)} ~cond := #in~cond; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {104246#(<= ~counter~0 0)} assume !(0 == ~cond); {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {104246#(<= ~counter~0 0)} assume true; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {104246#(<= ~counter~0 0)} {104246#(<= ~counter~0 0)} #90#return; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,583 INFO L272 TraceCheckUtils]: 11: Hoare triple {104246#(<= ~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)); {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {104246#(<= ~counter~0 0)} ~cond := #in~cond; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {104246#(<= ~counter~0 0)} assume !(0 == ~cond); {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {104246#(<= ~counter~0 0)} assume true; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {104246#(<= ~counter~0 0)} {104246#(<= ~counter~0 0)} #92#return; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {104246#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {104246#(<= ~counter~0 0)} is VALID [2022-04-28 12:46:44,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {104246#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104295#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:44,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {104295#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {104295#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:44,587 INFO L272 TraceCheckUtils]: 19: Hoare triple {104295#(<= ~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)); {104295#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:44,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {104295#(<= ~counter~0 1)} ~cond := #in~cond; {104295#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:44,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {104295#(<= ~counter~0 1)} assume !(0 == ~cond); {104295#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:44,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {104295#(<= ~counter~0 1)} assume true; {104295#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:44,587 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {104295#(<= ~counter~0 1)} {104295#(<= ~counter~0 1)} #94#return; {104295#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:44,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {104295#(<= ~counter~0 1)} assume !!(0 != ~r~0); {104295#(<= ~counter~0 1)} is VALID [2022-04-28 12:46:44,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {104295#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104320#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:44,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {104320#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {104320#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:44,589 INFO L272 TraceCheckUtils]: 27: Hoare triple {104320#(<= ~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)); {104320#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:44,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {104320#(<= ~counter~0 2)} ~cond := #in~cond; {104320#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:44,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {104320#(<= ~counter~0 2)} assume !(0 == ~cond); {104320#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:44,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {104320#(<= ~counter~0 2)} assume true; {104320#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:44,589 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {104320#(<= ~counter~0 2)} {104320#(<= ~counter~0 2)} #96#return; {104320#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:44,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {104320#(<= ~counter~0 2)} assume !(~r~0 > 0); {104320#(<= ~counter~0 2)} is VALID [2022-04-28 12:46:44,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {104320#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104345#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:44,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {104345#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {104345#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:44,591 INFO L272 TraceCheckUtils]: 35: Hoare triple {104345#(<= ~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)); {104345#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:44,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {104345#(<= ~counter~0 3)} ~cond := #in~cond; {104345#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:44,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {104345#(<= ~counter~0 3)} assume !(0 == ~cond); {104345#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:44,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {104345#(<= ~counter~0 3)} assume true; {104345#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:44,592 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {104345#(<= ~counter~0 3)} {104345#(<= ~counter~0 3)} #98#return; {104345#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:44,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {104345#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104345#(<= ~counter~0 3)} is VALID [2022-04-28 12:46:44,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {104345#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104370#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:44,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {104370#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {104370#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:44,593 INFO L272 TraceCheckUtils]: 43: Hoare triple {104370#(<= ~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)); {104370#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:44,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {104370#(<= ~counter~0 4)} ~cond := #in~cond; {104370#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:44,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {104370#(<= ~counter~0 4)} assume !(0 == ~cond); {104370#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:44,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {104370#(<= ~counter~0 4)} assume true; {104370#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:44,594 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {104370#(<= ~counter~0 4)} {104370#(<= ~counter~0 4)} #98#return; {104370#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:44,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {104370#(<= ~counter~0 4)} assume !(~r~0 < 0); {104370#(<= ~counter~0 4)} is VALID [2022-04-28 12:46:44,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {104370#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104395#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:44,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {104395#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {104395#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:44,595 INFO L272 TraceCheckUtils]: 51: Hoare triple {104395#(<= ~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)); {104395#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:44,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {104395#(<= ~counter~0 5)} ~cond := #in~cond; {104395#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:44,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {104395#(<= ~counter~0 5)} assume !(0 == ~cond); {104395#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:44,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {104395#(<= ~counter~0 5)} assume true; {104395#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:44,596 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {104395#(<= ~counter~0 5)} {104395#(<= ~counter~0 5)} #94#return; {104395#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:44,596 INFO L290 TraceCheckUtils]: 56: Hoare triple {104395#(<= ~counter~0 5)} assume !!(0 != ~r~0); {104395#(<= ~counter~0 5)} is VALID [2022-04-28 12:46:44,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {104395#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104420#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:44,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {104420#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {104420#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:44,597 INFO L272 TraceCheckUtils]: 59: Hoare triple {104420#(<= ~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)); {104420#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:44,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {104420#(<= ~counter~0 6)} ~cond := #in~cond; {104420#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:44,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {104420#(<= ~counter~0 6)} assume !(0 == ~cond); {104420#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:44,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {104420#(<= ~counter~0 6)} assume true; {104420#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:44,598 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {104420#(<= ~counter~0 6)} {104420#(<= ~counter~0 6)} #96#return; {104420#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:44,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {104420#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104420#(<= ~counter~0 6)} is VALID [2022-04-28 12:46:44,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {104420#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104445#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:44,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {104445#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {104445#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:44,599 INFO L272 TraceCheckUtils]: 67: Hoare triple {104445#(<= ~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)); {104445#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:44,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {104445#(<= ~counter~0 7)} ~cond := #in~cond; {104445#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:44,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {104445#(<= ~counter~0 7)} assume !(0 == ~cond); {104445#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:44,600 INFO L290 TraceCheckUtils]: 70: Hoare triple {104445#(<= ~counter~0 7)} assume true; {104445#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:44,614 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {104445#(<= ~counter~0 7)} {104445#(<= ~counter~0 7)} #96#return; {104445#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:44,615 INFO L290 TraceCheckUtils]: 72: Hoare triple {104445#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104445#(<= ~counter~0 7)} is VALID [2022-04-28 12:46:44,615 INFO L290 TraceCheckUtils]: 73: Hoare triple {104445#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104470#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:44,616 INFO L290 TraceCheckUtils]: 74: Hoare triple {104470#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {104470#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:44,616 INFO L272 TraceCheckUtils]: 75: Hoare triple {104470#(<= ~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)); {104470#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:44,616 INFO L290 TraceCheckUtils]: 76: Hoare triple {104470#(<= ~counter~0 8)} ~cond := #in~cond; {104470#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:44,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {104470#(<= ~counter~0 8)} assume !(0 == ~cond); {104470#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:44,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {104470#(<= ~counter~0 8)} assume true; {104470#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:44,617 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {104470#(<= ~counter~0 8)} {104470#(<= ~counter~0 8)} #96#return; {104470#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:44,617 INFO L290 TraceCheckUtils]: 80: Hoare triple {104470#(<= ~counter~0 8)} assume !(~r~0 > 0); {104470#(<= ~counter~0 8)} is VALID [2022-04-28 12:46:44,618 INFO L290 TraceCheckUtils]: 81: Hoare triple {104470#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104495#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:44,618 INFO L290 TraceCheckUtils]: 82: Hoare triple {104495#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {104495#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:44,618 INFO L272 TraceCheckUtils]: 83: Hoare triple {104495#(<= ~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)); {104495#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:44,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {104495#(<= ~counter~0 9)} ~cond := #in~cond; {104495#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:44,618 INFO L290 TraceCheckUtils]: 85: Hoare triple {104495#(<= ~counter~0 9)} assume !(0 == ~cond); {104495#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:44,618 INFO L290 TraceCheckUtils]: 86: Hoare triple {104495#(<= ~counter~0 9)} assume true; {104495#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:44,619 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {104495#(<= ~counter~0 9)} {104495#(<= ~counter~0 9)} #98#return; {104495#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:44,619 INFO L290 TraceCheckUtils]: 88: Hoare triple {104495#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104495#(<= ~counter~0 9)} is VALID [2022-04-28 12:46:44,620 INFO L290 TraceCheckUtils]: 89: Hoare triple {104495#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104520#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:44,620 INFO L290 TraceCheckUtils]: 90: Hoare triple {104520#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {104520#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:44,620 INFO L272 TraceCheckUtils]: 91: Hoare triple {104520#(<= ~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)); {104520#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:44,620 INFO L290 TraceCheckUtils]: 92: Hoare triple {104520#(<= ~counter~0 10)} ~cond := #in~cond; {104520#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:44,620 INFO L290 TraceCheckUtils]: 93: Hoare triple {104520#(<= ~counter~0 10)} assume !(0 == ~cond); {104520#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:44,621 INFO L290 TraceCheckUtils]: 94: Hoare triple {104520#(<= ~counter~0 10)} assume true; {104520#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:44,621 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {104520#(<= ~counter~0 10)} {104520#(<= ~counter~0 10)} #98#return; {104520#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:44,621 INFO L290 TraceCheckUtils]: 96: Hoare triple {104520#(<= ~counter~0 10)} assume !(~r~0 < 0); {104520#(<= ~counter~0 10)} is VALID [2022-04-28 12:46:44,622 INFO L290 TraceCheckUtils]: 97: Hoare triple {104520#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104545#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:44,622 INFO L290 TraceCheckUtils]: 98: Hoare triple {104545#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {104545#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:44,622 INFO L272 TraceCheckUtils]: 99: Hoare triple {104545#(<= ~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)); {104545#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:44,622 INFO L290 TraceCheckUtils]: 100: Hoare triple {104545#(<= ~counter~0 11)} ~cond := #in~cond; {104545#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:44,623 INFO L290 TraceCheckUtils]: 101: Hoare triple {104545#(<= ~counter~0 11)} assume !(0 == ~cond); {104545#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:44,623 INFO L290 TraceCheckUtils]: 102: Hoare triple {104545#(<= ~counter~0 11)} assume true; {104545#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:44,623 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {104545#(<= ~counter~0 11)} {104545#(<= ~counter~0 11)} #94#return; {104545#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:44,623 INFO L290 TraceCheckUtils]: 104: Hoare triple {104545#(<= ~counter~0 11)} assume !!(0 != ~r~0); {104545#(<= ~counter~0 11)} is VALID [2022-04-28 12:46:44,624 INFO L290 TraceCheckUtils]: 105: Hoare triple {104545#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104570#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:44,624 INFO L290 TraceCheckUtils]: 106: Hoare triple {104570#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {104570#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:44,624 INFO L272 TraceCheckUtils]: 107: Hoare triple {104570#(<= ~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)); {104570#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:44,624 INFO L290 TraceCheckUtils]: 108: Hoare triple {104570#(<= ~counter~0 12)} ~cond := #in~cond; {104570#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:44,625 INFO L290 TraceCheckUtils]: 109: Hoare triple {104570#(<= ~counter~0 12)} assume !(0 == ~cond); {104570#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:44,625 INFO L290 TraceCheckUtils]: 110: Hoare triple {104570#(<= ~counter~0 12)} assume true; {104570#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:44,625 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {104570#(<= ~counter~0 12)} {104570#(<= ~counter~0 12)} #96#return; {104570#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:44,625 INFO L290 TraceCheckUtils]: 112: Hoare triple {104570#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104570#(<= ~counter~0 12)} is VALID [2022-04-28 12:46:44,626 INFO L290 TraceCheckUtils]: 113: Hoare triple {104570#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104595#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:44,626 INFO L290 TraceCheckUtils]: 114: Hoare triple {104595#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {104595#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:44,626 INFO L272 TraceCheckUtils]: 115: Hoare triple {104595#(<= ~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)); {104595#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:44,627 INFO L290 TraceCheckUtils]: 116: Hoare triple {104595#(<= ~counter~0 13)} ~cond := #in~cond; {104595#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:44,627 INFO L290 TraceCheckUtils]: 117: Hoare triple {104595#(<= ~counter~0 13)} assume !(0 == ~cond); {104595#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:44,627 INFO L290 TraceCheckUtils]: 118: Hoare triple {104595#(<= ~counter~0 13)} assume true; {104595#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:44,627 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {104595#(<= ~counter~0 13)} {104595#(<= ~counter~0 13)} #96#return; {104595#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:44,627 INFO L290 TraceCheckUtils]: 120: Hoare triple {104595#(<= ~counter~0 13)} assume !(~r~0 > 0); {104595#(<= ~counter~0 13)} is VALID [2022-04-28 12:46:44,627 INFO L290 TraceCheckUtils]: 121: Hoare triple {104595#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104620#(<= |main_#t~post8| 13)} is VALID [2022-04-28 12:46:44,628 INFO L290 TraceCheckUtils]: 122: Hoare triple {104620#(<= |main_#t~post8| 13)} assume !(#t~post8 < 50);havoc #t~post8; {104239#false} is VALID [2022-04-28 12:46:44,628 INFO L290 TraceCheckUtils]: 123: Hoare triple {104239#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104239#false} is VALID [2022-04-28 12:46:44,628 INFO L290 TraceCheckUtils]: 124: Hoare triple {104239#false} assume !(#t~post6 < 50);havoc #t~post6; {104239#false} is VALID [2022-04-28 12:46:44,628 INFO L272 TraceCheckUtils]: 125: Hoare triple {104239#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104239#false} is VALID [2022-04-28 12:46:44,628 INFO L290 TraceCheckUtils]: 126: Hoare triple {104239#false} ~cond := #in~cond; {104239#false} is VALID [2022-04-28 12:46:44,628 INFO L290 TraceCheckUtils]: 127: Hoare triple {104239#false} assume 0 == ~cond; {104239#false} is VALID [2022-04-28 12:46:44,628 INFO L290 TraceCheckUtils]: 128: Hoare triple {104239#false} assume !false; {104239#false} is VALID [2022-04-28 12:46:44,628 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-28 12:46:44,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:46:45,076 INFO L290 TraceCheckUtils]: 128: Hoare triple {104239#false} assume !false; {104239#false} is VALID [2022-04-28 12:46:45,076 INFO L290 TraceCheckUtils]: 127: Hoare triple {104239#false} assume 0 == ~cond; {104239#false} is VALID [2022-04-28 12:46:45,076 INFO L290 TraceCheckUtils]: 126: Hoare triple {104239#false} ~cond := #in~cond; {104239#false} is VALID [2022-04-28 12:46:45,076 INFO L272 TraceCheckUtils]: 125: Hoare triple {104239#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {104239#false} is VALID [2022-04-28 12:46:45,077 INFO L290 TraceCheckUtils]: 124: Hoare triple {104239#false} assume !(#t~post6 < 50);havoc #t~post6; {104239#false} is VALID [2022-04-28 12:46:45,077 INFO L290 TraceCheckUtils]: 123: Hoare triple {104239#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104239#false} is VALID [2022-04-28 12:46:45,077 INFO L290 TraceCheckUtils]: 122: Hoare triple {104660#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {104239#false} is VALID [2022-04-28 12:46:45,077 INFO L290 TraceCheckUtils]: 121: Hoare triple {104664#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104660#(< |main_#t~post8| 50)} is VALID [2022-04-28 12:46:45,077 INFO L290 TraceCheckUtils]: 120: Hoare triple {104664#(< ~counter~0 50)} assume !(~r~0 > 0); {104664#(< ~counter~0 50)} is VALID [2022-04-28 12:46:45,077 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {104238#true} {104664#(< ~counter~0 50)} #96#return; {104664#(< ~counter~0 50)} is VALID [2022-04-28 12:46:45,078 INFO L290 TraceCheckUtils]: 118: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,078 INFO L290 TraceCheckUtils]: 117: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,078 INFO L290 TraceCheckUtils]: 116: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,078 INFO L272 TraceCheckUtils]: 115: Hoare triple {104664#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,078 INFO L290 TraceCheckUtils]: 114: Hoare triple {104664#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {104664#(< ~counter~0 50)} is VALID [2022-04-28 12:46:45,080 INFO L290 TraceCheckUtils]: 113: Hoare triple {104689#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104664#(< ~counter~0 50)} is VALID [2022-04-28 12:46:45,080 INFO L290 TraceCheckUtils]: 112: Hoare triple {104689#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104689#(< ~counter~0 49)} is VALID [2022-04-28 12:46:45,080 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {104238#true} {104689#(< ~counter~0 49)} #96#return; {104689#(< ~counter~0 49)} is VALID [2022-04-28 12:46:45,080 INFO L290 TraceCheckUtils]: 110: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,080 INFO L290 TraceCheckUtils]: 109: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,080 INFO L290 TraceCheckUtils]: 108: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,080 INFO L272 TraceCheckUtils]: 107: Hoare triple {104689#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,081 INFO L290 TraceCheckUtils]: 106: Hoare triple {104689#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {104689#(< ~counter~0 49)} is VALID [2022-04-28 12:46:45,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {104714#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104689#(< ~counter~0 49)} is VALID [2022-04-28 12:46:45,081 INFO L290 TraceCheckUtils]: 104: Hoare triple {104714#(< ~counter~0 48)} assume !!(0 != ~r~0); {104714#(< ~counter~0 48)} is VALID [2022-04-28 12:46:45,082 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {104238#true} {104714#(< ~counter~0 48)} #94#return; {104714#(< ~counter~0 48)} is VALID [2022-04-28 12:46:45,082 INFO L290 TraceCheckUtils]: 102: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,082 INFO L290 TraceCheckUtils]: 101: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,082 INFO L290 TraceCheckUtils]: 100: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,082 INFO L272 TraceCheckUtils]: 99: Hoare triple {104714#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,082 INFO L290 TraceCheckUtils]: 98: Hoare triple {104714#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {104714#(< ~counter~0 48)} is VALID [2022-04-28 12:46:45,083 INFO L290 TraceCheckUtils]: 97: Hoare triple {104739#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104714#(< ~counter~0 48)} is VALID [2022-04-28 12:46:45,083 INFO L290 TraceCheckUtils]: 96: Hoare triple {104739#(< ~counter~0 47)} assume !(~r~0 < 0); {104739#(< ~counter~0 47)} is VALID [2022-04-28 12:46:45,083 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {104238#true} {104739#(< ~counter~0 47)} #98#return; {104739#(< ~counter~0 47)} is VALID [2022-04-28 12:46:45,083 INFO L290 TraceCheckUtils]: 94: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,084 INFO L272 TraceCheckUtils]: 91: Hoare triple {104739#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {104739#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {104739#(< ~counter~0 47)} is VALID [2022-04-28 12:46:45,088 INFO L290 TraceCheckUtils]: 89: Hoare triple {104764#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104739#(< ~counter~0 47)} is VALID [2022-04-28 12:46:45,088 INFO L290 TraceCheckUtils]: 88: Hoare triple {104764#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104764#(< ~counter~0 46)} is VALID [2022-04-28 12:46:45,088 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {104238#true} {104764#(< ~counter~0 46)} #98#return; {104764#(< ~counter~0 46)} is VALID [2022-04-28 12:46:45,089 INFO L290 TraceCheckUtils]: 86: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,089 INFO L290 TraceCheckUtils]: 85: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,089 INFO L290 TraceCheckUtils]: 84: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,089 INFO L272 TraceCheckUtils]: 83: Hoare triple {104764#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,089 INFO L290 TraceCheckUtils]: 82: Hoare triple {104764#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {104764#(< ~counter~0 46)} is VALID [2022-04-28 12:46:45,090 INFO L290 TraceCheckUtils]: 81: Hoare triple {104789#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104764#(< ~counter~0 46)} is VALID [2022-04-28 12:46:45,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {104789#(< ~counter~0 45)} assume !(~r~0 > 0); {104789#(< ~counter~0 45)} is VALID [2022-04-28 12:46:45,090 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {104238#true} {104789#(< ~counter~0 45)} #96#return; {104789#(< ~counter~0 45)} is VALID [2022-04-28 12:46:45,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,090 INFO L272 TraceCheckUtils]: 75: Hoare triple {104789#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {104789#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {104789#(< ~counter~0 45)} is VALID [2022-04-28 12:46:45,091 INFO L290 TraceCheckUtils]: 73: Hoare triple {104814#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104789#(< ~counter~0 45)} is VALID [2022-04-28 12:46:45,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {104814#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104814#(< ~counter~0 44)} is VALID [2022-04-28 12:46:45,092 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {104238#true} {104814#(< ~counter~0 44)} #96#return; {104814#(< ~counter~0 44)} is VALID [2022-04-28 12:46:45,092 INFO L290 TraceCheckUtils]: 70: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,092 INFO L290 TraceCheckUtils]: 69: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,092 INFO L272 TraceCheckUtils]: 67: Hoare triple {104814#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {104814#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {104814#(< ~counter~0 44)} is VALID [2022-04-28 12:46:45,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {104839#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104814#(< ~counter~0 44)} is VALID [2022-04-28 12:46:45,093 INFO L290 TraceCheckUtils]: 64: Hoare triple {104839#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104839#(< ~counter~0 43)} is VALID [2022-04-28 12:46:45,094 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {104238#true} {104839#(< ~counter~0 43)} #96#return; {104839#(< ~counter~0 43)} is VALID [2022-04-28 12:46:45,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,094 INFO L272 TraceCheckUtils]: 59: Hoare triple {104839#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {104839#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {104839#(< ~counter~0 43)} is VALID [2022-04-28 12:46:45,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {104864#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104839#(< ~counter~0 43)} is VALID [2022-04-28 12:46:45,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {104864#(< ~counter~0 42)} assume !!(0 != ~r~0); {104864#(< ~counter~0 42)} is VALID [2022-04-28 12:46:45,095 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {104238#true} {104864#(< ~counter~0 42)} #94#return; {104864#(< ~counter~0 42)} is VALID [2022-04-28 12:46:45,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,095 INFO L272 TraceCheckUtils]: 51: Hoare triple {104864#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,096 INFO L290 TraceCheckUtils]: 50: Hoare triple {104864#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {104864#(< ~counter~0 42)} is VALID [2022-04-28 12:46:45,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {104889#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104864#(< ~counter~0 42)} is VALID [2022-04-28 12:46:45,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {104889#(< ~counter~0 41)} assume !(~r~0 < 0); {104889#(< ~counter~0 41)} is VALID [2022-04-28 12:46:45,097 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {104238#true} {104889#(< ~counter~0 41)} #98#return; {104889#(< ~counter~0 41)} is VALID [2022-04-28 12:46:45,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,097 INFO L272 TraceCheckUtils]: 43: Hoare triple {104889#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {104889#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {104889#(< ~counter~0 41)} is VALID [2022-04-28 12:46:45,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {104914#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104889#(< ~counter~0 41)} is VALID [2022-04-28 12:46:45,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {104914#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104914#(< ~counter~0 40)} is VALID [2022-04-28 12:46:45,099 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {104238#true} {104914#(< ~counter~0 40)} #98#return; {104914#(< ~counter~0 40)} is VALID [2022-04-28 12:46:45,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,099 INFO L272 TraceCheckUtils]: 35: Hoare triple {104914#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {104914#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {104914#(< ~counter~0 40)} is VALID [2022-04-28 12:46:45,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {104939#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104914#(< ~counter~0 40)} is VALID [2022-04-28 12:46:45,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {104939#(< ~counter~0 39)} assume !(~r~0 > 0); {104939#(< ~counter~0 39)} is VALID [2022-04-28 12:46:45,100 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {104238#true} {104939#(< ~counter~0 39)} #96#return; {104939#(< ~counter~0 39)} is VALID [2022-04-28 12:46:45,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,100 INFO L272 TraceCheckUtils]: 27: Hoare triple {104939#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {104939#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {104939#(< ~counter~0 39)} is VALID [2022-04-28 12:46:45,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {104964#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104939#(< ~counter~0 39)} is VALID [2022-04-28 12:46:45,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {104964#(< ~counter~0 38)} assume !!(0 != ~r~0); {104964#(< ~counter~0 38)} is VALID [2022-04-28 12:46:45,102 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {104238#true} {104964#(< ~counter~0 38)} #94#return; {104964#(< ~counter~0 38)} is VALID [2022-04-28 12:46:45,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,102 INFO L272 TraceCheckUtils]: 19: Hoare triple {104964#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {104964#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {104964#(< ~counter~0 38)} is VALID [2022-04-28 12:46:45,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {104989#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104964#(< ~counter~0 38)} is VALID [2022-04-28 12:46:45,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {104989#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {104989#(< ~counter~0 37)} is VALID [2022-04-28 12:46:45,103 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {104238#true} {104989#(< ~counter~0 37)} #92#return; {104989#(< ~counter~0 37)} is VALID [2022-04-28 12:46:45,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,104 INFO L272 TraceCheckUtils]: 11: Hoare triple {104989#(< ~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)); {104238#true} is VALID [2022-04-28 12:46:45,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {104238#true} {104989#(< ~counter~0 37)} #90#return; {104989#(< ~counter~0 37)} is VALID [2022-04-28 12:46:45,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {104238#true} assume true; {104238#true} is VALID [2022-04-28 12:46:45,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {104238#true} assume !(0 == ~cond); {104238#true} is VALID [2022-04-28 12:46:45,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {104238#true} ~cond := #in~cond; {104238#true} is VALID [2022-04-28 12:46:45,104 INFO L272 TraceCheckUtils]: 6: Hoare triple {104989#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {104238#true} is VALID [2022-04-28 12:46:45,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {104989#(< ~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; {104989#(< ~counter~0 37)} is VALID [2022-04-28 12:46:45,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {104989#(< ~counter~0 37)} call #t~ret9 := main(); {104989#(< ~counter~0 37)} is VALID [2022-04-28 12:46:45,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104989#(< ~counter~0 37)} {104238#true} #102#return; {104989#(< ~counter~0 37)} is VALID [2022-04-28 12:46:45,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {104989#(< ~counter~0 37)} assume true; {104989#(< ~counter~0 37)} is VALID [2022-04-28 12:46:45,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {104238#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {104989#(< ~counter~0 37)} is VALID [2022-04-28 12:46:45,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {104238#true} call ULTIMATE.init(); {104238#true} is VALID [2022-04-28 12:46:45,106 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-28 12:46:45,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:46:45,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921032808] [2022-04-28 12:46:45,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:46:45,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231953015] [2022-04-28 12:46:45,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231953015] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:46:45,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:46:45,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 12:46:45,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:46:45,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [138023531] [2022-04-28 12:46:45,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [138023531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:46:45,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:46:45,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 12:46:45,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729538894] [2022-04-28 12:46:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:46:45,107 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-28 12:46:45,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:46:45,107 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-28 12:46:45,183 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-28 12:46:45,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 12:46:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:46:45,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 12:46:45,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 12:46:45,184 INFO L87 Difference]: Start difference. First operand 712 states and 944 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-28 12:46:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:47,756 INFO L93 Difference]: Finished difference Result 937 states and 1280 transitions. [2022-04-28 12:46:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 12:46:47,756 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-28 12:46:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:46:47,757 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-28 12:46:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-28 12:46:47,759 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-28 12:46:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-28 12:46:47,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-28 12:46:47,974 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-28 12:46:47,994 INFO L225 Difference]: With dead ends: 937 [2022-04-28 12:46:47,994 INFO L226 Difference]: Without dead ends: 740 [2022-04-28 12:46:47,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=759, Invalid=1047, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 12:46:47,995 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 209 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:46:47,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 304 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:46:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-04-28 12:46:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 730. [2022-04-28 12:46:49,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:46:49,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 740 states. Second operand has 730 states, 550 states have (on average 1.2036363636363636) internal successors, (662), 554 states have internal predecessors, (662), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:46:49,229 INFO L74 IsIncluded]: Start isIncluded. First operand 740 states. Second operand has 730 states, 550 states have (on average 1.2036363636363636) internal successors, (662), 554 states have internal predecessors, (662), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:46:49,229 INFO L87 Difference]: Start difference. First operand 740 states. Second operand has 730 states, 550 states have (on average 1.2036363636363636) internal successors, (662), 554 states have internal predecessors, (662), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:46:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:49,259 INFO L93 Difference]: Finished difference Result 740 states and 976 transitions. [2022-04-28 12:46:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 976 transitions. [2022-04-28 12:46:49,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:46:49,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:46:49,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 730 states, 550 states have (on average 1.2036363636363636) internal successors, (662), 554 states have internal predecessors, (662), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 740 states. [2022-04-28 12:46:49,261 INFO L87 Difference]: Start difference. First operand has 730 states, 550 states have (on average 1.2036363636363636) internal successors, (662), 554 states have internal predecessors, (662), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 740 states. [2022-04-28 12:46:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:46:49,278 INFO L93 Difference]: Finished difference Result 740 states and 976 transitions. [2022-04-28 12:46:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 976 transitions. [2022-04-28 12:46:49,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:46:49,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:46:49,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:46:49,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:46:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 550 states have (on average 1.2036363636363636) internal successors, (662), 554 states have internal predecessors, (662), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:46:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 966 transitions. [2022-04-28 12:46:49,301 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 966 transitions. Word has length 129 [2022-04-28 12:46:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:46:49,301 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 966 transitions. [2022-04-28 12:46:49,302 INFO L496 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-28 12:46:49,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 730 states and 966 transitions. [2022-04-28 12:47:06,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 963 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 966 transitions. [2022-04-28 12:47:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 12:47:06,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:06,864 INFO L195 NwaCegarLoop]: 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-28 12:47:06,881 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-28 12:47:07,064 WARN L477 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-28 12:47:07,065 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:07,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-28 12:47:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:07,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [230765312] [2022-04-28 12:47:07,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-28 12:47:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:07,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157080156] [2022-04-28 12:47:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:07,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:07,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027434113] [2022-04-28 12:47:07,083 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:47:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:07,084 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-28 12:47:07,085 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-28 12:47:07,263 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 12:47:07,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:07,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 12:47:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:07,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:07,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {109879#true} call ULTIMATE.init(); {109879#true} is VALID [2022-04-28 12:47:07,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {109879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {109887#(<= ~counter~0 0)} assume true; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109887#(<= ~counter~0 0)} {109879#true} #102#return; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {109887#(<= ~counter~0 0)} call #t~ret9 := main(); {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {109887#(<= ~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; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {109887#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {109887#(<= ~counter~0 0)} ~cond := #in~cond; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {109887#(<= ~counter~0 0)} assume !(0 == ~cond); {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {109887#(<= ~counter~0 0)} assume true; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109887#(<= ~counter~0 0)} {109887#(<= ~counter~0 0)} #90#return; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,943 INFO L272 TraceCheckUtils]: 11: Hoare triple {109887#(<= ~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)); {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {109887#(<= ~counter~0 0)} ~cond := #in~cond; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {109887#(<= ~counter~0 0)} assume !(0 == ~cond); {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {109887#(<= ~counter~0 0)} assume true; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,944 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109887#(<= ~counter~0 0)} {109887#(<= ~counter~0 0)} #92#return; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {109887#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {109887#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:07,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {109887#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109936#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:07,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {109936#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {109936#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:07,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {109936#(<= ~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)); {109936#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:07,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {109936#(<= ~counter~0 1)} ~cond := #in~cond; {109936#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:07,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {109936#(<= ~counter~0 1)} assume !(0 == ~cond); {109936#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:07,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {109936#(<= ~counter~0 1)} assume true; {109936#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:07,949 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109936#(<= ~counter~0 1)} {109936#(<= ~counter~0 1)} #94#return; {109936#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:07,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {109936#(<= ~counter~0 1)} assume !!(0 != ~r~0); {109936#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:07,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {109936#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109961#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:07,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {109961#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {109961#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:07,951 INFO L272 TraceCheckUtils]: 27: Hoare triple {109961#(<= ~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)); {109961#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:07,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {109961#(<= ~counter~0 2)} ~cond := #in~cond; {109961#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:07,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {109961#(<= ~counter~0 2)} assume !(0 == ~cond); {109961#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:07,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {109961#(<= ~counter~0 2)} assume true; {109961#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:07,952 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109961#(<= ~counter~0 2)} {109961#(<= ~counter~0 2)} #96#return; {109961#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:07,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {109961#(<= ~counter~0 2)} assume !(~r~0 > 0); {109961#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:07,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {109961#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109986#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:07,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {109986#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {109986#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:07,955 INFO L272 TraceCheckUtils]: 35: Hoare triple {109986#(<= ~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)); {109986#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:07,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {109986#(<= ~counter~0 3)} ~cond := #in~cond; {109986#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:07,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {109986#(<= ~counter~0 3)} assume !(0 == ~cond); {109986#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:07,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {109986#(<= ~counter~0 3)} assume true; {109986#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:07,956 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109986#(<= ~counter~0 3)} {109986#(<= ~counter~0 3)} #98#return; {109986#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:07,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {109986#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {109986#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:07,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {109986#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110011#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:07,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {110011#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {110011#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:07,959 INFO L272 TraceCheckUtils]: 43: Hoare triple {110011#(<= ~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)); {110011#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:07,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {110011#(<= ~counter~0 4)} ~cond := #in~cond; {110011#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:07,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {110011#(<= ~counter~0 4)} assume !(0 == ~cond); {110011#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:07,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {110011#(<= ~counter~0 4)} assume true; {110011#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:07,960 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {110011#(<= ~counter~0 4)} {110011#(<= ~counter~0 4)} #98#return; {110011#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:07,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {110011#(<= ~counter~0 4)} assume !(~r~0 < 0); {110011#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:07,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {110011#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110036#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:07,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {110036#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {110036#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:07,979 INFO L272 TraceCheckUtils]: 51: Hoare triple {110036#(<= ~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)); {110036#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:07,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {110036#(<= ~counter~0 5)} ~cond := #in~cond; {110036#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:07,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {110036#(<= ~counter~0 5)} assume !(0 == ~cond); {110036#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:07,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {110036#(<= ~counter~0 5)} assume true; {110036#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:07,980 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {110036#(<= ~counter~0 5)} {110036#(<= ~counter~0 5)} #94#return; {110036#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:07,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {110036#(<= ~counter~0 5)} assume !!(0 != ~r~0); {110036#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:07,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {110036#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110061#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:07,982 INFO L290 TraceCheckUtils]: 58: Hoare triple {110061#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {110061#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:07,982 INFO L272 TraceCheckUtils]: 59: Hoare triple {110061#(<= ~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)); {110061#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:07,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {110061#(<= ~counter~0 6)} ~cond := #in~cond; {110061#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:07,983 INFO L290 TraceCheckUtils]: 61: Hoare triple {110061#(<= ~counter~0 6)} assume !(0 == ~cond); {110061#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:07,983 INFO L290 TraceCheckUtils]: 62: Hoare triple {110061#(<= ~counter~0 6)} assume true; {110061#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:07,983 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {110061#(<= ~counter~0 6)} {110061#(<= ~counter~0 6)} #96#return; {110061#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:07,984 INFO L290 TraceCheckUtils]: 64: Hoare triple {110061#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110061#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:07,985 INFO L290 TraceCheckUtils]: 65: Hoare triple {110061#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110086#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:07,985 INFO L290 TraceCheckUtils]: 66: Hoare triple {110086#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {110086#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:07,986 INFO L272 TraceCheckUtils]: 67: Hoare triple {110086#(<= ~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)); {110086#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:07,986 INFO L290 TraceCheckUtils]: 68: Hoare triple {110086#(<= ~counter~0 7)} ~cond := #in~cond; {110086#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:07,999 INFO L290 TraceCheckUtils]: 69: Hoare triple {110086#(<= ~counter~0 7)} assume !(0 == ~cond); {110086#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:07,999 INFO L290 TraceCheckUtils]: 70: Hoare triple {110086#(<= ~counter~0 7)} assume true; {110086#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:08,000 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {110086#(<= ~counter~0 7)} {110086#(<= ~counter~0 7)} #96#return; {110086#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:08,000 INFO L290 TraceCheckUtils]: 72: Hoare triple {110086#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110086#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:08,002 INFO L290 TraceCheckUtils]: 73: Hoare triple {110086#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110111#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:08,003 INFO L290 TraceCheckUtils]: 74: Hoare triple {110111#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {110111#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:08,003 INFO L272 TraceCheckUtils]: 75: Hoare triple {110111#(<= ~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)); {110111#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:08,003 INFO L290 TraceCheckUtils]: 76: Hoare triple {110111#(<= ~counter~0 8)} ~cond := #in~cond; {110111#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:08,004 INFO L290 TraceCheckUtils]: 77: Hoare triple {110111#(<= ~counter~0 8)} assume !(0 == ~cond); {110111#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:08,004 INFO L290 TraceCheckUtils]: 78: Hoare triple {110111#(<= ~counter~0 8)} assume true; {110111#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:08,004 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {110111#(<= ~counter~0 8)} {110111#(<= ~counter~0 8)} #96#return; {110111#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:08,005 INFO L290 TraceCheckUtils]: 80: Hoare triple {110111#(<= ~counter~0 8)} assume !(~r~0 > 0); {110111#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:08,006 INFO L290 TraceCheckUtils]: 81: Hoare triple {110111#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110136#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:08,006 INFO L290 TraceCheckUtils]: 82: Hoare triple {110136#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {110136#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:08,006 INFO L272 TraceCheckUtils]: 83: Hoare triple {110136#(<= ~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)); {110136#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:08,006 INFO L290 TraceCheckUtils]: 84: Hoare triple {110136#(<= ~counter~0 9)} ~cond := #in~cond; {110136#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:08,007 INFO L290 TraceCheckUtils]: 85: Hoare triple {110136#(<= ~counter~0 9)} assume !(0 == ~cond); {110136#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:08,007 INFO L290 TraceCheckUtils]: 86: Hoare triple {110136#(<= ~counter~0 9)} assume true; {110136#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:08,007 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {110136#(<= ~counter~0 9)} {110136#(<= ~counter~0 9)} #98#return; {110136#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:08,008 INFO L290 TraceCheckUtils]: 88: Hoare triple {110136#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110136#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:08,009 INFO L290 TraceCheckUtils]: 89: Hoare triple {110136#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110161#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:08,009 INFO L290 TraceCheckUtils]: 90: Hoare triple {110161#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {110161#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:08,009 INFO L272 TraceCheckUtils]: 91: Hoare triple {110161#(<= ~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)); {110161#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:08,009 INFO L290 TraceCheckUtils]: 92: Hoare triple {110161#(<= ~counter~0 10)} ~cond := #in~cond; {110161#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:08,010 INFO L290 TraceCheckUtils]: 93: Hoare triple {110161#(<= ~counter~0 10)} assume !(0 == ~cond); {110161#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:08,010 INFO L290 TraceCheckUtils]: 94: Hoare triple {110161#(<= ~counter~0 10)} assume true; {110161#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:08,010 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {110161#(<= ~counter~0 10)} {110161#(<= ~counter~0 10)} #98#return; {110161#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:08,011 INFO L290 TraceCheckUtils]: 96: Hoare triple {110161#(<= ~counter~0 10)} assume !(~r~0 < 0); {110161#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:08,012 INFO L290 TraceCheckUtils]: 97: Hoare triple {110161#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110186#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:08,012 INFO L290 TraceCheckUtils]: 98: Hoare triple {110186#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {110186#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:08,013 INFO L272 TraceCheckUtils]: 99: Hoare triple {110186#(<= ~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)); {110186#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:08,014 INFO L290 TraceCheckUtils]: 100: Hoare triple {110186#(<= ~counter~0 11)} ~cond := #in~cond; {110186#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:08,014 INFO L290 TraceCheckUtils]: 101: Hoare triple {110186#(<= ~counter~0 11)} assume !(0 == ~cond); {110186#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:08,014 INFO L290 TraceCheckUtils]: 102: Hoare triple {110186#(<= ~counter~0 11)} assume true; {110186#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:08,014 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {110186#(<= ~counter~0 11)} {110186#(<= ~counter~0 11)} #94#return; {110186#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:08,015 INFO L290 TraceCheckUtils]: 104: Hoare triple {110186#(<= ~counter~0 11)} assume !!(0 != ~r~0); {110186#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:08,016 INFO L290 TraceCheckUtils]: 105: Hoare triple {110186#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110211#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:08,016 INFO L290 TraceCheckUtils]: 106: Hoare triple {110211#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {110211#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:08,016 INFO L272 TraceCheckUtils]: 107: Hoare triple {110211#(<= ~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)); {110211#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:08,017 INFO L290 TraceCheckUtils]: 108: Hoare triple {110211#(<= ~counter~0 12)} ~cond := #in~cond; {110211#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:08,017 INFO L290 TraceCheckUtils]: 109: Hoare triple {110211#(<= ~counter~0 12)} assume !(0 == ~cond); {110211#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:08,017 INFO L290 TraceCheckUtils]: 110: Hoare triple {110211#(<= ~counter~0 12)} assume true; {110211#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:08,018 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110211#(<= ~counter~0 12)} {110211#(<= ~counter~0 12)} #96#return; {110211#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:08,018 INFO L290 TraceCheckUtils]: 112: Hoare triple {110211#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110211#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:08,019 INFO L290 TraceCheckUtils]: 113: Hoare triple {110211#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110236#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:08,019 INFO L290 TraceCheckUtils]: 114: Hoare triple {110236#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {110236#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:08,020 INFO L272 TraceCheckUtils]: 115: Hoare triple {110236#(<= ~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)); {110236#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:08,020 INFO L290 TraceCheckUtils]: 116: Hoare triple {110236#(<= ~counter~0 13)} ~cond := #in~cond; {110236#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:08,020 INFO L290 TraceCheckUtils]: 117: Hoare triple {110236#(<= ~counter~0 13)} assume !(0 == ~cond); {110236#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:08,020 INFO L290 TraceCheckUtils]: 118: Hoare triple {110236#(<= ~counter~0 13)} assume true; {110236#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:08,021 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110236#(<= ~counter~0 13)} {110236#(<= ~counter~0 13)} #96#return; {110236#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:08,021 INFO L290 TraceCheckUtils]: 120: Hoare triple {110236#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110236#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:08,021 INFO L290 TraceCheckUtils]: 121: Hoare triple {110236#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110261#(<= |main_#t~post7| 13)} is VALID [2022-04-28 12:47:08,022 INFO L290 TraceCheckUtils]: 122: Hoare triple {110261#(<= |main_#t~post7| 13)} assume !(#t~post7 < 50);havoc #t~post7; {109880#false} is VALID [2022-04-28 12:47:08,022 INFO L290 TraceCheckUtils]: 123: Hoare triple {109880#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109880#false} is VALID [2022-04-28 12:47:08,022 INFO L290 TraceCheckUtils]: 124: Hoare triple {109880#false} assume !(#t~post8 < 50);havoc #t~post8; {109880#false} is VALID [2022-04-28 12:47:08,022 INFO L290 TraceCheckUtils]: 125: Hoare triple {109880#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109880#false} is VALID [2022-04-28 12:47:08,022 INFO L290 TraceCheckUtils]: 126: Hoare triple {109880#false} assume !(#t~post6 < 50);havoc #t~post6; {109880#false} is VALID [2022-04-28 12:47:08,022 INFO L272 TraceCheckUtils]: 127: Hoare triple {109880#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109880#false} is VALID [2022-04-28 12:47:08,022 INFO L290 TraceCheckUtils]: 128: Hoare triple {109880#false} ~cond := #in~cond; {109880#false} is VALID [2022-04-28 12:47:08,022 INFO L290 TraceCheckUtils]: 129: Hoare triple {109880#false} assume 0 == ~cond; {109880#false} is VALID [2022-04-28 12:47:08,022 INFO L290 TraceCheckUtils]: 130: Hoare triple {109880#false} assume !false; {109880#false} is VALID [2022-04-28 12:47:08,022 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-28 12:47:08,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:47:08,558 INFO L290 TraceCheckUtils]: 130: Hoare triple {109880#false} assume !false; {109880#false} is VALID [2022-04-28 12:47:08,558 INFO L290 TraceCheckUtils]: 129: Hoare triple {109880#false} assume 0 == ~cond; {109880#false} is VALID [2022-04-28 12:47:08,559 INFO L290 TraceCheckUtils]: 128: Hoare triple {109880#false} ~cond := #in~cond; {109880#false} is VALID [2022-04-28 12:47:08,559 INFO L272 TraceCheckUtils]: 127: Hoare triple {109880#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109880#false} is VALID [2022-04-28 12:47:08,559 INFO L290 TraceCheckUtils]: 126: Hoare triple {109880#false} assume !(#t~post6 < 50);havoc #t~post6; {109880#false} is VALID [2022-04-28 12:47:08,559 INFO L290 TraceCheckUtils]: 125: Hoare triple {109880#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109880#false} is VALID [2022-04-28 12:47:08,559 INFO L290 TraceCheckUtils]: 124: Hoare triple {109880#false} assume !(#t~post8 < 50);havoc #t~post8; {109880#false} is VALID [2022-04-28 12:47:08,559 INFO L290 TraceCheckUtils]: 123: Hoare triple {109880#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109880#false} is VALID [2022-04-28 12:47:08,559 INFO L290 TraceCheckUtils]: 122: Hoare triple {110313#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {109880#false} is VALID [2022-04-28 12:47:08,559 INFO L290 TraceCheckUtils]: 121: Hoare triple {110317#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110313#(< |main_#t~post7| 50)} is VALID [2022-04-28 12:47:08,560 INFO L290 TraceCheckUtils]: 120: Hoare triple {110317#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110317#(< ~counter~0 50)} is VALID [2022-04-28 12:47:08,560 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {109879#true} {110317#(< ~counter~0 50)} #96#return; {110317#(< ~counter~0 50)} is VALID [2022-04-28 12:47:08,560 INFO L290 TraceCheckUtils]: 118: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,560 INFO L290 TraceCheckUtils]: 117: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,560 INFO L290 TraceCheckUtils]: 116: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,560 INFO L272 TraceCheckUtils]: 115: Hoare triple {110317#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,560 INFO L290 TraceCheckUtils]: 114: Hoare triple {110317#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {110317#(< ~counter~0 50)} is VALID [2022-04-28 12:47:08,562 INFO L290 TraceCheckUtils]: 113: Hoare triple {110342#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110317#(< ~counter~0 50)} is VALID [2022-04-28 12:47:08,563 INFO L290 TraceCheckUtils]: 112: Hoare triple {110342#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110342#(< ~counter~0 49)} is VALID [2022-04-28 12:47:08,563 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {109879#true} {110342#(< ~counter~0 49)} #96#return; {110342#(< ~counter~0 49)} is VALID [2022-04-28 12:47:08,563 INFO L290 TraceCheckUtils]: 110: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,563 INFO L290 TraceCheckUtils]: 109: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,563 INFO L290 TraceCheckUtils]: 108: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,563 INFO L272 TraceCheckUtils]: 107: Hoare triple {110342#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,563 INFO L290 TraceCheckUtils]: 106: Hoare triple {110342#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {110342#(< ~counter~0 49)} is VALID [2022-04-28 12:47:08,564 INFO L290 TraceCheckUtils]: 105: Hoare triple {110367#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110342#(< ~counter~0 49)} is VALID [2022-04-28 12:47:08,564 INFO L290 TraceCheckUtils]: 104: Hoare triple {110367#(< ~counter~0 48)} assume !!(0 != ~r~0); {110367#(< ~counter~0 48)} is VALID [2022-04-28 12:47:08,565 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {109879#true} {110367#(< ~counter~0 48)} #94#return; {110367#(< ~counter~0 48)} is VALID [2022-04-28 12:47:08,565 INFO L290 TraceCheckUtils]: 102: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,565 INFO L290 TraceCheckUtils]: 101: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,565 INFO L290 TraceCheckUtils]: 100: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,565 INFO L272 TraceCheckUtils]: 99: Hoare triple {110367#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,565 INFO L290 TraceCheckUtils]: 98: Hoare triple {110367#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {110367#(< ~counter~0 48)} is VALID [2022-04-28 12:47:08,566 INFO L290 TraceCheckUtils]: 97: Hoare triple {110392#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110367#(< ~counter~0 48)} is VALID [2022-04-28 12:47:08,566 INFO L290 TraceCheckUtils]: 96: Hoare triple {110392#(< ~counter~0 47)} assume !(~r~0 < 0); {110392#(< ~counter~0 47)} is VALID [2022-04-28 12:47:08,567 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {109879#true} {110392#(< ~counter~0 47)} #98#return; {110392#(< ~counter~0 47)} is VALID [2022-04-28 12:47:08,567 INFO L290 TraceCheckUtils]: 94: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,567 INFO L290 TraceCheckUtils]: 93: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,567 INFO L290 TraceCheckUtils]: 92: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,567 INFO L272 TraceCheckUtils]: 91: Hoare triple {110392#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,567 INFO L290 TraceCheckUtils]: 90: Hoare triple {110392#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {110392#(< ~counter~0 47)} is VALID [2022-04-28 12:47:08,568 INFO L290 TraceCheckUtils]: 89: Hoare triple {110417#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110392#(< ~counter~0 47)} is VALID [2022-04-28 12:47:08,568 INFO L290 TraceCheckUtils]: 88: Hoare triple {110417#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110417#(< ~counter~0 46)} is VALID [2022-04-28 12:47:08,568 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109879#true} {110417#(< ~counter~0 46)} #98#return; {110417#(< ~counter~0 46)} is VALID [2022-04-28 12:47:08,569 INFO L290 TraceCheckUtils]: 86: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,569 INFO L272 TraceCheckUtils]: 83: Hoare triple {110417#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,569 INFO L290 TraceCheckUtils]: 82: Hoare triple {110417#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {110417#(< ~counter~0 46)} is VALID [2022-04-28 12:47:08,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {110442#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110417#(< ~counter~0 46)} is VALID [2022-04-28 12:47:08,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {110442#(< ~counter~0 45)} assume !(~r~0 > 0); {110442#(< ~counter~0 45)} is VALID [2022-04-28 12:47:08,570 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109879#true} {110442#(< ~counter~0 45)} #96#return; {110442#(< ~counter~0 45)} is VALID [2022-04-28 12:47:08,570 INFO L290 TraceCheckUtils]: 78: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,570 INFO L272 TraceCheckUtils]: 75: Hoare triple {110442#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {110442#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {110442#(< ~counter~0 45)} is VALID [2022-04-28 12:47:08,571 INFO L290 TraceCheckUtils]: 73: Hoare triple {110467#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110442#(< ~counter~0 45)} is VALID [2022-04-28 12:47:08,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {110467#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110467#(< ~counter~0 44)} is VALID [2022-04-28 12:47:08,572 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109879#true} {110467#(< ~counter~0 44)} #96#return; {110467#(< ~counter~0 44)} is VALID [2022-04-28 12:47:08,572 INFO L290 TraceCheckUtils]: 70: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,572 INFO L290 TraceCheckUtils]: 69: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,572 INFO L290 TraceCheckUtils]: 68: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,572 INFO L272 TraceCheckUtils]: 67: Hoare triple {110467#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,572 INFO L290 TraceCheckUtils]: 66: Hoare triple {110467#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {110467#(< ~counter~0 44)} is VALID [2022-04-28 12:47:08,573 INFO L290 TraceCheckUtils]: 65: Hoare triple {110492#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110467#(< ~counter~0 44)} is VALID [2022-04-28 12:47:08,573 INFO L290 TraceCheckUtils]: 64: Hoare triple {110492#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110492#(< ~counter~0 43)} is VALID [2022-04-28 12:47:08,574 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109879#true} {110492#(< ~counter~0 43)} #96#return; {110492#(< ~counter~0 43)} is VALID [2022-04-28 12:47:08,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,574 INFO L272 TraceCheckUtils]: 59: Hoare triple {110492#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {110492#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {110492#(< ~counter~0 43)} is VALID [2022-04-28 12:47:08,575 INFO L290 TraceCheckUtils]: 57: Hoare triple {110517#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110492#(< ~counter~0 43)} is VALID [2022-04-28 12:47:08,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {110517#(< ~counter~0 42)} assume !!(0 != ~r~0); {110517#(< ~counter~0 42)} is VALID [2022-04-28 12:47:08,576 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109879#true} {110517#(< ~counter~0 42)} #94#return; {110517#(< ~counter~0 42)} is VALID [2022-04-28 12:47:08,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,576 INFO L272 TraceCheckUtils]: 51: Hoare triple {110517#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {110517#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {110517#(< ~counter~0 42)} is VALID [2022-04-28 12:47:08,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {110542#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110517#(< ~counter~0 42)} is VALID [2022-04-28 12:47:08,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {110542#(< ~counter~0 41)} assume !(~r~0 < 0); {110542#(< ~counter~0 41)} is VALID [2022-04-28 12:47:08,577 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109879#true} {110542#(< ~counter~0 41)} #98#return; {110542#(< ~counter~0 41)} is VALID [2022-04-28 12:47:08,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,578 INFO L272 TraceCheckUtils]: 43: Hoare triple {110542#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {110542#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {110542#(< ~counter~0 41)} is VALID [2022-04-28 12:47:08,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {110567#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110542#(< ~counter~0 41)} is VALID [2022-04-28 12:47:08,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {110567#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110567#(< ~counter~0 40)} is VALID [2022-04-28 12:47:08,579 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109879#true} {110567#(< ~counter~0 40)} #98#return; {110567#(< ~counter~0 40)} is VALID [2022-04-28 12:47:08,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,579 INFO L272 TraceCheckUtils]: 35: Hoare triple {110567#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {110567#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {110567#(< ~counter~0 40)} is VALID [2022-04-28 12:47:08,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {110592#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110567#(< ~counter~0 40)} is VALID [2022-04-28 12:47:08,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {110592#(< ~counter~0 39)} assume !(~r~0 > 0); {110592#(< ~counter~0 39)} is VALID [2022-04-28 12:47:08,581 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109879#true} {110592#(< ~counter~0 39)} #96#return; {110592#(< ~counter~0 39)} is VALID [2022-04-28 12:47:08,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,581 INFO L272 TraceCheckUtils]: 27: Hoare triple {110592#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {110592#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {110592#(< ~counter~0 39)} is VALID [2022-04-28 12:47:08,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {110617#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110592#(< ~counter~0 39)} is VALID [2022-04-28 12:47:08,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {110617#(< ~counter~0 38)} assume !!(0 != ~r~0); {110617#(< ~counter~0 38)} is VALID [2022-04-28 12:47:08,583 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109879#true} {110617#(< ~counter~0 38)} #94#return; {110617#(< ~counter~0 38)} is VALID [2022-04-28 12:47:08,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,583 INFO L272 TraceCheckUtils]: 19: Hoare triple {110617#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {110617#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {110617#(< ~counter~0 38)} is VALID [2022-04-28 12:47:08,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {110642#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110617#(< ~counter~0 38)} is VALID [2022-04-28 12:47:08,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {110642#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {110642#(< ~counter~0 37)} is VALID [2022-04-28 12:47:08,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109879#true} {110642#(< ~counter~0 37)} #92#return; {110642#(< ~counter~0 37)} is VALID [2022-04-28 12:47:08,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,585 INFO L272 TraceCheckUtils]: 11: Hoare triple {110642#(< ~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)); {109879#true} is VALID [2022-04-28 12:47:08,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109879#true} {110642#(< ~counter~0 37)} #90#return; {110642#(< ~counter~0 37)} is VALID [2022-04-28 12:47:08,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {109879#true} assume true; {109879#true} is VALID [2022-04-28 12:47:08,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {109879#true} assume !(0 == ~cond); {109879#true} is VALID [2022-04-28 12:47:08,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {109879#true} ~cond := #in~cond; {109879#true} is VALID [2022-04-28 12:47:08,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {110642#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109879#true} is VALID [2022-04-28 12:47:08,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {110642#(< ~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; {110642#(< ~counter~0 37)} is VALID [2022-04-28 12:47:08,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {110642#(< ~counter~0 37)} call #t~ret9 := main(); {110642#(< ~counter~0 37)} is VALID [2022-04-28 12:47:08,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110642#(< ~counter~0 37)} {109879#true} #102#return; {110642#(< ~counter~0 37)} is VALID [2022-04-28 12:47:08,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {110642#(< ~counter~0 37)} assume true; {110642#(< ~counter~0 37)} is VALID [2022-04-28 12:47:08,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {109879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {110642#(< ~counter~0 37)} is VALID [2022-04-28 12:47:08,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {109879#true} call ULTIMATE.init(); {109879#true} is VALID [2022-04-28 12:47:08,588 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-28 12:47:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157080156] [2022-04-28 12:47:08,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:47:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027434113] [2022-04-28 12:47:08,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027434113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:47:08,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:47:08,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 12:47:08,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [230765312] [2022-04-28 12:47:08,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [230765312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:08,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:08,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 12:47:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439879451] [2022-04-28 12:47:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:08,589 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-28 12:47:08,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:08,589 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-28 12:47:08,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:08,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 12:47:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 12:47:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 12:47:08,689 INFO L87 Difference]: Start difference. First operand 730 states and 966 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-28 12:47:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:11,167 INFO L93 Difference]: Finished difference Result 947 states and 1293 transitions. [2022-04-28 12:47:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 12:47:11,167 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-28 12:47:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:11,168 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-28 12:47:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-28 12:47:11,170 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-28 12:47:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-28 12:47:11,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-28 12:47:11,364 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-28 12:47:11,385 INFO L225 Difference]: With dead ends: 947 [2022-04-28 12:47:11,385 INFO L226 Difference]: Without dead ends: 746 [2022-04-28 12:47:11,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=800, Invalid=1092, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 12:47:11,387 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 192 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:47:11,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 325 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:47:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-28 12:47:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2022-04-28 12:47:12,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:12,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 746 states, 566 states have (on average 1.197879858657244) internal successors, (678), 566 states have internal predecessors, (678), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:47:12,653 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 746 states, 566 states have (on average 1.197879858657244) internal successors, (678), 566 states have internal predecessors, (678), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:47:12,654 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 746 states, 566 states have (on average 1.197879858657244) internal successors, (678), 566 states have internal predecessors, (678), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:47:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:12,671 INFO L93 Difference]: Finished difference Result 746 states and 982 transitions. [2022-04-28 12:47:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 982 transitions. [2022-04-28 12:47:12,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:12,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:12,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 746 states, 566 states have (on average 1.197879858657244) internal successors, (678), 566 states have internal predecessors, (678), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 746 states. [2022-04-28 12:47:12,673 INFO L87 Difference]: Start difference. First operand has 746 states, 566 states have (on average 1.197879858657244) internal successors, (678), 566 states have internal predecessors, (678), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 746 states. [2022-04-28 12:47:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:12,690 INFO L93 Difference]: Finished difference Result 746 states and 982 transitions. [2022-04-28 12:47:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 982 transitions. [2022-04-28 12:47:12,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:12,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:12,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:12,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 566 states have (on average 1.197879858657244) internal successors, (678), 566 states have internal predecessors, (678), 153 states have call successors, (153), 28 states have call predecessors, (153), 26 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 12:47:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 982 transitions. [2022-04-28 12:47:12,720 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 982 transitions. Word has length 131 [2022-04-28 12:47:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:12,720 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 982 transitions. [2022-04-28 12:47:12,720 INFO L496 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-28 12:47:12,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 746 states and 982 transitions. [2022-04-28 12:47:33,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 982 edges. 978 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 982 transitions. [2022-04-28 12:47:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 12:47:33,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:33,078 INFO L195 NwaCegarLoop]: 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-28 12:47:33,084 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-28 12:47:33,278 WARN L477 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-28 12:47:33,278 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-28 12:47:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:33,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688670918] [2022-04-28 12:47:33,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-28 12:47:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:33,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848758295] [2022-04-28 12:47:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:33,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:33,290 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:33,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585656461] [2022-04-28 12:47:33,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:47:33,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:33,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:33,296 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-28 12:47:33,299 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-28 12:47:33,377 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:47:33,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:33,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 12:47:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:33,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:34,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {115598#true} call ULTIMATE.init(); {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {115598#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115598#true} {115598#true} #102#return; {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {115598#true} call #t~ret9 := main(); {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {115598#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; {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L272 TraceCheckUtils]: 6: Hoare triple {115598#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {115598#true} {115598#true} #90#return; {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L272 TraceCheckUtils]: 11: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {115598#true} {115598#true} #92#return; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {115598#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {115598#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {115598#true} assume !!(#t~post6 < 50);havoc #t~post6; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L272 TraceCheckUtils]: 19: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {115598#true} {115598#true} #94#return; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {115598#true} assume !!(0 != ~r~0); {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {115598#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {115598#true} assume !!(#t~post7 < 50);havoc #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L272 TraceCheckUtils]: 27: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {115598#true} {115598#true} #96#return; {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {115598#true} assume !(~r~0 > 0); {115598#true} is VALID [2022-04-28 12:47:34,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {115598#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {115598#true} assume !!(#t~post8 < 50);havoc #t~post8; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L272 TraceCheckUtils]: 35: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {115598#true} {115598#true} #98#return; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {115598#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {115598#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {115598#true} assume !!(#t~post8 < 50);havoc #t~post8; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L272 TraceCheckUtils]: 43: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {115598#true} {115598#true} #98#return; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {115598#true} assume !(~r~0 < 0); {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {115598#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {115598#true} assume !!(#t~post6 < 50);havoc #t~post6; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L272 TraceCheckUtils]: 51: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {115598#true} {115598#true} #94#return; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {115598#true} assume !!(0 != ~r~0); {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {115598#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {115598#true} assume !!(#t~post7 < 50);havoc #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L272 TraceCheckUtils]: 59: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 60: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 62: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {115598#true} {115598#true} #96#return; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 64: Hoare triple {115598#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 65: Hoare triple {115598#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 66: Hoare triple {115598#true} assume !!(#t~post7 < 50);havoc #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L272 TraceCheckUtils]: 67: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 68: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 70: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {115598#true} {115598#true} #96#return; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {115598#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115598#true} is VALID [2022-04-28 12:47:34,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {115598#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {115598#true} assume !!(#t~post7 < 50);havoc #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L272 TraceCheckUtils]: 75: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 76: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 77: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 78: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {115598#true} {115598#true} #96#return; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 80: Hoare triple {115598#true} assume !(~r~0 > 0); {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 81: Hoare triple {115598#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 82: Hoare triple {115598#true} assume !!(#t~post8 < 50);havoc #t~post8; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L272 TraceCheckUtils]: 83: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 84: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 85: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 86: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {115598#true} {115598#true} #98#return; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 88: Hoare triple {115598#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 89: Hoare triple {115598#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 90: Hoare triple {115598#true} assume !!(#t~post8 < 50);havoc #t~post8; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L272 TraceCheckUtils]: 91: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 92: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 93: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,012 INFO L290 TraceCheckUtils]: 94: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {115598#true} {115598#true} #98#return; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 96: Hoare triple {115598#true} assume !(~r~0 < 0); {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 97: Hoare triple {115598#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 98: Hoare triple {115598#true} assume !!(#t~post6 < 50);havoc #t~post6; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L272 TraceCheckUtils]: 99: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 100: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 101: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 102: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {115598#true} {115598#true} #94#return; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 104: Hoare triple {115598#true} assume !!(0 != ~r~0); {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 105: Hoare triple {115598#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 106: Hoare triple {115598#true} assume !!(#t~post7 < 50);havoc #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L272 TraceCheckUtils]: 107: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 108: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 109: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 110: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {115598#true} {115598#true} #96#return; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 112: Hoare triple {115598#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 113: Hoare triple {115598#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,013 INFO L290 TraceCheckUtils]: 114: Hoare triple {115598#true} assume !!(#t~post7 < 50);havoc #t~post7; {115598#true} is VALID [2022-04-28 12:47:34,014 INFO L272 TraceCheckUtils]: 115: Hoare triple {115598#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)); {115598#true} is VALID [2022-04-28 12:47:34,014 INFO L290 TraceCheckUtils]: 116: Hoare triple {115598#true} ~cond := #in~cond; {115598#true} is VALID [2022-04-28 12:47:34,014 INFO L290 TraceCheckUtils]: 117: Hoare triple {115598#true} assume !(0 == ~cond); {115598#true} is VALID [2022-04-28 12:47:34,014 INFO L290 TraceCheckUtils]: 118: Hoare triple {115598#true} assume true; {115598#true} is VALID [2022-04-28 12:47:34,014 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {115598#true} {115598#true} #96#return; {115598#true} is VALID [2022-04-28 12:47:34,014 INFO L290 TraceCheckUtils]: 120: Hoare triple {115598#true} assume !(~r~0 > 0); {115963#(not (< 0 main_~r~0))} is VALID [2022-04-28 12:47:34,014 INFO L290 TraceCheckUtils]: 121: Hoare triple {115963#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115963#(not (< 0 main_~r~0))} is VALID [2022-04-28 12:47:34,014 INFO L290 TraceCheckUtils]: 122: Hoare triple {115963#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {115963#(not (< 0 main_~r~0))} is VALID [2022-04-28 12:47:34,015 INFO L272 TraceCheckUtils]: 123: Hoare triple {115963#(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)); {115598#true} is VALID [2022-04-28 12:47:34,015 INFO L290 TraceCheckUtils]: 124: Hoare triple {115598#true} ~cond := #in~cond; {115976#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:47:34,015 INFO L290 TraceCheckUtils]: 125: Hoare triple {115976#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {115980#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:47:34,015 INFO L290 TraceCheckUtils]: 126: Hoare triple {115980#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {115980#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:47:34,016 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {115980#(not (= |__VERIFIER_assert_#in~cond| 0))} {115963#(not (< 0 main_~r~0))} #98#return; {115987#(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-28 12:47:34,018 INFO L290 TraceCheckUtils]: 128: Hoare triple {115987#(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); {115991#(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-28 12:47:34,019 INFO L290 TraceCheckUtils]: 129: Hoare triple {115991#(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; {115991#(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-28 12:47:34,019 INFO L290 TraceCheckUtils]: 130: Hoare triple {115991#(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; {115991#(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-28 12:47:34,021 INFO L272 TraceCheckUtils]: 131: Hoare triple {115991#(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)); {116001#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:47:34,021 INFO L290 TraceCheckUtils]: 132: Hoare triple {116001#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {116005#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:47:34,021 INFO L290 TraceCheckUtils]: 133: Hoare triple {116005#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {115599#false} is VALID [2022-04-28 12:47:34,021 INFO L290 TraceCheckUtils]: 134: Hoare triple {115599#false} assume !false; {115599#false} is VALID [2022-04-28 12:47:34,022 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-28 12:47:34,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:47:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:36,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848758295] [2022-04-28 12:47:36,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:47:36,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585656461] [2022-04-28 12:47:36,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585656461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:47:36,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:47:36,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 12:47:36,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:36,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688670918] [2022-04-28 12:47:36,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688670918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:36,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:36,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:47:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555109729] [2022-04-28 12:47:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:36,439 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-28 12:47:36,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:36,439 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-28 12:47:36,483 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-28 12:47:36,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:47:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:36,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:47:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-28 12:47:36,484 INFO L87 Difference]: Start difference. First operand 746 states and 982 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-28 12:47:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:39,345 INFO L93 Difference]: Finished difference Result 802 states and 1061 transitions. [2022-04-28 12:47:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:47:39,345 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-28 12:47:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:39,345 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-28 12:47:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 12:47:39,346 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-28 12:47:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 12:47:39,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-28 12:47:39,438 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-28 12:47:39,463 INFO L225 Difference]: With dead ends: 802 [2022-04-28 12:47:39,463 INFO L226 Difference]: Without dead ends: 790 [2022-04-28 12:47:39,464 INFO L412 NwaCegarLoop]: 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-28 12:47:39,464 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:47:39,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 264 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:47:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-04-28 12:47:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 727. [2022-04-28 12:47:41,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:41,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 790 states. Second operand has 727 states, 548 states have (on average 1.1806569343065694) internal successors, (647), 555 states have internal predecessors, (647), 150 states have call successors, (150), 30 states have call predecessors, (150), 28 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 12:47:41,009 INFO L74 IsIncluded]: Start isIncluded. First operand 790 states. Second operand has 727 states, 548 states have (on average 1.1806569343065694) internal successors, (647), 555 states have internal predecessors, (647), 150 states have call successors, (150), 30 states have call predecessors, (150), 28 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 12:47:41,010 INFO L87 Difference]: Start difference. First operand 790 states. Second operand has 727 states, 548 states have (on average 1.1806569343065694) internal successors, (647), 555 states have internal predecessors, (647), 150 states have call successors, (150), 30 states have call predecessors, (150), 28 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 12:47:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:41,036 INFO L93 Difference]: Finished difference Result 790 states and 1043 transitions. [2022-04-28 12:47:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1043 transitions. [2022-04-28 12:47:41,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:41,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:41,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 548 states have (on average 1.1806569343065694) internal successors, (647), 555 states have internal predecessors, (647), 150 states have call successors, (150), 30 states have call predecessors, (150), 28 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 790 states. [2022-04-28 12:47:41,038 INFO L87 Difference]: Start difference. First operand has 727 states, 548 states have (on average 1.1806569343065694) internal successors, (647), 555 states have internal predecessors, (647), 150 states have call successors, (150), 30 states have call predecessors, (150), 28 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 790 states. [2022-04-28 12:47:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:41,058 INFO L93 Difference]: Finished difference Result 790 states and 1043 transitions. [2022-04-28 12:47:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1043 transitions. [2022-04-28 12:47:41,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:41,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:41,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:41,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 548 states have (on average 1.1806569343065694) internal successors, (647), 555 states have internal predecessors, (647), 150 states have call successors, (150), 30 states have call predecessors, (150), 28 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 12:47:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 945 transitions. [2022-04-28 12:47:41,081 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 945 transitions. Word has length 135 [2022-04-28 12:47:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:41,081 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 945 transitions. [2022-04-28 12:47:41,082 INFO L496 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-28 12:47:41,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 727 states and 945 transitions. [2022-04-28 12:47:58,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 945 edges. 944 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:47:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 945 transitions. [2022-04-28 12:47:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 12:47:58,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:58,591 INFO L195 NwaCegarLoop]: 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-28 12:47:58,595 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-28 12:47:58,791 WARN L477 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-28 12:47:58,792 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-28 12:47:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:58,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312644085] [2022-04-28 12:47:58,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-28 12:47:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:58,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938968613] [2022-04-28 12:47:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:58,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:58,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587404267] [2022-04-28 12:47:58,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:47:58,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:58,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:58,807 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-28 12:47:58,808 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-28 12:47:58,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:47:58,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:58,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 12:47:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:58,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:59,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {120682#true} call ULTIMATE.init(); {120682#true} is VALID [2022-04-28 12:47:59,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {120682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {120690#(<= ~counter~0 0)} assume true; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120690#(<= ~counter~0 0)} {120682#true} #102#return; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {120690#(<= ~counter~0 0)} call #t~ret9 := main(); {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {120690#(<= ~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; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,599 INFO L272 TraceCheckUtils]: 6: Hoare triple {120690#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {120690#(<= ~counter~0 0)} ~cond := #in~cond; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {120690#(<= ~counter~0 0)} assume !(0 == ~cond); {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {120690#(<= ~counter~0 0)} assume true; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120690#(<= ~counter~0 0)} {120690#(<= ~counter~0 0)} #90#return; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,600 INFO L272 TraceCheckUtils]: 11: Hoare triple {120690#(<= ~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)); {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {120690#(<= ~counter~0 0)} ~cond := #in~cond; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {120690#(<= ~counter~0 0)} assume !(0 == ~cond); {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {120690#(<= ~counter~0 0)} assume true; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,601 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120690#(<= ~counter~0 0)} {120690#(<= ~counter~0 0)} #92#return; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {120690#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {120690#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:59,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {120690#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120739#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:59,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {120739#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {120739#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:59,604 INFO L272 TraceCheckUtils]: 19: Hoare triple {120739#(<= ~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)); {120739#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:59,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {120739#(<= ~counter~0 1)} ~cond := #in~cond; {120739#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:59,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {120739#(<= ~counter~0 1)} assume !(0 == ~cond); {120739#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:59,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {120739#(<= ~counter~0 1)} assume true; {120739#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:59,605 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120739#(<= ~counter~0 1)} {120739#(<= ~counter~0 1)} #94#return; {120739#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:59,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {120739#(<= ~counter~0 1)} assume !!(0 != ~r~0); {120739#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:59,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {120739#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120764#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:59,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {120764#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {120764#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:59,607 INFO L272 TraceCheckUtils]: 27: Hoare triple {120764#(<= ~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)); {120764#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:59,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {120764#(<= ~counter~0 2)} ~cond := #in~cond; {120764#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:59,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {120764#(<= ~counter~0 2)} assume !(0 == ~cond); {120764#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:59,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {120764#(<= ~counter~0 2)} assume true; {120764#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:59,608 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120764#(<= ~counter~0 2)} {120764#(<= ~counter~0 2)} #96#return; {120764#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:59,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {120764#(<= ~counter~0 2)} assume !(~r~0 > 0); {120764#(<= ~counter~0 2)} is VALID [2022-04-28 12:47:59,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {120764#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120789#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:59,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {120789#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {120789#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:59,609 INFO L272 TraceCheckUtils]: 35: Hoare triple {120789#(<= ~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)); {120789#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:59,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {120789#(<= ~counter~0 3)} ~cond := #in~cond; {120789#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:59,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {120789#(<= ~counter~0 3)} assume !(0 == ~cond); {120789#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:59,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {120789#(<= ~counter~0 3)} assume true; {120789#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:59,610 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120789#(<= ~counter~0 3)} {120789#(<= ~counter~0 3)} #98#return; {120789#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:59,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {120789#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {120789#(<= ~counter~0 3)} is VALID [2022-04-28 12:47:59,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {120789#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120814#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:59,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {120814#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {120814#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:59,612 INFO L272 TraceCheckUtils]: 43: Hoare triple {120814#(<= ~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)); {120814#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:59,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {120814#(<= ~counter~0 4)} ~cond := #in~cond; {120814#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:59,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {120814#(<= ~counter~0 4)} assume !(0 == ~cond); {120814#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:59,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {120814#(<= ~counter~0 4)} assume true; {120814#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:59,614 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120814#(<= ~counter~0 4)} {120814#(<= ~counter~0 4)} #98#return; {120814#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:59,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {120814#(<= ~counter~0 4)} assume !(~r~0 < 0); {120814#(<= ~counter~0 4)} is VALID [2022-04-28 12:47:59,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {120814#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120839#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:59,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {120839#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {120839#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:59,615 INFO L272 TraceCheckUtils]: 51: Hoare triple {120839#(<= ~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)); {120839#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:59,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {120839#(<= ~counter~0 5)} ~cond := #in~cond; {120839#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:59,616 INFO L290 TraceCheckUtils]: 53: Hoare triple {120839#(<= ~counter~0 5)} assume !(0 == ~cond); {120839#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:59,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {120839#(<= ~counter~0 5)} assume true; {120839#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:59,616 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120839#(<= ~counter~0 5)} {120839#(<= ~counter~0 5)} #94#return; {120839#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:59,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {120839#(<= ~counter~0 5)} assume !!(0 != ~r~0); {120839#(<= ~counter~0 5)} is VALID [2022-04-28 12:47:59,617 INFO L290 TraceCheckUtils]: 57: Hoare triple {120839#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120864#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:59,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {120864#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {120864#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:59,618 INFO L272 TraceCheckUtils]: 59: Hoare triple {120864#(<= ~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)); {120864#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:59,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {120864#(<= ~counter~0 6)} ~cond := #in~cond; {120864#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:59,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {120864#(<= ~counter~0 6)} assume !(0 == ~cond); {120864#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:59,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {120864#(<= ~counter~0 6)} assume true; {120864#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:59,619 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120864#(<= ~counter~0 6)} {120864#(<= ~counter~0 6)} #96#return; {120864#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:59,619 INFO L290 TraceCheckUtils]: 64: Hoare triple {120864#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {120864#(<= ~counter~0 6)} is VALID [2022-04-28 12:47:59,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {120864#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120889#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:59,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {120889#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {120889#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:59,620 INFO L272 TraceCheckUtils]: 67: Hoare triple {120889#(<= ~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)); {120889#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:59,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {120889#(<= ~counter~0 7)} ~cond := #in~cond; {120889#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:59,621 INFO L290 TraceCheckUtils]: 69: Hoare triple {120889#(<= ~counter~0 7)} assume !(0 == ~cond); {120889#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:59,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {120889#(<= ~counter~0 7)} assume true; {120889#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:59,621 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120889#(<= ~counter~0 7)} {120889#(<= ~counter~0 7)} #96#return; {120889#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:59,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {120889#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {120889#(<= ~counter~0 7)} is VALID [2022-04-28 12:47:59,622 INFO L290 TraceCheckUtils]: 73: Hoare triple {120889#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120914#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:59,623 INFO L290 TraceCheckUtils]: 74: Hoare triple {120914#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {120914#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:59,623 INFO L272 TraceCheckUtils]: 75: Hoare triple {120914#(<= ~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)); {120914#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:59,623 INFO L290 TraceCheckUtils]: 76: Hoare triple {120914#(<= ~counter~0 8)} ~cond := #in~cond; {120914#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:59,623 INFO L290 TraceCheckUtils]: 77: Hoare triple {120914#(<= ~counter~0 8)} assume !(0 == ~cond); {120914#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:59,624 INFO L290 TraceCheckUtils]: 78: Hoare triple {120914#(<= ~counter~0 8)} assume true; {120914#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:59,624 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120914#(<= ~counter~0 8)} {120914#(<= ~counter~0 8)} #96#return; {120914#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:59,624 INFO L290 TraceCheckUtils]: 80: Hoare triple {120914#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {120914#(<= ~counter~0 8)} is VALID [2022-04-28 12:47:59,625 INFO L290 TraceCheckUtils]: 81: Hoare triple {120914#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120939#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:59,625 INFO L290 TraceCheckUtils]: 82: Hoare triple {120939#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {120939#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:59,626 INFO L272 TraceCheckUtils]: 83: Hoare triple {120939#(<= ~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)); {120939#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:59,626 INFO L290 TraceCheckUtils]: 84: Hoare triple {120939#(<= ~counter~0 9)} ~cond := #in~cond; {120939#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:59,626 INFO L290 TraceCheckUtils]: 85: Hoare triple {120939#(<= ~counter~0 9)} assume !(0 == ~cond); {120939#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:59,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {120939#(<= ~counter~0 9)} assume true; {120939#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:59,627 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {120939#(<= ~counter~0 9)} {120939#(<= ~counter~0 9)} #96#return; {120939#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:59,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {120939#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {120939#(<= ~counter~0 9)} is VALID [2022-04-28 12:47:59,628 INFO L290 TraceCheckUtils]: 89: Hoare triple {120939#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120964#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:59,628 INFO L290 TraceCheckUtils]: 90: Hoare triple {120964#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {120964#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:59,628 INFO L272 TraceCheckUtils]: 91: Hoare triple {120964#(<= ~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)); {120964#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:59,629 INFO L290 TraceCheckUtils]: 92: Hoare triple {120964#(<= ~counter~0 10)} ~cond := #in~cond; {120964#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:59,629 INFO L290 TraceCheckUtils]: 93: Hoare triple {120964#(<= ~counter~0 10)} assume !(0 == ~cond); {120964#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:59,629 INFO L290 TraceCheckUtils]: 94: Hoare triple {120964#(<= ~counter~0 10)} assume true; {120964#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:59,629 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {120964#(<= ~counter~0 10)} {120964#(<= ~counter~0 10)} #96#return; {120964#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:59,629 INFO L290 TraceCheckUtils]: 96: Hoare triple {120964#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {120964#(<= ~counter~0 10)} is VALID [2022-04-28 12:47:59,630 INFO L290 TraceCheckUtils]: 97: Hoare triple {120964#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120989#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:59,631 INFO L290 TraceCheckUtils]: 98: Hoare triple {120989#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {120989#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:59,631 INFO L272 TraceCheckUtils]: 99: Hoare triple {120989#(<= ~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)); {120989#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:59,631 INFO L290 TraceCheckUtils]: 100: Hoare triple {120989#(<= ~counter~0 11)} ~cond := #in~cond; {120989#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:59,631 INFO L290 TraceCheckUtils]: 101: Hoare triple {120989#(<= ~counter~0 11)} assume !(0 == ~cond); {120989#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:59,631 INFO L290 TraceCheckUtils]: 102: Hoare triple {120989#(<= ~counter~0 11)} assume true; {120989#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:59,632 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {120989#(<= ~counter~0 11)} {120989#(<= ~counter~0 11)} #96#return; {120989#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:59,632 INFO L290 TraceCheckUtils]: 104: Hoare triple {120989#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {120989#(<= ~counter~0 11)} is VALID [2022-04-28 12:47:59,633 INFO L290 TraceCheckUtils]: 105: Hoare triple {120989#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121014#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:59,633 INFO L290 TraceCheckUtils]: 106: Hoare triple {121014#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {121014#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:59,633 INFO L272 TraceCheckUtils]: 107: Hoare triple {121014#(<= ~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)); {121014#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:59,634 INFO L290 TraceCheckUtils]: 108: Hoare triple {121014#(<= ~counter~0 12)} ~cond := #in~cond; {121014#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:59,634 INFO L290 TraceCheckUtils]: 109: Hoare triple {121014#(<= ~counter~0 12)} assume !(0 == ~cond); {121014#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:59,634 INFO L290 TraceCheckUtils]: 110: Hoare triple {121014#(<= ~counter~0 12)} assume true; {121014#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:59,634 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121014#(<= ~counter~0 12)} {121014#(<= ~counter~0 12)} #96#return; {121014#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:59,634 INFO L290 TraceCheckUtils]: 112: Hoare triple {121014#(<= ~counter~0 12)} assume !(~r~0 > 0); {121014#(<= ~counter~0 12)} is VALID [2022-04-28 12:47:59,635 INFO L290 TraceCheckUtils]: 113: Hoare triple {121014#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121039#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:59,636 INFO L290 TraceCheckUtils]: 114: Hoare triple {121039#(<= ~counter~0 13)} assume !!(#t~post8 < 50);havoc #t~post8; {121039#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:59,636 INFO L272 TraceCheckUtils]: 115: Hoare triple {121039#(<= ~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)); {121039#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:59,636 INFO L290 TraceCheckUtils]: 116: Hoare triple {121039#(<= ~counter~0 13)} ~cond := #in~cond; {121039#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:59,636 INFO L290 TraceCheckUtils]: 117: Hoare triple {121039#(<= ~counter~0 13)} assume !(0 == ~cond); {121039#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:59,637 INFO L290 TraceCheckUtils]: 118: Hoare triple {121039#(<= ~counter~0 13)} assume true; {121039#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:59,637 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121039#(<= ~counter~0 13)} {121039#(<= ~counter~0 13)} #98#return; {121039#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:59,637 INFO L290 TraceCheckUtils]: 120: Hoare triple {121039#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121039#(<= ~counter~0 13)} is VALID [2022-04-28 12:47:59,638 INFO L290 TraceCheckUtils]: 121: Hoare triple {121039#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121064#(<= ~counter~0 14)} is VALID [2022-04-28 12:47:59,638 INFO L290 TraceCheckUtils]: 122: Hoare triple {121064#(<= ~counter~0 14)} assume !!(#t~post8 < 50);havoc #t~post8; {121064#(<= ~counter~0 14)} is VALID [2022-04-28 12:47:59,638 INFO L272 TraceCheckUtils]: 123: Hoare triple {121064#(<= ~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)); {121064#(<= ~counter~0 14)} is VALID [2022-04-28 12:47:59,639 INFO L290 TraceCheckUtils]: 124: Hoare triple {121064#(<= ~counter~0 14)} ~cond := #in~cond; {121064#(<= ~counter~0 14)} is VALID [2022-04-28 12:47:59,639 INFO L290 TraceCheckUtils]: 125: Hoare triple {121064#(<= ~counter~0 14)} assume !(0 == ~cond); {121064#(<= ~counter~0 14)} is VALID [2022-04-28 12:47:59,639 INFO L290 TraceCheckUtils]: 126: Hoare triple {121064#(<= ~counter~0 14)} assume true; {121064#(<= ~counter~0 14)} is VALID [2022-04-28 12:47:59,639 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121064#(<= ~counter~0 14)} {121064#(<= ~counter~0 14)} #98#return; {121064#(<= ~counter~0 14)} is VALID [2022-04-28 12:47:59,640 INFO L290 TraceCheckUtils]: 128: Hoare triple {121064#(<= ~counter~0 14)} assume !(~r~0 < 0); {121064#(<= ~counter~0 14)} is VALID [2022-04-28 12:47:59,640 INFO L290 TraceCheckUtils]: 129: Hoare triple {121064#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121089#(<= |main_#t~post6| 14)} is VALID [2022-04-28 12:47:59,640 INFO L290 TraceCheckUtils]: 130: Hoare triple {121089#(<= |main_#t~post6| 14)} assume !(#t~post6 < 50);havoc #t~post6; {120683#false} is VALID [2022-04-28 12:47:59,640 INFO L272 TraceCheckUtils]: 131: Hoare triple {120683#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120683#false} is VALID [2022-04-28 12:47:59,640 INFO L290 TraceCheckUtils]: 132: Hoare triple {120683#false} ~cond := #in~cond; {120683#false} is VALID [2022-04-28 12:47:59,640 INFO L290 TraceCheckUtils]: 133: Hoare triple {120683#false} assume 0 == ~cond; {120683#false} is VALID [2022-04-28 12:47:59,640 INFO L290 TraceCheckUtils]: 134: Hoare triple {120683#false} assume !false; {120683#false} is VALID [2022-04-28 12:47:59,641 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-28 12:47:59,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:48:00,226 INFO L290 TraceCheckUtils]: 134: Hoare triple {120683#false} assume !false; {120683#false} is VALID [2022-04-28 12:48:00,226 INFO L290 TraceCheckUtils]: 133: Hoare triple {120683#false} assume 0 == ~cond; {120683#false} is VALID [2022-04-28 12:48:00,226 INFO L290 TraceCheckUtils]: 132: Hoare triple {120683#false} ~cond := #in~cond; {120683#false} is VALID [2022-04-28 12:48:00,227 INFO L272 TraceCheckUtils]: 131: Hoare triple {120683#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120683#false} is VALID [2022-04-28 12:48:00,227 INFO L290 TraceCheckUtils]: 130: Hoare triple {121117#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {120683#false} is VALID [2022-04-28 12:48:00,227 INFO L290 TraceCheckUtils]: 129: Hoare triple {121121#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121117#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:48:00,227 INFO L290 TraceCheckUtils]: 128: Hoare triple {121121#(< ~counter~0 50)} assume !(~r~0 < 0); {121121#(< ~counter~0 50)} is VALID [2022-04-28 12:48:00,227 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {120682#true} {121121#(< ~counter~0 50)} #98#return; {121121#(< ~counter~0 50)} is VALID [2022-04-28 12:48:00,227 INFO L290 TraceCheckUtils]: 126: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,228 INFO L290 TraceCheckUtils]: 125: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,228 INFO L290 TraceCheckUtils]: 124: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,228 INFO L272 TraceCheckUtils]: 123: Hoare triple {121121#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,228 INFO L290 TraceCheckUtils]: 122: Hoare triple {121121#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {121121#(< ~counter~0 50)} is VALID [2022-04-28 12:48:00,230 INFO L290 TraceCheckUtils]: 121: Hoare triple {121146#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121121#(< ~counter~0 50)} is VALID [2022-04-28 12:48:00,230 INFO L290 TraceCheckUtils]: 120: Hoare triple {121146#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121146#(< ~counter~0 49)} is VALID [2022-04-28 12:48:00,230 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {120682#true} {121146#(< ~counter~0 49)} #98#return; {121146#(< ~counter~0 49)} is VALID [2022-04-28 12:48:00,230 INFO L290 TraceCheckUtils]: 118: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,230 INFO L290 TraceCheckUtils]: 117: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,230 INFO L290 TraceCheckUtils]: 116: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,230 INFO L272 TraceCheckUtils]: 115: Hoare triple {121146#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,231 INFO L290 TraceCheckUtils]: 114: Hoare triple {121146#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {121146#(< ~counter~0 49)} is VALID [2022-04-28 12:48:00,231 INFO L290 TraceCheckUtils]: 113: Hoare triple {121171#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121146#(< ~counter~0 49)} is VALID [2022-04-28 12:48:00,232 INFO L290 TraceCheckUtils]: 112: Hoare triple {121171#(< ~counter~0 48)} assume !(~r~0 > 0); {121171#(< ~counter~0 48)} is VALID [2022-04-28 12:48:00,232 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {120682#true} {121171#(< ~counter~0 48)} #96#return; {121171#(< ~counter~0 48)} is VALID [2022-04-28 12:48:00,232 INFO L290 TraceCheckUtils]: 110: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,232 INFO L290 TraceCheckUtils]: 109: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,232 INFO L290 TraceCheckUtils]: 108: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,232 INFO L272 TraceCheckUtils]: 107: Hoare triple {121171#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,232 INFO L290 TraceCheckUtils]: 106: Hoare triple {121171#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {121171#(< ~counter~0 48)} is VALID [2022-04-28 12:48:00,233 INFO L290 TraceCheckUtils]: 105: Hoare triple {121196#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121171#(< ~counter~0 48)} is VALID [2022-04-28 12:48:00,233 INFO L290 TraceCheckUtils]: 104: Hoare triple {121196#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121196#(< ~counter~0 47)} is VALID [2022-04-28 12:48:00,234 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {120682#true} {121196#(< ~counter~0 47)} #96#return; {121196#(< ~counter~0 47)} is VALID [2022-04-28 12:48:00,234 INFO L290 TraceCheckUtils]: 102: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,234 INFO L290 TraceCheckUtils]: 101: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,234 INFO L290 TraceCheckUtils]: 100: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,234 INFO L272 TraceCheckUtils]: 99: Hoare triple {121196#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,234 INFO L290 TraceCheckUtils]: 98: Hoare triple {121196#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {121196#(< ~counter~0 47)} is VALID [2022-04-28 12:48:00,235 INFO L290 TraceCheckUtils]: 97: Hoare triple {121221#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121196#(< ~counter~0 47)} is VALID [2022-04-28 12:48:00,235 INFO L290 TraceCheckUtils]: 96: Hoare triple {121221#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121221#(< ~counter~0 46)} is VALID [2022-04-28 12:48:00,235 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {120682#true} {121221#(< ~counter~0 46)} #96#return; {121221#(< ~counter~0 46)} is VALID [2022-04-28 12:48:00,235 INFO L290 TraceCheckUtils]: 94: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,235 INFO L290 TraceCheckUtils]: 93: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,235 INFO L290 TraceCheckUtils]: 92: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,236 INFO L272 TraceCheckUtils]: 91: Hoare triple {121221#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,236 INFO L290 TraceCheckUtils]: 90: Hoare triple {121221#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {121221#(< ~counter~0 46)} is VALID [2022-04-28 12:48:00,237 INFO L290 TraceCheckUtils]: 89: Hoare triple {121246#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121221#(< ~counter~0 46)} is VALID [2022-04-28 12:48:00,237 INFO L290 TraceCheckUtils]: 88: Hoare triple {121246#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121246#(< ~counter~0 45)} is VALID [2022-04-28 12:48:00,237 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {120682#true} {121246#(< ~counter~0 45)} #96#return; {121246#(< ~counter~0 45)} is VALID [2022-04-28 12:48:00,237 INFO L290 TraceCheckUtils]: 86: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,237 INFO L290 TraceCheckUtils]: 85: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,237 INFO L290 TraceCheckUtils]: 84: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,237 INFO L272 TraceCheckUtils]: 83: Hoare triple {121246#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,237 INFO L290 TraceCheckUtils]: 82: Hoare triple {121246#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {121246#(< ~counter~0 45)} is VALID [2022-04-28 12:48:00,238 INFO L290 TraceCheckUtils]: 81: Hoare triple {121271#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121246#(< ~counter~0 45)} is VALID [2022-04-28 12:48:00,238 INFO L290 TraceCheckUtils]: 80: Hoare triple {121271#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121271#(< ~counter~0 44)} is VALID [2022-04-28 12:48:00,239 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120682#true} {121271#(< ~counter~0 44)} #96#return; {121271#(< ~counter~0 44)} is VALID [2022-04-28 12:48:00,239 INFO L290 TraceCheckUtils]: 78: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,239 INFO L272 TraceCheckUtils]: 75: Hoare triple {121271#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {121271#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {121271#(< ~counter~0 44)} is VALID [2022-04-28 12:48:00,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {121296#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121271#(< ~counter~0 44)} is VALID [2022-04-28 12:48:00,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {121296#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121296#(< ~counter~0 43)} is VALID [2022-04-28 12:48:00,240 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120682#true} {121296#(< ~counter~0 43)} #96#return; {121296#(< ~counter~0 43)} is VALID [2022-04-28 12:48:00,240 INFO L290 TraceCheckUtils]: 70: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,240 INFO L290 TraceCheckUtils]: 68: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,241 INFO L272 TraceCheckUtils]: 67: Hoare triple {121296#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {121296#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {121296#(< ~counter~0 43)} is VALID [2022-04-28 12:48:00,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {121321#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121296#(< ~counter~0 43)} is VALID [2022-04-28 12:48:00,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {121321#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121321#(< ~counter~0 42)} is VALID [2022-04-28 12:48:00,242 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120682#true} {121321#(< ~counter~0 42)} #96#return; {121321#(< ~counter~0 42)} is VALID [2022-04-28 12:48:00,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,242 INFO L290 TraceCheckUtils]: 60: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,242 INFO L272 TraceCheckUtils]: 59: Hoare triple {121321#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {121321#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {121321#(< ~counter~0 42)} is VALID [2022-04-28 12:48:00,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {121346#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121321#(< ~counter~0 42)} is VALID [2022-04-28 12:48:00,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {121346#(< ~counter~0 41)} assume !!(0 != ~r~0); {121346#(< ~counter~0 41)} is VALID [2022-04-28 12:48:00,244 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120682#true} {121346#(< ~counter~0 41)} #94#return; {121346#(< ~counter~0 41)} is VALID [2022-04-28 12:48:00,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,244 INFO L290 TraceCheckUtils]: 52: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,244 INFO L272 TraceCheckUtils]: 51: Hoare triple {121346#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {121346#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {121346#(< ~counter~0 41)} is VALID [2022-04-28 12:48:00,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {121371#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121346#(< ~counter~0 41)} is VALID [2022-04-28 12:48:00,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {121371#(< ~counter~0 40)} assume !(~r~0 < 0); {121371#(< ~counter~0 40)} is VALID [2022-04-28 12:48:00,245 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120682#true} {121371#(< ~counter~0 40)} #98#return; {121371#(< ~counter~0 40)} is VALID [2022-04-28 12:48:00,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,246 INFO L272 TraceCheckUtils]: 43: Hoare triple {121371#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {121371#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {121371#(< ~counter~0 40)} is VALID [2022-04-28 12:48:00,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {121396#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121371#(< ~counter~0 40)} is VALID [2022-04-28 12:48:00,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {121396#(< ~counter~0 39)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121396#(< ~counter~0 39)} is VALID [2022-04-28 12:48:00,247 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120682#true} {121396#(< ~counter~0 39)} #98#return; {121396#(< ~counter~0 39)} is VALID [2022-04-28 12:48:00,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,247 INFO L272 TraceCheckUtils]: 35: Hoare triple {121396#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {121396#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {121396#(< ~counter~0 39)} is VALID [2022-04-28 12:48:00,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {121421#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121396#(< ~counter~0 39)} is VALID [2022-04-28 12:48:00,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {121421#(< ~counter~0 38)} assume !(~r~0 > 0); {121421#(< ~counter~0 38)} is VALID [2022-04-28 12:48:00,249 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120682#true} {121421#(< ~counter~0 38)} #96#return; {121421#(< ~counter~0 38)} is VALID [2022-04-28 12:48:00,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,249 INFO L272 TraceCheckUtils]: 27: Hoare triple {121421#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {121421#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {121421#(< ~counter~0 38)} is VALID [2022-04-28 12:48:00,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {121446#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121421#(< ~counter~0 38)} is VALID [2022-04-28 12:48:00,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {121446#(< ~counter~0 37)} assume !!(0 != ~r~0); {121446#(< ~counter~0 37)} is VALID [2022-04-28 12:48:00,250 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120682#true} {121446#(< ~counter~0 37)} #94#return; {121446#(< ~counter~0 37)} is VALID [2022-04-28 12:48:00,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,251 INFO L272 TraceCheckUtils]: 19: Hoare triple {121446#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {121446#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {121446#(< ~counter~0 37)} is VALID [2022-04-28 12:48:00,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {121471#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121446#(< ~counter~0 37)} is VALID [2022-04-28 12:48:00,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {121471#(< ~counter~0 36)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {121471#(< ~counter~0 36)} is VALID [2022-04-28 12:48:00,252 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120682#true} {121471#(< ~counter~0 36)} #92#return; {121471#(< ~counter~0 36)} is VALID [2022-04-28 12:48:00,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,252 INFO L272 TraceCheckUtils]: 11: Hoare triple {121471#(< ~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)); {120682#true} is VALID [2022-04-28 12:48:00,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120682#true} {121471#(< ~counter~0 36)} #90#return; {121471#(< ~counter~0 36)} is VALID [2022-04-28 12:48:00,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {120682#true} assume true; {120682#true} is VALID [2022-04-28 12:48:00,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {120682#true} assume !(0 == ~cond); {120682#true} is VALID [2022-04-28 12:48:00,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {120682#true} ~cond := #in~cond; {120682#true} is VALID [2022-04-28 12:48:00,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {121471#(< ~counter~0 36)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120682#true} is VALID [2022-04-28 12:48:00,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {121471#(< ~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; {121471#(< ~counter~0 36)} is VALID [2022-04-28 12:48:00,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {121471#(< ~counter~0 36)} call #t~ret9 := main(); {121471#(< ~counter~0 36)} is VALID [2022-04-28 12:48:00,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121471#(< ~counter~0 36)} {120682#true} #102#return; {121471#(< ~counter~0 36)} is VALID [2022-04-28 12:48:00,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {121471#(< ~counter~0 36)} assume true; {121471#(< ~counter~0 36)} is VALID [2022-04-28 12:48:00,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {120682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {121471#(< ~counter~0 36)} is VALID [2022-04-28 12:48:00,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {120682#true} call ULTIMATE.init(); {120682#true} is VALID [2022-04-28 12:48:00,254 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-28 12:48:00,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:48:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938968613] [2022-04-28 12:48:00,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:48:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587404267] [2022-04-28 12:48:00,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587404267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:48:00,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:48:00,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-28 12:48:00,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:48:00,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312644085] [2022-04-28 12:48:00,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312644085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:00,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:00,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 12:48:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19312479] [2022-04-28 12:48:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:48:00,255 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-28 12:48:00,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:48:00,255 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-28 12:48:00,345 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-28 12:48:00,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 12:48:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 12:48:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 12:48:00,346 INFO L87 Difference]: Start difference. First operand 727 states and 945 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-28 12:48:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:03,003 INFO L93 Difference]: Finished difference Result 782 states and 1018 transitions. [2022-04-28 12:48:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 12:48:03,003 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-28 12:48:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:48:03,003 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-28 12:48:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-28 12:48:03,009 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-28 12:48:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-28 12:48:03,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-28 12:48:03,211 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-28 12:48:03,237 INFO L225 Difference]: With dead ends: 782 [2022-04-28 12:48:03,237 INFO L226 Difference]: Without dead ends: 777 [2022-04-28 12:48:03,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=834, Invalid=1146, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 12:48:03,238 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 196 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:48:03,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 326 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:48:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2022-04-28 12:48:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 755. [2022-04-28 12:48:04,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:48:04,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 777 states. Second operand has 755 states, 561 states have (on average 1.1800356506238858) internal successors, (662), 578 states have internal predecessors, (662), 163 states have call successors, (163), 32 states have call predecessors, (163), 30 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 12:48:04,636 INFO L74 IsIncluded]: Start isIncluded. First operand 777 states. Second operand has 755 states, 561 states have (on average 1.1800356506238858) internal successors, (662), 578 states have internal predecessors, (662), 163 states have call successors, (163), 32 states have call predecessors, (163), 30 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 12:48:04,637 INFO L87 Difference]: Start difference. First operand 777 states. Second operand has 755 states, 561 states have (on average 1.1800356506238858) internal successors, (662), 578 states have internal predecessors, (662), 163 states have call successors, (163), 32 states have call predecessors, (163), 30 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 12:48:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:04,665 INFO L93 Difference]: Finished difference Result 777 states and 1012 transitions. [2022-04-28 12:48:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1012 transitions. [2022-04-28 12:48:04,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:04,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:04,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 755 states, 561 states have (on average 1.1800356506238858) internal successors, (662), 578 states have internal predecessors, (662), 163 states have call successors, (163), 32 states have call predecessors, (163), 30 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 777 states. [2022-04-28 12:48:04,667 INFO L87 Difference]: Start difference. First operand has 755 states, 561 states have (on average 1.1800356506238858) internal successors, (662), 578 states have internal predecessors, (662), 163 states have call successors, (163), 32 states have call predecessors, (163), 30 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 777 states. [2022-04-28 12:48:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:04,686 INFO L93 Difference]: Finished difference Result 777 states and 1012 transitions. [2022-04-28 12:48:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1012 transitions. [2022-04-28 12:48:04,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:04,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:04,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:48:04,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:48:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 561 states have (on average 1.1800356506238858) internal successors, (662), 578 states have internal predecessors, (662), 163 states have call successors, (163), 32 states have call predecessors, (163), 30 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 12:48:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 986 transitions. [2022-04-28 12:48:04,711 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 986 transitions. Word has length 135 [2022-04-28 12:48:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:48:04,711 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 986 transitions. [2022-04-28 12:48:04,711 INFO L496 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-28 12:48:04,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 755 states and 986 transitions. [2022-04-28 12:48:24,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 986 edges. 984 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:48:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 986 transitions. [2022-04-28 12:48:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 12:48:24,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:48:24,621 INFO L195 NwaCegarLoop]: 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-28 12:48:24,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 12:48:24,821 WARN L477 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-28 12:48:24,821 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:48:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:48:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-28 12:48:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:24,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469394512] [2022-04-28 12:48:24,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:48:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-28 12:48:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:48:24,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872648811] [2022-04-28 12:48:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:48:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:48:24,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:48:24,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360481089] [2022-04-28 12:48:24,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:48:24,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:24,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:48:24,846 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-28 12:48:24,846 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-28 12:48:24,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:48:24,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:48:24,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 12:48:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:48:24,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:50:44,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {126175#true} call ULTIMATE.init(); {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {126175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126175#true} {126175#true} #102#return; {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {126175#true} call #t~ret9 := main(); {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {126175#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; {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {126175#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:44,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:44,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126175#true} {126175#true} #90#return; {126175#true} is VALID [2022-04-28 12:50:44,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {126175#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)); {126175#true} is VALID [2022-04-28 12:50:44,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {126175#true} ~cond := #in~cond; {126216#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:50:44,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {126216#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {126220#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:50:44,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {126220#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {126220#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:50:44,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126220#(not (= |assume_abort_if_not_#in~cond| 0))} {126175#true} #92#return; {126227#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} is VALID [2022-04-28 12:50:46,105 WARN L290 TraceCheckUtils]: 16: Hoare triple {126227#(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; {126231#(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-28 12:50:46,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {126231#(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; {126231#(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-28 12:50:46,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {126231#(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; {126231#(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-28 12:50:46,106 INFO L272 TraceCheckUtils]: 19: Hoare triple {126231#(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)); {126175#true} is VALID [2022-04-28 12:50:46,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:46,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:46,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:46,106 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126175#true} {126231#(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; {126231#(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-28 12:50:46,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {126231#(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); {126231#(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-28 12:50:46,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {126231#(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; {126231#(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-28 12:50:46,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {126231#(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; {126231#(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-28 12:50:46,108 INFO L272 TraceCheckUtils]: 27: Hoare triple {126231#(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)); {126175#true} is VALID [2022-04-28 12:50:46,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:46,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:46,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:46,108 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126175#true} {126231#(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; {126231#(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-28 12:50:46,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {126231#(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); {126231#(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-28 12:50:46,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {126231#(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; {126231#(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-28 12:50:46,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {126231#(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; {126231#(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-28 12:50:46,109 INFO L272 TraceCheckUtils]: 35: Hoare triple {126231#(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)); {126175#true} is VALID [2022-04-28 12:50:46,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:46,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:46,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:46,110 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126175#true} {126231#(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; {126231#(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-28 12:50:46,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {126231#(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; {126304#(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-28 12:50:46,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {126304#(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; {126304#(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-28 12:50:46,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {126304#(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; {126304#(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-28 12:50:46,906 INFO L272 TraceCheckUtils]: 43: Hoare triple {126304#(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)); {126175#true} is VALID [2022-04-28 12:50:46,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:46,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:46,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:46,906 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126175#true} {126304#(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; {126304#(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-28 12:50:46,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {126304#(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); {126304#(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-28 12:50:46,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {126304#(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; {126304#(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-28 12:50:46,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {126304#(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; {126304#(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-28 12:50:46,910 INFO L272 TraceCheckUtils]: 51: Hoare triple {126304#(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)); {126175#true} is VALID [2022-04-28 12:50:46,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:46,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:46,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:46,910 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126175#true} {126304#(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; {126304#(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-28 12:50:46,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {126304#(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); {126304#(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-28 12:50:46,912 INFO L290 TraceCheckUtils]: 57: Hoare triple {126304#(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; {126304#(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-28 12:50:46,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {126304#(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; {126304#(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-28 12:50:46,913 INFO L272 TraceCheckUtils]: 59: Hoare triple {126304#(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)); {126175#true} is VALID [2022-04-28 12:50:46,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:46,913 INFO L290 TraceCheckUtils]: 61: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:46,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:46,916 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126175#true} {126304#(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; {126304#(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-28 12:50:46,921 INFO L290 TraceCheckUtils]: 64: Hoare triple {126304#(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; {126377#(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-28 12:50:48,923 WARN L290 TraceCheckUtils]: 65: Hoare triple {126377#(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; {126377#(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 UNKNOWN [2022-04-28 12:50:48,930 INFO L290 TraceCheckUtils]: 66: Hoare triple {126377#(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; {126377#(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-28 12:50:48,930 INFO L272 TraceCheckUtils]: 67: Hoare triple {126377#(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)); {126175#true} is VALID [2022-04-28 12:50:48,930 INFO L290 TraceCheckUtils]: 68: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:48,930 INFO L290 TraceCheckUtils]: 69: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:48,930 INFO L290 TraceCheckUtils]: 70: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:48,931 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126175#true} {126377#(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; {126377#(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-28 12:50:48,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {126377#(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; {126402#(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-28 12:50:48,961 INFO L290 TraceCheckUtils]: 73: Hoare triple {126402#(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; {126402#(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-28 12:50:48,962 INFO L290 TraceCheckUtils]: 74: Hoare triple {126402#(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; {126402#(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-28 12:50:48,962 INFO L272 TraceCheckUtils]: 75: Hoare triple {126402#(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)); {126175#true} is VALID [2022-04-28 12:50:48,962 INFO L290 TraceCheckUtils]: 76: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:48,962 INFO L290 TraceCheckUtils]: 77: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:48,962 INFO L290 TraceCheckUtils]: 78: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:48,962 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126175#true} {126402#(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; {126402#(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-28 12:50:48,979 INFO L290 TraceCheckUtils]: 80: Hoare triple {126402#(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); {126402#(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-28 12:50:48,980 INFO L290 TraceCheckUtils]: 81: Hoare triple {126402#(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; {126402#(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-28 12:50:48,980 INFO L290 TraceCheckUtils]: 82: Hoare triple {126402#(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; {126402#(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-28 12:50:48,980 INFO L272 TraceCheckUtils]: 83: Hoare triple {126402#(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)); {126175#true} is VALID [2022-04-28 12:50:48,980 INFO L290 TraceCheckUtils]: 84: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:48,980 INFO L290 TraceCheckUtils]: 85: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:48,981 INFO L290 TraceCheckUtils]: 86: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:48,981 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126175#true} {126402#(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; {126402#(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-28 12:50:48,984 INFO L290 TraceCheckUtils]: 88: Hoare triple {126402#(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; {126451#(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-28 12:50:48,990 INFO L290 TraceCheckUtils]: 89: Hoare triple {126451#(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; {126451#(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-28 12:50:48,995 INFO L290 TraceCheckUtils]: 90: Hoare triple {126451#(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; {126451#(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-28 12:50:48,996 INFO L272 TraceCheckUtils]: 91: Hoare triple {126451#(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)); {126175#true} is VALID [2022-04-28 12:50:48,996 INFO L290 TraceCheckUtils]: 92: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:48,996 INFO L290 TraceCheckUtils]: 93: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:48,996 INFO L290 TraceCheckUtils]: 94: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:48,996 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126175#true} {126451#(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; {126451#(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-28 12:50:49,000 INFO L290 TraceCheckUtils]: 96: Hoare triple {126451#(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); {126451#(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-28 12:50:49,000 INFO L290 TraceCheckUtils]: 97: Hoare triple {126451#(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; {126451#(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-28 12:50:49,008 INFO L290 TraceCheckUtils]: 98: Hoare triple {126451#(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; {126451#(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-28 12:50:49,009 INFO L272 TraceCheckUtils]: 99: Hoare triple {126451#(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)); {126175#true} is VALID [2022-04-28 12:50:49,009 INFO L290 TraceCheckUtils]: 100: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:49,009 INFO L290 TraceCheckUtils]: 101: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:49,009 INFO L290 TraceCheckUtils]: 102: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:49,009 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126175#true} {126451#(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; {126451#(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-28 12:50:49,010 INFO L290 TraceCheckUtils]: 104: Hoare triple {126451#(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); {126451#(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-28 12:50:49,011 INFO L290 TraceCheckUtils]: 105: Hoare triple {126451#(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; {126451#(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-28 12:50:49,015 INFO L290 TraceCheckUtils]: 106: Hoare triple {126451#(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; {126451#(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-28 12:50:49,015 INFO L272 TraceCheckUtils]: 107: Hoare triple {126451#(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)); {126175#true} is VALID [2022-04-28 12:50:49,015 INFO L290 TraceCheckUtils]: 108: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:49,015 INFO L290 TraceCheckUtils]: 109: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:49,015 INFO L290 TraceCheckUtils]: 110: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:49,015 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126175#true} {126451#(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; {126451#(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-28 12:50:49,017 INFO L290 TraceCheckUtils]: 112: Hoare triple {126451#(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; {126524#(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-28 12:50:49,018 INFO L290 TraceCheckUtils]: 113: Hoare triple {126524#(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; {126524#(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-28 12:50:49,022 INFO L290 TraceCheckUtils]: 114: Hoare triple {126524#(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; {126524#(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-28 12:50:49,022 INFO L272 TraceCheckUtils]: 115: Hoare triple {126524#(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)); {126175#true} is VALID [2022-04-28 12:50:49,022 INFO L290 TraceCheckUtils]: 116: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:49,022 INFO L290 TraceCheckUtils]: 117: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:49,022 INFO L290 TraceCheckUtils]: 118: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:49,023 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126175#true} {126524#(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; {126524#(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-28 12:50:49,025 INFO L290 TraceCheckUtils]: 120: Hoare triple {126524#(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); {126524#(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-28 12:50:49,035 INFO L290 TraceCheckUtils]: 121: Hoare triple {126524#(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; {126524#(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-28 12:50:49,042 INFO L290 TraceCheckUtils]: 122: Hoare triple {126524#(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; {126524#(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-28 12:50:49,042 INFO L272 TraceCheckUtils]: 123: Hoare triple {126524#(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)); {126175#true} is VALID [2022-04-28 12:50:49,042 INFO L290 TraceCheckUtils]: 124: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:49,042 INFO L290 TraceCheckUtils]: 125: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:49,042 INFO L290 TraceCheckUtils]: 126: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:49,043 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126175#true} {126524#(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; {126524#(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-28 12:50:49,046 INFO L290 TraceCheckUtils]: 128: Hoare triple {126524#(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; {126176#false} is VALID [2022-04-28 12:50:49,046 INFO L290 TraceCheckUtils]: 129: Hoare triple {126176#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126176#false} is VALID [2022-04-28 12:50:49,046 INFO L290 TraceCheckUtils]: 130: Hoare triple {126176#false} assume !(#t~post8 < 50);havoc #t~post8; {126176#false} is VALID [2022-04-28 12:50:49,047 INFO L290 TraceCheckUtils]: 131: Hoare triple {126176#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126176#false} is VALID [2022-04-28 12:50:49,047 INFO L290 TraceCheckUtils]: 132: Hoare triple {126176#false} assume !(#t~post6 < 50);havoc #t~post6; {126176#false} is VALID [2022-04-28 12:50:49,047 INFO L272 TraceCheckUtils]: 133: Hoare triple {126176#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126176#false} is VALID [2022-04-28 12:50:49,047 INFO L290 TraceCheckUtils]: 134: Hoare triple {126176#false} ~cond := #in~cond; {126176#false} is VALID [2022-04-28 12:50:49,047 INFO L290 TraceCheckUtils]: 135: Hoare triple {126176#false} assume 0 == ~cond; {126176#false} is VALID [2022-04-28 12:50:49,047 INFO L290 TraceCheckUtils]: 136: Hoare triple {126176#false} assume !false; {126176#false} is VALID [2022-04-28 12:50:49,047 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-28 12:50:49,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:50:51,661 INFO L290 TraceCheckUtils]: 136: Hoare triple {126176#false} assume !false; {126176#false} is VALID [2022-04-28 12:50:51,661 INFO L290 TraceCheckUtils]: 135: Hoare triple {126176#false} assume 0 == ~cond; {126176#false} is VALID [2022-04-28 12:50:51,661 INFO L290 TraceCheckUtils]: 134: Hoare triple {126176#false} ~cond := #in~cond; {126176#false} is VALID [2022-04-28 12:50:51,661 INFO L272 TraceCheckUtils]: 133: Hoare triple {126176#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126176#false} is VALID [2022-04-28 12:50:51,661 INFO L290 TraceCheckUtils]: 132: Hoare triple {126176#false} assume !(#t~post6 < 50);havoc #t~post6; {126176#false} is VALID [2022-04-28 12:50:51,661 INFO L290 TraceCheckUtils]: 131: Hoare triple {126176#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126176#false} is VALID [2022-04-28 12:50:51,661 INFO L290 TraceCheckUtils]: 130: Hoare triple {126176#false} assume !(#t~post8 < 50);havoc #t~post8; {126176#false} is VALID [2022-04-28 12:50:51,661 INFO L290 TraceCheckUtils]: 129: Hoare triple {126176#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126176#false} is VALID [2022-04-28 12:50:51,661 INFO L290 TraceCheckUtils]: 128: Hoare triple {126621#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126176#false} is VALID [2022-04-28 12:50:51,662 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126175#true} {126621#(not (< main_~r~0 0))} #98#return; {126621#(not (< main_~r~0 0))} is VALID [2022-04-28 12:50:51,662 INFO L290 TraceCheckUtils]: 126: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,662 INFO L290 TraceCheckUtils]: 125: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,662 INFO L290 TraceCheckUtils]: 124: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,662 INFO L272 TraceCheckUtils]: 123: Hoare triple {126621#(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)); {126175#true} is VALID [2022-04-28 12:50:51,662 INFO L290 TraceCheckUtils]: 122: Hoare triple {126621#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {126621#(not (< main_~r~0 0))} is VALID [2022-04-28 12:50:51,662 INFO L290 TraceCheckUtils]: 121: Hoare triple {126621#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126621#(not (< main_~r~0 0))} is VALID [2022-04-28 12:50:51,662 INFO L290 TraceCheckUtils]: 120: Hoare triple {126621#(not (< main_~r~0 0))} assume !(~r~0 > 0); {126621#(not (< main_~r~0 0))} is VALID [2022-04-28 12:50:51,663 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126175#true} {126621#(not (< main_~r~0 0))} #96#return; {126621#(not (< main_~r~0 0))} is VALID [2022-04-28 12:50:51,663 INFO L290 TraceCheckUtils]: 118: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,663 INFO L290 TraceCheckUtils]: 117: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,663 INFO L290 TraceCheckUtils]: 116: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,663 INFO L272 TraceCheckUtils]: 115: Hoare triple {126621#(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)); {126175#true} is VALID [2022-04-28 12:50:51,663 INFO L290 TraceCheckUtils]: 114: Hoare triple {126621#(not (< main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {126621#(not (< main_~r~0 0))} is VALID [2022-04-28 12:50:51,663 INFO L290 TraceCheckUtils]: 113: Hoare triple {126621#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126621#(not (< main_~r~0 0))} is VALID [2022-04-28 12:50:51,664 INFO L290 TraceCheckUtils]: 112: Hoare triple {126670#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126621#(not (< main_~r~0 0))} is VALID [2022-04-28 12:50:51,664 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126175#true} {126670#(<= main_~v~0 main_~r~0)} #96#return; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,664 INFO L290 TraceCheckUtils]: 110: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,664 INFO L290 TraceCheckUtils]: 109: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,664 INFO L290 TraceCheckUtils]: 108: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,664 INFO L272 TraceCheckUtils]: 107: Hoare triple {126670#(<= 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)); {126175#true} is VALID [2022-04-28 12:50:51,665 INFO L290 TraceCheckUtils]: 106: Hoare triple {126670#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 50);havoc #t~post7; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,665 INFO L290 TraceCheckUtils]: 105: Hoare triple {126670#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,665 INFO L290 TraceCheckUtils]: 104: Hoare triple {126670#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,665 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126175#true} {126670#(<= main_~v~0 main_~r~0)} #94#return; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,665 INFO L290 TraceCheckUtils]: 102: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,665 INFO L290 TraceCheckUtils]: 101: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,665 INFO L290 TraceCheckUtils]: 100: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,665 INFO L272 TraceCheckUtils]: 99: Hoare triple {126670#(<= 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)); {126175#true} is VALID [2022-04-28 12:50:51,666 INFO L290 TraceCheckUtils]: 98: Hoare triple {126670#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 50);havoc #t~post6; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,666 INFO L290 TraceCheckUtils]: 97: Hoare triple {126670#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,666 INFO L290 TraceCheckUtils]: 96: Hoare triple {126670#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,666 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126175#true} {126670#(<= main_~v~0 main_~r~0)} #98#return; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,666 INFO L290 TraceCheckUtils]: 94: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,666 INFO L290 TraceCheckUtils]: 93: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,666 INFO L290 TraceCheckUtils]: 92: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,666 INFO L272 TraceCheckUtils]: 91: Hoare triple {126670#(<= 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)); {126175#true} is VALID [2022-04-28 12:50:51,667 INFO L290 TraceCheckUtils]: 90: Hoare triple {126670#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 50);havoc #t~post8; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,667 INFO L290 TraceCheckUtils]: 89: Hoare triple {126670#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,668 INFO L290 TraceCheckUtils]: 88: Hoare triple {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126670#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 12:50:51,669 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126175#true} {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:50:51,669 INFO L290 TraceCheckUtils]: 86: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,669 INFO L290 TraceCheckUtils]: 85: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,669 INFO L290 TraceCheckUtils]: 84: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,669 INFO L272 TraceCheckUtils]: 83: Hoare triple {126743#(<= 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)); {126175#true} is VALID [2022-04-28 12:50:51,669 INFO L290 TraceCheckUtils]: 82: Hoare triple {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:50:51,669 INFO L290 TraceCheckUtils]: 81: Hoare triple {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:50:51,669 INFO L290 TraceCheckUtils]: 80: Hoare triple {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:50:51,669 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126175#true} {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:50:51,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,670 INFO L290 TraceCheckUtils]: 77: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,670 INFO L290 TraceCheckUtils]: 76: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,670 INFO L272 TraceCheckUtils]: 75: Hoare triple {126743#(<= 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)); {126175#true} is VALID [2022-04-28 12:50:51,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:50:51,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:50:51,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {126792#(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; {126743#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 12:50:51,671 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126175#true} {126792#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {126792#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 12:50:51,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,671 INFO L290 TraceCheckUtils]: 68: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,671 INFO L272 TraceCheckUtils]: 67: Hoare triple {126792#(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)); {126175#true} is VALID [2022-04-28 12:50:51,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {126792#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {126792#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 12:50:51,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {126792#(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; {126792#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 12:50:51,673 INFO L290 TraceCheckUtils]: 64: Hoare triple {126817#(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; {126792#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 12:50:51,673 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126175#true} {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,673 INFO L290 TraceCheckUtils]: 62: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,673 INFO L290 TraceCheckUtils]: 61: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,673 INFO L272 TraceCheckUtils]: 59: Hoare triple {126817#(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)); {126175#true} is VALID [2022-04-28 12:50:51,674 INFO L290 TraceCheckUtils]: 58: Hoare triple {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 50);havoc #t~post7; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {126817#(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; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,674 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126175#true} {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,675 INFO L272 TraceCheckUtils]: 51: Hoare triple {126817#(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)); {126175#true} is VALID [2022-04-28 12:50:51,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 50);havoc #t~post6; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {126817#(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; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,676 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126175#true} {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,676 INFO L272 TraceCheckUtils]: 43: Hoare triple {126817#(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)); {126175#true} is VALID [2022-04-28 12:50:51,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 50);havoc #t~post8; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {126817#(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; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {126890#(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; {126817#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 12:50:51,679 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126175#true} {126890#(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; {126890#(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-28 12:50:51,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,679 INFO L272 TraceCheckUtils]: 35: Hoare triple {126890#(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)); {126175#true} is VALID [2022-04-28 12:50:51,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {126890#(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; {126890#(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-28 12:50:51,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {126890#(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; {126890#(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-28 12:50:51,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {126890#(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); {126890#(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-28 12:50:51,680 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126175#true} {126890#(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; {126890#(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-28 12:50:51,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,680 INFO L272 TraceCheckUtils]: 27: Hoare triple {126890#(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)); {126175#true} is VALID [2022-04-28 12:50:51,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {126890#(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; {126890#(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-28 12:50:51,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {126890#(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; {126890#(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-28 12:50:51,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {126890#(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); {126890#(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-28 12:50:51,681 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126175#true} {126890#(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; {126890#(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-28 12:50:51,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,682 INFO L272 TraceCheckUtils]: 19: Hoare triple {126890#(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)); {126175#true} is VALID [2022-04-28 12:50:51,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {126890#(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; {126890#(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-28 12:50:51,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {126890#(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; {126890#(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-28 12:50:51,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {126963#(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; {126890#(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-28 12:50:51,684 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126220#(not (= |assume_abort_if_not_#in~cond| 0))} {126175#true} #92#return; {126963#(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-28 12:50:51,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {126220#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {126220#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:50:51,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {126976#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {126220#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:50:51,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {126175#true} ~cond := #in~cond; {126976#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:50:51,685 INFO L272 TraceCheckUtils]: 11: Hoare triple {126175#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)); {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126175#true} {126175#true} #90#return; {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {126175#true} assume !(0 == ~cond); {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {126175#true} ~cond := #in~cond; {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {126175#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {126175#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; {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {126175#true} call #t~ret9 := main(); {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126175#true} {126175#true} #102#return; {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {126175#true} assume true; {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {126175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {126175#true} is VALID [2022-04-28 12:50:51,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {126175#true} call ULTIMATE.init(); {126175#true} is VALID [2022-04-28 12:50:51,686 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-28 12:50:51,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:50:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872648811] [2022-04-28 12:50:51,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:50:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360481089] [2022-04-28 12:50:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360481089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:50:51,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:50:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-28 12:50:51,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:50:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469394512] [2022-04-28 12:50:51,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469394512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:50:51,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:50:51,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:50:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406288974] [2022-04-28 12:50:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:50:51,687 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-28 12:50:51,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:50:51,687 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-28 12:50:57,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 96 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:50:57,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:50:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:50:57,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:50:57,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=288, Unknown=2, NotChecked=0, Total=342 [2022-04-28 12:50:57,470 INFO L87 Difference]: Start difference. First operand 755 states and 986 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-28 12:51:04,254 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-28 12:51:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:51:10,984 INFO L93 Difference]: Finished difference Result 1012 states and 1372 transitions. [2022-04-28 12:51:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:51:10,984 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-28 12:51:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:51:10,984 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-28 12:51:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-28 12:51:10,985 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-28 12:51:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-28 12:51:10,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-28 12:51:18,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 158 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:51:18,467 INFO L225 Difference]: With dead ends: 1012 [2022-04-28 12:51:18,467 INFO L226 Difference]: Without dead ends: 899 [2022-04-28 12:51:18,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=70, Invalid=390, Unknown=2, NotChecked=0, Total=462 [2022-04-28 12:51:18,468 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 28 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 12:51:18,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 467 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 1 Unknown, 197 Unchecked, 2.6s Time] [2022-04-28 12:51:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-04-28 12:51:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 762. [2022-04-28 12:51:20,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:51:20,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 762 states, 566 states have (on average 1.1784452296819787) internal successors, (667), 584 states have internal predecessors, (667), 165 states have call successors, (165), 32 states have call predecessors, (165), 30 states have return successors, (163), 145 states have call predecessors, (163), 163 states have call successors, (163) [2022-04-28 12:51:20,574 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 762 states, 566 states have (on average 1.1784452296819787) internal successors, (667), 584 states have internal predecessors, (667), 165 states have call successors, (165), 32 states have call predecessors, (165), 30 states have return successors, (163), 145 states have call predecessors, (163), 163 states have call successors, (163) [2022-04-28 12:51:20,575 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 762 states, 566 states have (on average 1.1784452296819787) internal successors, (667), 584 states have internal predecessors, (667), 165 states have call successors, (165), 32 states have call predecessors, (165), 30 states have return successors, (163), 145 states have call predecessors, (163), 163 states have call successors, (163) [2022-04-28 12:51:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:51:20,603 INFO L93 Difference]: Finished difference Result 899 states and 1204 transitions. [2022-04-28 12:51:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1204 transitions. [2022-04-28 12:51:20,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:51:20,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:51:20,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 762 states, 566 states have (on average 1.1784452296819787) internal successors, (667), 584 states have internal predecessors, (667), 165 states have call successors, (165), 32 states have call predecessors, (165), 30 states have return successors, (163), 145 states have call predecessors, (163), 163 states have call successors, (163) Second operand 899 states. [2022-04-28 12:51:20,605 INFO L87 Difference]: Start difference. First operand has 762 states, 566 states have (on average 1.1784452296819787) internal successors, (667), 584 states have internal predecessors, (667), 165 states have call successors, (165), 32 states have call predecessors, (165), 30 states have return successors, (163), 145 states have call predecessors, (163), 163 states have call successors, (163) Second operand 899 states. [2022-04-28 12:51:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:51:20,637 INFO L93 Difference]: Finished difference Result 899 states and 1204 transitions. [2022-04-28 12:51:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1204 transitions. [2022-04-28 12:51:20,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:51:20,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:51:20,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:51:20,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:51:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 566 states have (on average 1.1784452296819787) internal successors, (667), 584 states have internal predecessors, (667), 165 states have call successors, (165), 32 states have call predecessors, (165), 30 states have return successors, (163), 145 states have call predecessors, (163), 163 states have call successors, (163) [2022-04-28 12:51:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 995 transitions. [2022-04-28 12:51:20,662 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 995 transitions. Word has length 137 [2022-04-28 12:51:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:51:20,662 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 995 transitions. [2022-04-28 12:51:20,662 INFO L496 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-28 12:51:20,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 762 states and 995 transitions. [2022-04-28 12:51:47,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 995 edges. 989 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 12:51:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 995 transitions. [2022-04-28 12:51:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 12:51:47,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:51:47,271 INFO L195 NwaCegarLoop]: 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-28 12:51:47,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-28 12:51:47,471 WARN L477 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-28 12:51:47,471 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:51:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:51:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-28 12:51:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:51:47,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285220270] [2022-04-28 12:51:47,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:51:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-28 12:51:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:51:47,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636820654] [2022-04-28 12:51:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:51:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:51:47,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:51:47,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838940900] [2022-04-28 12:51:47,486 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:51:47,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:51:47,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:51:47,487 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-28 12:51:47,488 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-28 12:51:47,664 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 12:51:47,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:51:47,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 12:51:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:51:47,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:51:48,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {132367#true} call ULTIMATE.init(); {132367#true} is VALID [2022-04-28 12:51:48,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {132367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {132375#(<= ~counter~0 0)} assume true; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132375#(<= ~counter~0 0)} {132367#true} #102#return; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {132375#(<= ~counter~0 0)} call #t~ret9 := main(); {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {132375#(<= ~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; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {132375#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {132375#(<= ~counter~0 0)} ~cond := #in~cond; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {132375#(<= ~counter~0 0)} assume !(0 == ~cond); {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {132375#(<= ~counter~0 0)} assume true; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132375#(<= ~counter~0 0)} {132375#(<= ~counter~0 0)} #90#return; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,419 INFO L272 TraceCheckUtils]: 11: Hoare triple {132375#(<= ~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)); {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {132375#(<= ~counter~0 0)} ~cond := #in~cond; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {132375#(<= ~counter~0 0)} assume !(0 == ~cond); {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {132375#(<= ~counter~0 0)} assume true; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,420 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132375#(<= ~counter~0 0)} {132375#(<= ~counter~0 0)} #92#return; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {132375#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {132375#(<= ~counter~0 0)} is VALID [2022-04-28 12:51:48,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {132375#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132424#(<= ~counter~0 1)} is VALID [2022-04-28 12:51:48,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {132424#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {132424#(<= ~counter~0 1)} is VALID [2022-04-28 12:51:48,423 INFO L272 TraceCheckUtils]: 19: Hoare triple {132424#(<= ~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)); {132424#(<= ~counter~0 1)} is VALID [2022-04-28 12:51:48,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {132424#(<= ~counter~0 1)} ~cond := #in~cond; {132424#(<= ~counter~0 1)} is VALID [2022-04-28 12:51:48,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {132424#(<= ~counter~0 1)} assume !(0 == ~cond); {132424#(<= ~counter~0 1)} is VALID [2022-04-28 12:51:48,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {132424#(<= ~counter~0 1)} assume true; {132424#(<= ~counter~0 1)} is VALID [2022-04-28 12:51:48,425 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132424#(<= ~counter~0 1)} {132424#(<= ~counter~0 1)} #94#return; {132424#(<= ~counter~0 1)} is VALID [2022-04-28 12:51:48,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {132424#(<= ~counter~0 1)} assume !!(0 != ~r~0); {132424#(<= ~counter~0 1)} is VALID [2022-04-28 12:51:48,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {132424#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132449#(<= ~counter~0 2)} is VALID [2022-04-28 12:51:48,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {132449#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {132449#(<= ~counter~0 2)} is VALID [2022-04-28 12:51:48,427 INFO L272 TraceCheckUtils]: 27: Hoare triple {132449#(<= ~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)); {132449#(<= ~counter~0 2)} is VALID [2022-04-28 12:51:48,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {132449#(<= ~counter~0 2)} ~cond := #in~cond; {132449#(<= ~counter~0 2)} is VALID [2022-04-28 12:51:48,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {132449#(<= ~counter~0 2)} assume !(0 == ~cond); {132449#(<= ~counter~0 2)} is VALID [2022-04-28 12:51:48,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {132449#(<= ~counter~0 2)} assume true; {132449#(<= ~counter~0 2)} is VALID [2022-04-28 12:51:48,428 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132449#(<= ~counter~0 2)} {132449#(<= ~counter~0 2)} #96#return; {132449#(<= ~counter~0 2)} is VALID [2022-04-28 12:51:48,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {132449#(<= ~counter~0 2)} assume !(~r~0 > 0); {132449#(<= ~counter~0 2)} is VALID [2022-04-28 12:51:48,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {132449#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132474#(<= ~counter~0 3)} is VALID [2022-04-28 12:51:48,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {132474#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {132474#(<= ~counter~0 3)} is VALID [2022-04-28 12:51:48,430 INFO L272 TraceCheckUtils]: 35: Hoare triple {132474#(<= ~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)); {132474#(<= ~counter~0 3)} is VALID [2022-04-28 12:51:48,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {132474#(<= ~counter~0 3)} ~cond := #in~cond; {132474#(<= ~counter~0 3)} is VALID [2022-04-28 12:51:48,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {132474#(<= ~counter~0 3)} assume !(0 == ~cond); {132474#(<= ~counter~0 3)} is VALID [2022-04-28 12:51:48,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {132474#(<= ~counter~0 3)} assume true; {132474#(<= ~counter~0 3)} is VALID [2022-04-28 12:51:48,431 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132474#(<= ~counter~0 3)} {132474#(<= ~counter~0 3)} #98#return; {132474#(<= ~counter~0 3)} is VALID [2022-04-28 12:51:48,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {132474#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132474#(<= ~counter~0 3)} is VALID [2022-04-28 12:51:48,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {132474#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132499#(<= ~counter~0 4)} is VALID [2022-04-28 12:51:48,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {132499#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {132499#(<= ~counter~0 4)} is VALID [2022-04-28 12:51:48,433 INFO L272 TraceCheckUtils]: 43: Hoare triple {132499#(<= ~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)); {132499#(<= ~counter~0 4)} is VALID [2022-04-28 12:51:48,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {132499#(<= ~counter~0 4)} ~cond := #in~cond; {132499#(<= ~counter~0 4)} is VALID [2022-04-28 12:51:48,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {132499#(<= ~counter~0 4)} assume !(0 == ~cond); {132499#(<= ~counter~0 4)} is VALID [2022-04-28 12:51:48,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {132499#(<= ~counter~0 4)} assume true; {132499#(<= ~counter~0 4)} is VALID [2022-04-28 12:51:48,434 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132499#(<= ~counter~0 4)} {132499#(<= ~counter~0 4)} #98#return; {132499#(<= ~counter~0 4)} is VALID [2022-04-28 12:51:48,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {132499#(<= ~counter~0 4)} assume !(~r~0 < 0); {132499#(<= ~counter~0 4)} is VALID [2022-04-28 12:51:48,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {132499#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132524#(<= ~counter~0 5)} is VALID [2022-04-28 12:51:48,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {132524#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {132524#(<= ~counter~0 5)} is VALID [2022-04-28 12:51:48,436 INFO L272 TraceCheckUtils]: 51: Hoare triple {132524#(<= ~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)); {132524#(<= ~counter~0 5)} is VALID [2022-04-28 12:51:48,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {132524#(<= ~counter~0 5)} ~cond := #in~cond; {132524#(<= ~counter~0 5)} is VALID [2022-04-28 12:51:48,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {132524#(<= ~counter~0 5)} assume !(0 == ~cond); {132524#(<= ~counter~0 5)} is VALID [2022-04-28 12:51:48,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {132524#(<= ~counter~0 5)} assume true; {132524#(<= ~counter~0 5)} is VALID [2022-04-28 12:51:48,438 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132524#(<= ~counter~0 5)} {132524#(<= ~counter~0 5)} #94#return; {132524#(<= ~counter~0 5)} is VALID [2022-04-28 12:51:48,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {132524#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132524#(<= ~counter~0 5)} is VALID [2022-04-28 12:51:48,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {132524#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132549#(<= ~counter~0 6)} is VALID [2022-04-28 12:51:48,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {132549#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {132549#(<= ~counter~0 6)} is VALID [2022-04-28 12:51:48,440 INFO L272 TraceCheckUtils]: 59: Hoare triple {132549#(<= ~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)); {132549#(<= ~counter~0 6)} is VALID [2022-04-28 12:51:48,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {132549#(<= ~counter~0 6)} ~cond := #in~cond; {132549#(<= ~counter~0 6)} is VALID [2022-04-28 12:51:48,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {132549#(<= ~counter~0 6)} assume !(0 == ~cond); {132549#(<= ~counter~0 6)} is VALID [2022-04-28 12:51:48,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {132549#(<= ~counter~0 6)} assume true; {132549#(<= ~counter~0 6)} is VALID [2022-04-28 12:51:48,441 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132549#(<= ~counter~0 6)} {132549#(<= ~counter~0 6)} #96#return; {132549#(<= ~counter~0 6)} is VALID [2022-04-28 12:51:48,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {132549#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132549#(<= ~counter~0 6)} is VALID [2022-04-28 12:51:48,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {132549#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132574#(<= ~counter~0 7)} is VALID [2022-04-28 12:51:48,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {132574#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {132574#(<= ~counter~0 7)} is VALID [2022-04-28 12:51:48,443 INFO L272 TraceCheckUtils]: 67: Hoare triple {132574#(<= ~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)); {132574#(<= ~counter~0 7)} is VALID [2022-04-28 12:51:48,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {132574#(<= ~counter~0 7)} ~cond := #in~cond; {132574#(<= ~counter~0 7)} is VALID [2022-04-28 12:51:48,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {132574#(<= ~counter~0 7)} assume !(0 == ~cond); {132574#(<= ~counter~0 7)} is VALID [2022-04-28 12:51:48,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {132574#(<= ~counter~0 7)} assume true; {132574#(<= ~counter~0 7)} is VALID [2022-04-28 12:51:48,444 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132574#(<= ~counter~0 7)} {132574#(<= ~counter~0 7)} #96#return; {132574#(<= ~counter~0 7)} is VALID [2022-04-28 12:51:48,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {132574#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132574#(<= ~counter~0 7)} is VALID [2022-04-28 12:51:48,446 INFO L290 TraceCheckUtils]: 73: Hoare triple {132574#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132599#(<= ~counter~0 8)} is VALID [2022-04-28 12:51:48,446 INFO L290 TraceCheckUtils]: 74: Hoare triple {132599#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {132599#(<= ~counter~0 8)} is VALID [2022-04-28 12:51:48,446 INFO L272 TraceCheckUtils]: 75: Hoare triple {132599#(<= ~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)); {132599#(<= ~counter~0 8)} is VALID [2022-04-28 12:51:48,447 INFO L290 TraceCheckUtils]: 76: Hoare triple {132599#(<= ~counter~0 8)} ~cond := #in~cond; {132599#(<= ~counter~0 8)} is VALID [2022-04-28 12:51:48,447 INFO L290 TraceCheckUtils]: 77: Hoare triple {132599#(<= ~counter~0 8)} assume !(0 == ~cond); {132599#(<= ~counter~0 8)} is VALID [2022-04-28 12:51:48,447 INFO L290 TraceCheckUtils]: 78: Hoare triple {132599#(<= ~counter~0 8)} assume true; {132599#(<= ~counter~0 8)} is VALID [2022-04-28 12:51:48,448 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132599#(<= ~counter~0 8)} {132599#(<= ~counter~0 8)} #96#return; {132599#(<= ~counter~0 8)} is VALID [2022-04-28 12:51:48,448 INFO L290 TraceCheckUtils]: 80: Hoare triple {132599#(<= ~counter~0 8)} assume !(~r~0 > 0); {132599#(<= ~counter~0 8)} is VALID [2022-04-28 12:51:48,449 INFO L290 TraceCheckUtils]: 81: Hoare triple {132599#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132624#(<= ~counter~0 9)} is VALID [2022-04-28 12:51:48,449 INFO L290 TraceCheckUtils]: 82: Hoare triple {132624#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {132624#(<= ~counter~0 9)} is VALID [2022-04-28 12:51:48,450 INFO L272 TraceCheckUtils]: 83: Hoare triple {132624#(<= ~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)); {132624#(<= ~counter~0 9)} is VALID [2022-04-28 12:51:48,450 INFO L290 TraceCheckUtils]: 84: Hoare triple {132624#(<= ~counter~0 9)} ~cond := #in~cond; {132624#(<= ~counter~0 9)} is VALID [2022-04-28 12:51:48,450 INFO L290 TraceCheckUtils]: 85: Hoare triple {132624#(<= ~counter~0 9)} assume !(0 == ~cond); {132624#(<= ~counter~0 9)} is VALID [2022-04-28 12:51:48,450 INFO L290 TraceCheckUtils]: 86: Hoare triple {132624#(<= ~counter~0 9)} assume true; {132624#(<= ~counter~0 9)} is VALID [2022-04-28 12:51:48,451 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132624#(<= ~counter~0 9)} {132624#(<= ~counter~0 9)} #98#return; {132624#(<= ~counter~0 9)} is VALID [2022-04-28 12:51:48,451 INFO L290 TraceCheckUtils]: 88: Hoare triple {132624#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132624#(<= ~counter~0 9)} is VALID [2022-04-28 12:51:48,452 INFO L290 TraceCheckUtils]: 89: Hoare triple {132624#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132649#(<= ~counter~0 10)} is VALID [2022-04-28 12:51:48,452 INFO L290 TraceCheckUtils]: 90: Hoare triple {132649#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {132649#(<= ~counter~0 10)} is VALID [2022-04-28 12:51:48,453 INFO L272 TraceCheckUtils]: 91: Hoare triple {132649#(<= ~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)); {132649#(<= ~counter~0 10)} is VALID [2022-04-28 12:51:48,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {132649#(<= ~counter~0 10)} ~cond := #in~cond; {132649#(<= ~counter~0 10)} is VALID [2022-04-28 12:51:48,453 INFO L290 TraceCheckUtils]: 93: Hoare triple {132649#(<= ~counter~0 10)} assume !(0 == ~cond); {132649#(<= ~counter~0 10)} is VALID [2022-04-28 12:51:48,454 INFO L290 TraceCheckUtils]: 94: Hoare triple {132649#(<= ~counter~0 10)} assume true; {132649#(<= ~counter~0 10)} is VALID [2022-04-28 12:51:48,454 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132649#(<= ~counter~0 10)} {132649#(<= ~counter~0 10)} #98#return; {132649#(<= ~counter~0 10)} is VALID [2022-04-28 12:51:48,454 INFO L290 TraceCheckUtils]: 96: Hoare triple {132649#(<= ~counter~0 10)} assume !(~r~0 < 0); {132649#(<= ~counter~0 10)} is VALID [2022-04-28 12:51:48,455 INFO L290 TraceCheckUtils]: 97: Hoare triple {132649#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132674#(<= ~counter~0 11)} is VALID [2022-04-28 12:51:48,456 INFO L290 TraceCheckUtils]: 98: Hoare triple {132674#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {132674#(<= ~counter~0 11)} is VALID [2022-04-28 12:51:48,456 INFO L272 TraceCheckUtils]: 99: Hoare triple {132674#(<= ~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)); {132674#(<= ~counter~0 11)} is VALID [2022-04-28 12:51:48,456 INFO L290 TraceCheckUtils]: 100: Hoare triple {132674#(<= ~counter~0 11)} ~cond := #in~cond; {132674#(<= ~counter~0 11)} is VALID [2022-04-28 12:51:48,457 INFO L290 TraceCheckUtils]: 101: Hoare triple {132674#(<= ~counter~0 11)} assume !(0 == ~cond); {132674#(<= ~counter~0 11)} is VALID [2022-04-28 12:51:48,457 INFO L290 TraceCheckUtils]: 102: Hoare triple {132674#(<= ~counter~0 11)} assume true; {132674#(<= ~counter~0 11)} is VALID [2022-04-28 12:51:48,457 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132674#(<= ~counter~0 11)} {132674#(<= ~counter~0 11)} #94#return; {132674#(<= ~counter~0 11)} is VALID [2022-04-28 12:51:48,458 INFO L290 TraceCheckUtils]: 104: Hoare triple {132674#(<= ~counter~0 11)} assume !!(0 != ~r~0); {132674#(<= ~counter~0 11)} is VALID [2022-04-28 12:51:48,459 INFO L290 TraceCheckUtils]: 105: Hoare triple {132674#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132699#(<= ~counter~0 12)} is VALID [2022-04-28 12:51:48,459 INFO L290 TraceCheckUtils]: 106: Hoare triple {132699#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {132699#(<= ~counter~0 12)} is VALID [2022-04-28 12:51:48,459 INFO L272 TraceCheckUtils]: 107: Hoare triple {132699#(<= ~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)); {132699#(<= ~counter~0 12)} is VALID [2022-04-28 12:51:48,460 INFO L290 TraceCheckUtils]: 108: Hoare triple {132699#(<= ~counter~0 12)} ~cond := #in~cond; {132699#(<= ~counter~0 12)} is VALID [2022-04-28 12:51:48,460 INFO L290 TraceCheckUtils]: 109: Hoare triple {132699#(<= ~counter~0 12)} assume !(0 == ~cond); {132699#(<= ~counter~0 12)} is VALID [2022-04-28 12:51:48,460 INFO L290 TraceCheckUtils]: 110: Hoare triple {132699#(<= ~counter~0 12)} assume true; {132699#(<= ~counter~0 12)} is VALID [2022-04-28 12:51:48,461 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132699#(<= ~counter~0 12)} {132699#(<= ~counter~0 12)} #96#return; {132699#(<= ~counter~0 12)} is VALID [2022-04-28 12:51:48,461 INFO L290 TraceCheckUtils]: 112: Hoare triple {132699#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132699#(<= ~counter~0 12)} is VALID [2022-04-28 12:51:48,462 INFO L290 TraceCheckUtils]: 113: Hoare triple {132699#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132724#(<= ~counter~0 13)} is VALID [2022-04-28 12:51:48,462 INFO L290 TraceCheckUtils]: 114: Hoare triple {132724#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {132724#(<= ~counter~0 13)} is VALID [2022-04-28 12:51:48,463 INFO L272 TraceCheckUtils]: 115: Hoare triple {132724#(<= ~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)); {132724#(<= ~counter~0 13)} is VALID [2022-04-28 12:51:48,463 INFO L290 TraceCheckUtils]: 116: Hoare triple {132724#(<= ~counter~0 13)} ~cond := #in~cond; {132724#(<= ~counter~0 13)} is VALID [2022-04-28 12:51:48,463 INFO L290 TraceCheckUtils]: 117: Hoare triple {132724#(<= ~counter~0 13)} assume !(0 == ~cond); {132724#(<= ~counter~0 13)} is VALID [2022-04-28 12:51:48,463 INFO L290 TraceCheckUtils]: 118: Hoare triple {132724#(<= ~counter~0 13)} assume true; {132724#(<= ~counter~0 13)} is VALID [2022-04-28 12:51:48,464 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132724#(<= ~counter~0 13)} {132724#(<= ~counter~0 13)} #96#return; {132724#(<= ~counter~0 13)} is VALID [2022-04-28 12:51:48,464 INFO L290 TraceCheckUtils]: 120: Hoare triple {132724#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132724#(<= ~counter~0 13)} is VALID [2022-04-28 12:51:48,465 INFO L290 TraceCheckUtils]: 121: Hoare triple {132724#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132749#(<= ~counter~0 14)} is VALID [2022-04-28 12:51:48,465 INFO L290 TraceCheckUtils]: 122: Hoare triple {132749#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {132749#(<= ~counter~0 14)} is VALID [2022-04-28 12:51:48,466 INFO L272 TraceCheckUtils]: 123: Hoare triple {132749#(<= ~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)); {132749#(<= ~counter~0 14)} is VALID [2022-04-28 12:51:48,466 INFO L290 TraceCheckUtils]: 124: Hoare triple {132749#(<= ~counter~0 14)} ~cond := #in~cond; {132749#(<= ~counter~0 14)} is VALID [2022-04-28 12:51:48,466 INFO L290 TraceCheckUtils]: 125: Hoare triple {132749#(<= ~counter~0 14)} assume !(0 == ~cond); {132749#(<= ~counter~0 14)} is VALID [2022-04-28 12:51:48,467 INFO L290 TraceCheckUtils]: 126: Hoare triple {132749#(<= ~counter~0 14)} assume true; {132749#(<= ~counter~0 14)} is VALID [2022-04-28 12:51:48,467 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132749#(<= ~counter~0 14)} {132749#(<= ~counter~0 14)} #96#return; {132749#(<= ~counter~0 14)} is VALID [2022-04-28 12:51:48,467 INFO L290 TraceCheckUtils]: 128: Hoare triple {132749#(<= ~counter~0 14)} assume !(~r~0 > 0); {132749#(<= ~counter~0 14)} is VALID [2022-04-28 12:51:48,469 INFO L290 TraceCheckUtils]: 129: Hoare triple {132749#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132774#(<= ~counter~0 15)} is VALID [2022-04-28 12:51:48,469 INFO L290 TraceCheckUtils]: 130: Hoare triple {132774#(<= ~counter~0 15)} assume !(#t~post8 < 50);havoc #t~post8; {132774#(<= ~counter~0 15)} is VALID [2022-04-28 12:51:48,469 INFO L290 TraceCheckUtils]: 131: Hoare triple {132774#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132781#(<= |main_#t~post6| 15)} is VALID [2022-04-28 12:51:48,469 INFO L290 TraceCheckUtils]: 132: Hoare triple {132781#(<= |main_#t~post6| 15)} assume !(#t~post6 < 50);havoc #t~post6; {132368#false} is VALID [2022-04-28 12:51:48,469 INFO L272 TraceCheckUtils]: 133: Hoare triple {132368#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132368#false} is VALID [2022-04-28 12:51:48,470 INFO L290 TraceCheckUtils]: 134: Hoare triple {132368#false} ~cond := #in~cond; {132368#false} is VALID [2022-04-28 12:51:48,470 INFO L290 TraceCheckUtils]: 135: Hoare triple {132368#false} assume 0 == ~cond; {132368#false} is VALID [2022-04-28 12:51:48,470 INFO L290 TraceCheckUtils]: 136: Hoare triple {132368#false} assume !false; {132368#false} is VALID [2022-04-28 12:51:48,470 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-28 12:51:48,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:51:49,350 INFO L290 TraceCheckUtils]: 136: Hoare triple {132368#false} assume !false; {132368#false} is VALID [2022-04-28 12:51:49,350 INFO L290 TraceCheckUtils]: 135: Hoare triple {132368#false} assume 0 == ~cond; {132368#false} is VALID [2022-04-28 12:51:49,350 INFO L290 TraceCheckUtils]: 134: Hoare triple {132368#false} ~cond := #in~cond; {132368#false} is VALID [2022-04-28 12:51:49,350 INFO L272 TraceCheckUtils]: 133: Hoare triple {132368#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132368#false} is VALID [2022-04-28 12:51:49,350 INFO L290 TraceCheckUtils]: 132: Hoare triple {132809#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {132368#false} is VALID [2022-04-28 12:51:49,351 INFO L290 TraceCheckUtils]: 131: Hoare triple {132813#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132809#(< |main_#t~post6| 50)} is VALID [2022-04-28 12:51:49,351 INFO L290 TraceCheckUtils]: 130: Hoare triple {132813#(< ~counter~0 50)} assume !(#t~post8 < 50);havoc #t~post8; {132813#(< ~counter~0 50)} is VALID [2022-04-28 12:51:49,353 INFO L290 TraceCheckUtils]: 129: Hoare triple {132820#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132813#(< ~counter~0 50)} is VALID [2022-04-28 12:51:49,353 INFO L290 TraceCheckUtils]: 128: Hoare triple {132820#(< ~counter~0 49)} assume !(~r~0 > 0); {132820#(< ~counter~0 49)} is VALID [2022-04-28 12:51:49,354 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132367#true} {132820#(< ~counter~0 49)} #96#return; {132820#(< ~counter~0 49)} is VALID [2022-04-28 12:51:49,354 INFO L290 TraceCheckUtils]: 126: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,354 INFO L290 TraceCheckUtils]: 125: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,354 INFO L290 TraceCheckUtils]: 124: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,354 INFO L272 TraceCheckUtils]: 123: Hoare triple {132820#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,354 INFO L290 TraceCheckUtils]: 122: Hoare triple {132820#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {132820#(< ~counter~0 49)} is VALID [2022-04-28 12:51:49,355 INFO L290 TraceCheckUtils]: 121: Hoare triple {132845#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132820#(< ~counter~0 49)} is VALID [2022-04-28 12:51:49,356 INFO L290 TraceCheckUtils]: 120: Hoare triple {132845#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132845#(< ~counter~0 48)} is VALID [2022-04-28 12:51:49,356 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132367#true} {132845#(< ~counter~0 48)} #96#return; {132845#(< ~counter~0 48)} is VALID [2022-04-28 12:51:49,356 INFO L290 TraceCheckUtils]: 118: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,356 INFO L290 TraceCheckUtils]: 117: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,356 INFO L290 TraceCheckUtils]: 116: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,356 INFO L272 TraceCheckUtils]: 115: Hoare triple {132845#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,357 INFO L290 TraceCheckUtils]: 114: Hoare triple {132845#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {132845#(< ~counter~0 48)} is VALID [2022-04-28 12:51:49,358 INFO L290 TraceCheckUtils]: 113: Hoare triple {132870#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132845#(< ~counter~0 48)} is VALID [2022-04-28 12:51:49,358 INFO L290 TraceCheckUtils]: 112: Hoare triple {132870#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132870#(< ~counter~0 47)} is VALID [2022-04-28 12:51:49,358 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132367#true} {132870#(< ~counter~0 47)} #96#return; {132870#(< ~counter~0 47)} is VALID [2022-04-28 12:51:49,358 INFO L290 TraceCheckUtils]: 110: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,359 INFO L290 TraceCheckUtils]: 109: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,359 INFO L290 TraceCheckUtils]: 108: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,359 INFO L272 TraceCheckUtils]: 107: Hoare triple {132870#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,359 INFO L290 TraceCheckUtils]: 106: Hoare triple {132870#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {132870#(< ~counter~0 47)} is VALID [2022-04-28 12:51:49,360 INFO L290 TraceCheckUtils]: 105: Hoare triple {132895#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132870#(< ~counter~0 47)} is VALID [2022-04-28 12:51:49,360 INFO L290 TraceCheckUtils]: 104: Hoare triple {132895#(< ~counter~0 46)} assume !!(0 != ~r~0); {132895#(< ~counter~0 46)} is VALID [2022-04-28 12:51:49,361 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132367#true} {132895#(< ~counter~0 46)} #94#return; {132895#(< ~counter~0 46)} is VALID [2022-04-28 12:51:49,361 INFO L290 TraceCheckUtils]: 102: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,361 INFO L290 TraceCheckUtils]: 101: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,361 INFO L290 TraceCheckUtils]: 100: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,361 INFO L272 TraceCheckUtils]: 99: Hoare triple {132895#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,361 INFO L290 TraceCheckUtils]: 98: Hoare triple {132895#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {132895#(< ~counter~0 46)} is VALID [2022-04-28 12:51:49,362 INFO L290 TraceCheckUtils]: 97: Hoare triple {132920#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132895#(< ~counter~0 46)} is VALID [2022-04-28 12:51:49,362 INFO L290 TraceCheckUtils]: 96: Hoare triple {132920#(< ~counter~0 45)} assume !(~r~0 < 0); {132920#(< ~counter~0 45)} is VALID [2022-04-28 12:51:49,363 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132367#true} {132920#(< ~counter~0 45)} #98#return; {132920#(< ~counter~0 45)} is VALID [2022-04-28 12:51:49,363 INFO L290 TraceCheckUtils]: 94: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,363 INFO L290 TraceCheckUtils]: 93: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,363 INFO L290 TraceCheckUtils]: 92: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,363 INFO L272 TraceCheckUtils]: 91: Hoare triple {132920#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,363 INFO L290 TraceCheckUtils]: 90: Hoare triple {132920#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {132920#(< ~counter~0 45)} is VALID [2022-04-28 12:51:49,364 INFO L290 TraceCheckUtils]: 89: Hoare triple {132945#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132920#(< ~counter~0 45)} is VALID [2022-04-28 12:51:49,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {132945#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132945#(< ~counter~0 44)} is VALID [2022-04-28 12:51:49,365 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132367#true} {132945#(< ~counter~0 44)} #98#return; {132945#(< ~counter~0 44)} is VALID [2022-04-28 12:51:49,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,365 INFO L290 TraceCheckUtils]: 85: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,365 INFO L290 TraceCheckUtils]: 84: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,365 INFO L272 TraceCheckUtils]: 83: Hoare triple {132945#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,366 INFO L290 TraceCheckUtils]: 82: Hoare triple {132945#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {132945#(< ~counter~0 44)} is VALID [2022-04-28 12:51:49,367 INFO L290 TraceCheckUtils]: 81: Hoare triple {132970#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132945#(< ~counter~0 44)} is VALID [2022-04-28 12:51:49,367 INFO L290 TraceCheckUtils]: 80: Hoare triple {132970#(< ~counter~0 43)} assume !(~r~0 > 0); {132970#(< ~counter~0 43)} is VALID [2022-04-28 12:51:49,367 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132367#true} {132970#(< ~counter~0 43)} #96#return; {132970#(< ~counter~0 43)} is VALID [2022-04-28 12:51:49,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,368 INFO L272 TraceCheckUtils]: 75: Hoare triple {132970#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {132970#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {132970#(< ~counter~0 43)} is VALID [2022-04-28 12:51:49,369 INFO L290 TraceCheckUtils]: 73: Hoare triple {132995#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132970#(< ~counter~0 43)} is VALID [2022-04-28 12:51:49,369 INFO L290 TraceCheckUtils]: 72: Hoare triple {132995#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132995#(< ~counter~0 42)} is VALID [2022-04-28 12:51:49,370 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132367#true} {132995#(< ~counter~0 42)} #96#return; {132995#(< ~counter~0 42)} is VALID [2022-04-28 12:51:49,370 INFO L290 TraceCheckUtils]: 70: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,370 INFO L290 TraceCheckUtils]: 69: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,370 INFO L272 TraceCheckUtils]: 67: Hoare triple {132995#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {132995#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {132995#(< ~counter~0 42)} is VALID [2022-04-28 12:51:49,371 INFO L290 TraceCheckUtils]: 65: Hoare triple {133020#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132995#(< ~counter~0 42)} is VALID [2022-04-28 12:51:49,371 INFO L290 TraceCheckUtils]: 64: Hoare triple {133020#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133020#(< ~counter~0 41)} is VALID [2022-04-28 12:51:49,372 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132367#true} {133020#(< ~counter~0 41)} #96#return; {133020#(< ~counter~0 41)} is VALID [2022-04-28 12:51:49,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,372 INFO L272 TraceCheckUtils]: 59: Hoare triple {133020#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {133020#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {133020#(< ~counter~0 41)} is VALID [2022-04-28 12:51:49,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {133045#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133020#(< ~counter~0 41)} is VALID [2022-04-28 12:51:49,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {133045#(< ~counter~0 40)} assume !!(0 != ~r~0); {133045#(< ~counter~0 40)} is VALID [2022-04-28 12:51:49,374 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132367#true} {133045#(< ~counter~0 40)} #94#return; {133045#(< ~counter~0 40)} is VALID [2022-04-28 12:51:49,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,374 INFO L272 TraceCheckUtils]: 51: Hoare triple {133045#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {133045#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {133045#(< ~counter~0 40)} is VALID [2022-04-28 12:51:49,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {133070#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133045#(< ~counter~0 40)} is VALID [2022-04-28 12:51:49,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {133070#(< ~counter~0 39)} assume !(~r~0 < 0); {133070#(< ~counter~0 39)} is VALID [2022-04-28 12:51:49,376 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132367#true} {133070#(< ~counter~0 39)} #98#return; {133070#(< ~counter~0 39)} is VALID [2022-04-28 12:51:49,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,377 INFO L290 TraceCheckUtils]: 44: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,377 INFO L272 TraceCheckUtils]: 43: Hoare triple {133070#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {133070#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {133070#(< ~counter~0 39)} is VALID [2022-04-28 12:51:49,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {133095#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133070#(< ~counter~0 39)} is VALID [2022-04-28 12:51:49,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {133095#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133095#(< ~counter~0 38)} is VALID [2022-04-28 12:51:49,379 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132367#true} {133095#(< ~counter~0 38)} #98#return; {133095#(< ~counter~0 38)} is VALID [2022-04-28 12:51:49,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,379 INFO L272 TraceCheckUtils]: 35: Hoare triple {133095#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {133095#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {133095#(< ~counter~0 38)} is VALID [2022-04-28 12:51:49,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {133120#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133095#(< ~counter~0 38)} is VALID [2022-04-28 12:51:49,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {133120#(< ~counter~0 37)} assume !(~r~0 > 0); {133120#(< ~counter~0 37)} is VALID [2022-04-28 12:51:49,381 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132367#true} {133120#(< ~counter~0 37)} #96#return; {133120#(< ~counter~0 37)} is VALID [2022-04-28 12:51:49,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,381 INFO L272 TraceCheckUtils]: 27: Hoare triple {133120#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {133120#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {133120#(< ~counter~0 37)} is VALID [2022-04-28 12:51:49,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {133145#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133120#(< ~counter~0 37)} is VALID [2022-04-28 12:51:49,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {133145#(< ~counter~0 36)} assume !!(0 != ~r~0); {133145#(< ~counter~0 36)} is VALID [2022-04-28 12:51:49,383 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132367#true} {133145#(< ~counter~0 36)} #94#return; {133145#(< ~counter~0 36)} is VALID [2022-04-28 12:51:49,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,383 INFO L272 TraceCheckUtils]: 19: Hoare triple {133145#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {133145#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {133145#(< ~counter~0 36)} is VALID [2022-04-28 12:51:49,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {133170#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133145#(< ~counter~0 36)} is VALID [2022-04-28 12:51:49,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {133170#(< ~counter~0 35)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {133170#(< ~counter~0 35)} is VALID [2022-04-28 12:51:49,385 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132367#true} {133170#(< ~counter~0 35)} #92#return; {133170#(< ~counter~0 35)} is VALID [2022-04-28 12:51:49,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,385 INFO L272 TraceCheckUtils]: 11: Hoare triple {133170#(< ~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)); {132367#true} is VALID [2022-04-28 12:51:49,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132367#true} {133170#(< ~counter~0 35)} #90#return; {133170#(< ~counter~0 35)} is VALID [2022-04-28 12:51:49,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {132367#true} assume true; {132367#true} is VALID [2022-04-28 12:51:49,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {132367#true} assume !(0 == ~cond); {132367#true} is VALID [2022-04-28 12:51:49,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {132367#true} ~cond := #in~cond; {132367#true} is VALID [2022-04-28 12:51:49,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {133170#(< ~counter~0 35)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132367#true} is VALID [2022-04-28 12:51:49,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {133170#(< ~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; {133170#(< ~counter~0 35)} is VALID [2022-04-28 12:51:49,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {133170#(< ~counter~0 35)} call #t~ret9 := main(); {133170#(< ~counter~0 35)} is VALID [2022-04-28 12:51:49,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133170#(< ~counter~0 35)} {132367#true} #102#return; {133170#(< ~counter~0 35)} is VALID [2022-04-28 12:51:49,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {133170#(< ~counter~0 35)} assume true; {133170#(< ~counter~0 35)} is VALID [2022-04-28 12:51:49,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {132367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {133170#(< ~counter~0 35)} is VALID [2022-04-28 12:51:49,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {132367#true} call ULTIMATE.init(); {132367#true} is VALID [2022-04-28 12:51:49,388 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-28 12:51:49,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:51:49,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636820654] [2022-04-28 12:51:49,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:51:49,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838940900] [2022-04-28 12:51:49,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838940900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:51:49,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:51:49,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-28 12:51:49,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:51:49,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285220270] [2022-04-28 12:51:49,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285220270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:51:49,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:51:49,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 12:51:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63947180] [2022-04-28 12:51:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:51:49,389 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-28 12:51:49,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:51:49,389 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-28 12:51:49,519 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-28 12:51:49,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 12:51:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:51:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 12:51:49,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 12:51:49,520 INFO L87 Difference]: Start difference. First operand 762 states and 995 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-28 12:51:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:51:53,238 INFO L93 Difference]: Finished difference Result 866 states and 1137 transitions. [2022-04-28 12:51:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 12:51:53,238 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-28 12:51:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:51:53,238 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-28 12:51:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 12:51:53,240 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-28 12:51:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 12:51:53,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-28 12:51:53,574 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-28 12:51:53,604 INFO L225 Difference]: With dead ends: 866 [2022-04-28 12:51:53,604 INFO L226 Difference]: Without dead ends: 861 [2022-04-28 12:51:53,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=953, Invalid=1303, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 12:51:53,606 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 306 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 12:51:53,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 341 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 12:51:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-04-28 12:51:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 834. [2022-04-28 12:51:56,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:51:56,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 861 states. Second operand has 834 states, 623 states have (on average 1.189406099518459) internal successors, (741), 641 states have internal predecessors, (741), 178 states have call successors, (178), 34 states have call predecessors, (178), 32 states have return successors, (176), 158 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-28 12:51:56,318 INFO L74 IsIncluded]: Start isIncluded. First operand 861 states. Second operand has 834 states, 623 states have (on average 1.189406099518459) internal successors, (741), 641 states have internal predecessors, (741), 178 states have call successors, (178), 34 states have call predecessors, (178), 32 states have return successors, (176), 158 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-28 12:51:56,319 INFO L87 Difference]: Start difference. First operand 861 states. Second operand has 834 states, 623 states have (on average 1.189406099518459) internal successors, (741), 641 states have internal predecessors, (741), 178 states have call successors, (178), 34 states have call predecessors, (178), 32 states have return successors, (176), 158 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-28 12:51:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:51:56,341 INFO L93 Difference]: Finished difference Result 861 states and 1126 transitions. [2022-04-28 12:51:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1126 transitions. [2022-04-28 12:51:56,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:51:56,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:51:56,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 834 states, 623 states have (on average 1.189406099518459) internal successors, (741), 641 states have internal predecessors, (741), 178 states have call successors, (178), 34 states have call predecessors, (178), 32 states have return successors, (176), 158 states have call predecessors, (176), 176 states have call successors, (176) Second operand 861 states. [2022-04-28 12:51:56,343 INFO L87 Difference]: Start difference. First operand has 834 states, 623 states have (on average 1.189406099518459) internal successors, (741), 641 states have internal predecessors, (741), 178 states have call successors, (178), 34 states have call predecessors, (178), 32 states have return successors, (176), 158 states have call predecessors, (176), 176 states have call successors, (176) Second operand 861 states. [2022-04-28 12:51:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:51:56,366 INFO L93 Difference]: Finished difference Result 861 states and 1126 transitions. [2022-04-28 12:51:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1126 transitions. [2022-04-28 12:51:56,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:51:56,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:51:56,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:51:56,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:51:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 623 states have (on average 1.189406099518459) internal successors, (741), 641 states have internal predecessors, (741), 178 states have call successors, (178), 34 states have call predecessors, (178), 32 states have return successors, (176), 158 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-28 12:51:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1095 transitions. [2022-04-28 12:51:56,396 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1095 transitions. Word has length 137 [2022-04-28 12:51:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:51:56,397 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1095 transitions. [2022-04-28 12:51:56,397 INFO L496 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-28 12:51:56,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 834 states and 1095 transitions.