/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:16:34,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:16:34,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:16:34,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:16:34,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:16:34,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:16:34,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:16:34,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:16:34,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:16:34,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:16:34,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:16:34,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:16:34,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:16:34,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:16:34,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:16:34,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:16:34,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:16:34,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:16:34,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:16:34,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:16:34,173 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:16:34,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:16:34,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:16:34,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:16:34,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:16:34,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:16:34,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:16:34,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:16:34,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:16:34,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:16:34,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:16:34,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:16:34,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:16:34,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:16:34,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:16:34,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:16:34,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:16:34,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:16:34,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:16:34,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:16:34,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:16:34,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:16:34,188 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:16:34,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:16:34,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:16:34,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:16:34,209 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:16:34,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:16:34,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:16:34,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:16:34,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:16:34,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:16:34,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:16:34,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:34,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:16:34,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:16:34,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:16:34,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 13:16:34,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:16:34,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:16:34,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:16:34,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:16:34,413 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:16:34,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2022-04-27 13:16:34,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86081562d/5ecb03085bb34a228e97b9b57ade4ef7/FLAG28639288f [2022-04-27 13:16:34,785 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:16:34,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2022-04-27 13:16:34,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86081562d/5ecb03085bb34a228e97b9b57ade4ef7/FLAG28639288f [2022-04-27 13:16:35,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86081562d/5ecb03085bb34a228e97b9b57ade4ef7 [2022-04-27 13:16:35,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:16:35,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:16:35,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:35,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:16:35,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:16:35,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ec22ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35, skipping insertion in model container [2022-04-27 13:16:35,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:16:35,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:16:35,364 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_unwindbound20.c[535,548] [2022-04-27 13:16:35,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:35,400 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:16:35,411 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_unwindbound20.c[535,548] [2022-04-27 13:16:35,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:35,436 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:16:35,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35 WrapperNode [2022-04-27 13:16:35,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:35,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:16:35,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:16:35,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:16:35,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:16:35,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:16:35,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:16:35,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:16:35,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (1/1) ... [2022-04-27 13:16:35,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:35,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:35,516 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-27 13:16:35,534 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-27 13:16:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:16:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:16:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:16:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:16:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:16:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:16:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:16:35,599 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:16:35,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:16:35,758 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:16:35,763 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:16:35,763 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:16:35,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:35 BoogieIcfgContainer [2022-04-27 13:16:35,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:16:35,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:16:35,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:16:35,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:16:35,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:16:35" (1/3) ... [2022-04-27 13:16:35,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f0925f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:35, skipping insertion in model container [2022-04-27 13:16:35,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:35" (2/3) ... [2022-04-27 13:16:35,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f0925f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:35, skipping insertion in model container [2022-04-27 13:16:35,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:35" (3/3) ... [2022-04-27 13:16:35,770 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound20.c [2022-04-27 13:16:35,783 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:16:35,783 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:16:35,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:16:35,832 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@4202475f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68bb25bd [2022-04-27 13:16:35,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:16:35,838 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-27 13:16:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:16:35,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:35,843 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-27 13:16:35,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-27 13:16:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:35,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289418899] [2022-04-27 13:16:35,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:35,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:35,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394847998] [2022-04-27 13:16:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:35,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:35,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:35,928 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-27 13:16:35,928 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-27 13:16:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:35,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:16:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:35,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:36,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-27 13:16:36,103 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-27 13:16:36,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:16:36,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-27 13:16:36,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-27 13:16:36,104 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-27 13:16:36,104 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-27 13:16:36,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:36,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:36,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:36,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-27 13:16:36,107 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {41#false} is VALID [2022-04-27 13:16:36,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:36,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:36,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:36,108 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-27 13:16:36,108 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-27 13:16:36,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:16:36,108 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-27 13:16:36,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:36,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:16:36,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:16:36,109 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-27 13:16:36,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:36,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289418899] [2022-04-27 13:16:36,110 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:36,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394847998] [2022-04-27 13:16:36,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394847998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:36,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:36,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:16:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709123246] [2022-04-27 13:16:36,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:36,115 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), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:16:36,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:36,118 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), 2 states have call successors, (3) [2022-04-27 13:16:36,166 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-27 13:16:36,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:16:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:16:36,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:16:36,187 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), 2 states have call successors, (3) [2022-04-27 13:16:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:36,241 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-27 13:16:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:16:36,241 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), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:16:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:36,242 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), 2 states have call successors, (3) [2022-04-27 13:16:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:16:36,249 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), 2 states have call successors, (3) [2022-04-27 13:16:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:16:36,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-27 13:16:36,359 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-27 13:16:36,365 INFO L225 Difference]: With dead ends: 67 [2022-04-27 13:16:36,365 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:16:36,367 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-27 13:16:36,369 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-27 13:16:36,369 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-27 13:16:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:16:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:16:36,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:36,388 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-27 13:16:36,388 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-27 13:16:36,389 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-27 13:16:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:36,392 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:16:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:36,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:36,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:36,393 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-27 13:16:36,393 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-27 13:16:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:36,396 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:16:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:36,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:36,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:36,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:36,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:36,397 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-27 13:16:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:16:36,399 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-27 13:16:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:36,400 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:16:36,400 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), 2 states have call successors, (3) [2022-04-27 13:16:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:16:36,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:36,401 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-27 13:16:36,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 13:16:36,608 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-27 13:16:36,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-27 13:16:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349862814] [2022-04-27 13:16:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:36,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:36,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604949096] [2022-04-27 13:16:36,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:36,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:36,639 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-27 13:16:36,640 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-27 13:16:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:36,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:16:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:36,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:36,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-27 13:16:36,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(<= ~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; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {315#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,859 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,860 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(<= ~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)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,861 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:36,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {364#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:16:36,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {308#false} is VALID [2022-04-27 13:16:36,862 INFO L272 TraceCheckUtils]: 19: Hoare triple {308#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {308#false} is VALID [2022-04-27 13:16:36,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-27 13:16:36,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-27 13:16:36,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-27 13:16:36,863 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-27 13:16:36,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:36,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:36,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349862814] [2022-04-27 13:16:36,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:36,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604949096] [2022-04-27 13:16:36,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604949096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:36,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:36,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:16:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245226652] [2022-04-27 13:16:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:36,866 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-27 13:16:36,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:36,867 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-27 13:16:36,882 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-27 13:16:36,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:16:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:36,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:16:36,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:36,883 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-27 13:16:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:36,958 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 13:16:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:16:36,959 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-27 13:16:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:36,959 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-27 13:16:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:16:36,968 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-27 13:16:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:16:36,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-27 13:16:37,004 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-27 13:16:37,008 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:16:37,008 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:16:37,008 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-27 13:16:37,011 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-27 13:16:37,012 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-27 13:16:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:16:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 13:16:37,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:37,025 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-27 13:16:37,025 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-27 13:16:37,027 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-27 13:16:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:37,032 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:16:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:37,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:37,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:37,034 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-27 13:16:37,035 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-27 13:16:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:37,042 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:16:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:37,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:37,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:37,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:37,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:37,046 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-27 13:16:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-27 13:16:37,047 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-27 13:16:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:37,048 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-27 13:16:37,048 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-27 13:16:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:16:37,048 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:37,048 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-27 13:16:37,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:37,249 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-27 13:16:37,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:37,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-27 13:16:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:37,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774253428] [2022-04-27 13:16:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:37,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:37,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027154572] [2022-04-27 13:16:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:37,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:37,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:37,266 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-27 13:16:37,267 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-27 13:16:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:37,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:16:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-27 13:16:45,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:46,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-27 13:16:46,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#true} is VALID [2022-04-27 13:16:46,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:46,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-27 13:16:46,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-27 13:16:46,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {554#true} is VALID [2022-04-27 13:16:46,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {554#true} is VALID [2022-04-27 13:16:46,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:46,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:46,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:46,153 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-27 13:16:46,153 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {554#true} is VALID [2022-04-27 13:16:46,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:46,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:46,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:46,153 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-27 13:16:47,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:16:47,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:16:47,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:16:48,271 INFO L272 TraceCheckUtils]: 19: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:16:48,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:48,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-27 13:16:48,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-27 13:16:48,277 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-27 13:16:48,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:48,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774253428] [2022-04-27 13:16:48,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027154572] [2022-04-27 13:16:48,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027154572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:48,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:48,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708331657] [2022-04-27 13:16:48,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:48,279 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-27 13:16:48,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:48,279 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-27 13:16:50,687 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-27 13:16:50,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:50,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:50,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:50,689 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-27 13:16:53,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:16:58,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:00,782 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-27 13:17:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:00,831 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:17:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:00,831 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-27 13:17:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:00,832 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-27 13:17:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:17:00,833 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-27 13:17:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:17:00,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-27 13:17:03,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:03,920 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:17:03,921 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:17:03,921 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-27 13:17:03,922 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:03,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-04-27 13:17:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:17:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:17:03,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:03,937 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-27 13:17:03,938 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-27 13:17:03,938 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-27 13:17:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:03,940 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:17:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:17:03,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:03,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:03,941 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-27 13:17:03,941 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-27 13:17:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:03,943 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:17:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:17:03,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:03,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:03,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:03,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:03,944 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-27 13:17:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-27 13:17:03,946 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-27 13:17:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:03,946 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-27 13:17:03,947 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-27 13:17:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-27 13:17:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:17:03,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:03,947 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-27 13:17:03,963 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-27 13:17:04,147 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-27 13:17:04,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-27 13:17:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:04,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680900391] [2022-04-27 13:17:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:04,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:04,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856332048] [2022-04-27 13:17:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:04,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:04,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:04,172 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-27 13:17:04,173 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-27 13:17:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:04,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:17:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:04,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:04,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:17:04,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {877#true} is VALID [2022-04-27 13:17:04,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:04,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:17:04,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:17:04,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#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; {877#true} is VALID [2022-04-27 13:17:04,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:17:04,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:04,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:04,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:04,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:17:04,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:04,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:04,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:04,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:04,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:17:04,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:17:04,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:17:04,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 20);havoc #t~post6; {877#true} is VALID [2022-04-27 13:17:04,383 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:04,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:04,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:04,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:04,385 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {953#(= (+ (* 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-27 13:17:04,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {953#(= (+ (* 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); {957#(= (+ (* 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-27 13:17:04,386 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* 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)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:04,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:04,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:17:04,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:17:04,387 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-27 13:17:04,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:04,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:17:04,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:17:04,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:04,782 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* 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)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:04,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {984#(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); {957#(= (+ (* 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-27 13:17:04,784 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {984#(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-27 13:17:04,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:04,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:04,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:17:04,788 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:04,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 20);havoc #t~post6; {877#true} is VALID [2022-04-27 13:17:04,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:17:04,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:17:04,789 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:17:04,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:04,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:04,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:04,789 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:04,789 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:17:04,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:04,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:04,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:04,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:17:04,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#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; {877#true} is VALID [2022-04-27 13:17:04,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:17:04,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:17:04,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:04,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {877#true} is VALID [2022-04-27 13:17:04,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:17:04,790 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-27 13:17:04,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:04,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680900391] [2022-04-27 13:17:04,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:04,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856332048] [2022-04-27 13:17:04,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856332048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:04,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:04,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:17:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136853003] [2022-04-27 13:17:04,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:17:04,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:04,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:04,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:04,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:17:04,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:04,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:17:04,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:04,810 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:05,197 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-27 13:17:05,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:17:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:17:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:17:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:17:05,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 13:17:05,245 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-27 13:17:05,246 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:17:05,246 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 13:17:05,246 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-27 13:17:05,247 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:05,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:17:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 13:17:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-27 13:17:05,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:05,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:05,254 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:05,255 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:05,256 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:17:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:17:05,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:05,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:05,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-27 13:17:05,257 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-27 13:17:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:05,261 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:17:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:17:05,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:05,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:05,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:05,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-27 13:17:05,262 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-27 13:17:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:05,262 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-27 13:17:05,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 13:17:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 13:17:05,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:05,263 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-27 13:17:05,284 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-27 13:17:05,464 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-27 13:17:05,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-27 13:17:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:05,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472801404] [2022-04-27 13:17:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:05,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:05,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573863346] [2022-04-27 13:17:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:05,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:05,476 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-27 13:17:05,477 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-27 13:17:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:05,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:17:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:05,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:05,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {1302#true} call ULTIMATE.init(); {1302#true} is VALID [2022-04-27 13:17:05,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {1302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1310#(<= ~counter~0 0)} {1302#true} #102#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {1310#(<= ~counter~0 0)} call #t~ret9 := main(); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {1310#(<= ~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; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {1310#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #90#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {1310#(<= ~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)); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,671 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #92#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {1310#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:05,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {1310#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:05,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {1359#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:05,672 INFO L272 TraceCheckUtils]: 19: Hoare triple {1359#(<= ~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)); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:05,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {1359#(<= ~counter~0 1)} ~cond := #in~cond; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:05,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {1359#(<= ~counter~0 1)} assume !(0 == ~cond); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:05,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {1359#(<= ~counter~0 1)} assume true; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:05,674 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1359#(<= ~counter~0 1)} {1359#(<= ~counter~0 1)} #94#return; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:05,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {1359#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:05,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {1359#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1384#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:17:05,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {1384#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1303#false} is VALID [2022-04-27 13:17:05,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {1303#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1303#false} is VALID [2022-04-27 13:17:05,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {1303#false} assume !(#t~post8 < 20);havoc #t~post8; {1303#false} is VALID [2022-04-27 13:17:05,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {1303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1303#false} is VALID [2022-04-27 13:17:05,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {1303#false} assume !(#t~post6 < 20);havoc #t~post6; {1303#false} is VALID [2022-04-27 13:17:05,675 INFO L272 TraceCheckUtils]: 31: Hoare triple {1303#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1303#false} is VALID [2022-04-27 13:17:05,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {1303#false} ~cond := #in~cond; {1303#false} is VALID [2022-04-27 13:17:05,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {1303#false} assume 0 == ~cond; {1303#false} is VALID [2022-04-27 13:17:05,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {1303#false} assume !false; {1303#false} is VALID [2022-04-27 13:17:05,675 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-27 13:17:05,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:05,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472801404] [2022-04-27 13:17:05,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:05,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573863346] [2022-04-27 13:17:05,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573863346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:05,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:05,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:17:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812168764] [2022-04-27 13:17:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:05,676 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-27 13:17:05,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:05,677 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-27 13:17:05,695 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-27 13:17:05,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:17:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:17:05,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:05,696 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:17:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:05,793 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-27 13:17:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:05,793 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-27 13:17:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:05,794 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-27 13:17:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:17:05,795 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-27 13:17:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:17:05,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 13:17:05,842 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-27 13:17:05,843 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:17:05,843 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:17:05,843 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-27 13:17:05,844 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:05,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:17:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 13:17:05,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:05,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:05,855 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:05,855 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:05,857 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 13:17:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:05,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:05,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:05,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:17:05,857 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:17:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:05,858 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 13:17:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:05,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:05,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:05,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:05,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-27 13:17:05,860 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-27 13:17:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:05,860 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-27 13:17:05,860 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-27 13:17:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 13:17:05,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:05,861 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-27 13:17:05,879 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-27 13:17:06,075 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-27 13:17:06,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:06,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-27 13:17:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:06,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033000394] [2022-04-27 13:17:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:06,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:06,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978456868] [2022-04-27 13:17:06,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:06,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:06,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:06,087 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:06,088 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-27 13:17:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:06,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:17:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:06,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:06,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-27 13:17:06,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1662#(<= ~counter~0 0)} {1654#true} #102#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {1662#(<= ~counter~0 0)} call #t~ret9 := main(); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {1662#(<= ~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; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {1662#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,292 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #90#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {1662#(<= ~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)); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,294 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #92#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {1662#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {1662#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {1711#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,295 INFO L272 TraceCheckUtils]: 19: Hoare triple {1711#(<= ~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)); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {1711#(<= ~counter~0 1)} ~cond := #in~cond; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {1711#(<= ~counter~0 1)} assume !(0 == ~cond); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {1711#(<= ~counter~0 1)} assume true; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,296 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1711#(<= ~counter~0 1)} {1711#(<= ~counter~0 1)} #94#return; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {1711#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {1711#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:06,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {1736#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:06,300 INFO L272 TraceCheckUtils]: 27: Hoare triple {1736#(<= ~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)); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:06,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(<= ~counter~0 2)} ~cond := #in~cond; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:06,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(<= ~counter~0 2)} assume !(0 == ~cond); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:06,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {1736#(<= ~counter~0 2)} assume true; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:06,301 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1736#(<= ~counter~0 2)} {1736#(<= ~counter~0 2)} #96#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:06,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {1736#(<= ~counter~0 2)} assume !(~r~0 > 0); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:06,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {1736#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1761#(<= |main_#t~post8| 2)} is VALID [2022-04-27 13:17:06,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(<= |main_#t~post8| 2)} assume !(#t~post8 < 20);havoc #t~post8; {1655#false} is VALID [2022-04-27 13:17:06,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-27 13:17:06,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 20);havoc #t~post6; {1655#false} is VALID [2022-04-27 13:17:06,303 INFO L272 TraceCheckUtils]: 37: Hoare triple {1655#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1655#false} is VALID [2022-04-27 13:17:06,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-27 13:17:06,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-27 13:17:06,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-27 13:17:06,303 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-27 13:17:06,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:06,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-27 13:17:06,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-27 13:17:06,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-27 13:17:06,503 INFO L272 TraceCheckUtils]: 37: Hoare triple {1655#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1655#false} is VALID [2022-04-27 13:17:06,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 20);havoc #t~post6; {1655#false} is VALID [2022-04-27 13:17:06,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-27 13:17:06,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {1801#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {1655#false} is VALID [2022-04-27 13:17:06,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {1805#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1801#(< |main_#t~post8| 20)} is VALID [2022-04-27 13:17:06,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {1805#(< ~counter~0 20)} assume !(~r~0 > 0); {1805#(< ~counter~0 20)} is VALID [2022-04-27 13:17:06,505 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1805#(< ~counter~0 20)} #96#return; {1805#(< ~counter~0 20)} is VALID [2022-04-27 13:17:06,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:06,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:06,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:06,505 INFO L272 TraceCheckUtils]: 27: Hoare triple {1805#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:06,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {1805#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {1805#(< ~counter~0 20)} is VALID [2022-04-27 13:17:06,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {1830#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1805#(< ~counter~0 20)} is VALID [2022-04-27 13:17:06,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#(< ~counter~0 19)} assume !!(0 != ~r~0); {1830#(< ~counter~0 19)} is VALID [2022-04-27 13:17:06,507 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1654#true} {1830#(< ~counter~0 19)} #94#return; {1830#(< ~counter~0 19)} is VALID [2022-04-27 13:17:06,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:06,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:06,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:06,507 INFO L272 TraceCheckUtils]: 19: Hoare triple {1830#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:06,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {1830#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {1830#(< ~counter~0 19)} is VALID [2022-04-27 13:17:06,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {1855#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1830#(< ~counter~0 19)} is VALID [2022-04-27 13:17:06,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {1855#(< ~counter~0 18)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1855#(< ~counter~0 18)} is VALID [2022-04-27 13:17:06,508 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1654#true} {1855#(< ~counter~0 18)} #92#return; {1855#(< ~counter~0 18)} is VALID [2022-04-27 13:17:06,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:06,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:06,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:06,509 INFO L272 TraceCheckUtils]: 11: Hoare triple {1855#(< ~counter~0 18)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:06,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1654#true} {1855#(< ~counter~0 18)} #90#return; {1855#(< ~counter~0 18)} is VALID [2022-04-27 13:17:06,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:06,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:06,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:06,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {1855#(< ~counter~0 18)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:06,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#(< ~counter~0 18)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1855#(< ~counter~0 18)} is VALID [2022-04-27 13:17:06,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#(< ~counter~0 18)} call #t~ret9 := main(); {1855#(< ~counter~0 18)} is VALID [2022-04-27 13:17:06,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#(< ~counter~0 18)} {1654#true} #102#return; {1855#(< ~counter~0 18)} is VALID [2022-04-27 13:17:06,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#(< ~counter~0 18)} assume true; {1855#(< ~counter~0 18)} is VALID [2022-04-27 13:17:06,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1855#(< ~counter~0 18)} is VALID [2022-04-27 13:17:06,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-27 13:17:06,512 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-27 13:17:06,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:06,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033000394] [2022-04-27 13:17:06,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:06,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978456868] [2022-04-27 13:17:06,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978456868] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:17:06,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:17:06,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-27 13:17:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236838236] [2022-04-27 13:17:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:06,513 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-27 13:17:06,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:06,513 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-27 13:17:06,539 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-27 13:17:06,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:17:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:06,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:17:06,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:06,539 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:17:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:06,661 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-27 13:17:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:17:06,661 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-27 13:17:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:06,662 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-27 13:17:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:17:06,663 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-27 13:17:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:17:06,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-27 13:17:06,719 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-27 13:17:06,720 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:17:06,720 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 13:17:06,721 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-27 13:17:06,721 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:06,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 13:17:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-27 13:17:06,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:06,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:06,736 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:06,736 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:06,738 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 13:17:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 13:17:06,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:06,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:06,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 13:17:06,738 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 13:17:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:06,739 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 13:17:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 13:17:06,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:06,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:06,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:06,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-27 13:17:06,741 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-27 13:17:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:06,741 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-27 13:17:06,742 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-27 13:17:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-27 13:17:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:17:06,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:06,742 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-27 13:17:06,758 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-27 13:17:06,955 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-27 13:17:06,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:06,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-27 13:17:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:06,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513742036] [2022-04-27 13:17:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:06,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:06,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:06,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689632178] [2022-04-27 13:17:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:06,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:06,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:06,977 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-27 13:17:06,978 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-27 13:17:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:07,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:17:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:07,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:07,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2022-04-27 13:17:07,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {2192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2200#(<= ~counter~0 0)} {2192#true} #102#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {2200#(<= ~counter~0 0)} call #t~ret9 := main(); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {2200#(<= ~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; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {2200#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {2200#(<= ~counter~0 0)} ~cond := #in~cond; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {2200#(<= ~counter~0 0)} assume !(0 == ~cond); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2200#(<= ~counter~0 0)} {2200#(<= ~counter~0 0)} #90#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {2200#(<= ~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)); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {2200#(<= ~counter~0 0)} ~cond := #in~cond; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {2200#(<= ~counter~0 0)} assume !(0 == ~cond); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,246 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2200#(<= ~counter~0 0)} {2200#(<= ~counter~0 0)} #92#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {2200#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {2200#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {2249#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,247 INFO L272 TraceCheckUtils]: 19: Hoare triple {2249#(<= ~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)); {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {2249#(<= ~counter~0 1)} ~cond := #in~cond; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {2249#(<= ~counter~0 1)} assume !(0 == ~cond); {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {2249#(<= ~counter~0 1)} assume true; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,248 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2249#(<= ~counter~0 1)} {2249#(<= ~counter~0 1)} #94#return; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {2249#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {2249#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {2274#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,249 INFO L272 TraceCheckUtils]: 27: Hoare triple {2274#(<= ~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)); {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {2274#(<= ~counter~0 2)} ~cond := #in~cond; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {2274#(<= ~counter~0 2)} assume !(0 == ~cond); {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {2274#(<= ~counter~0 2)} assume true; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,250 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2274#(<= ~counter~0 2)} {2274#(<= ~counter~0 2)} #96#return; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {2274#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {2274#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2299#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:17:07,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {2299#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {2193#false} is VALID [2022-04-27 13:17:07,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2193#false} is VALID [2022-04-27 13:17:07,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#false} assume !(#t~post8 < 20);havoc #t~post8; {2193#false} is VALID [2022-04-27 13:17:07,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2193#false} is VALID [2022-04-27 13:17:07,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#false} assume !(#t~post6 < 20);havoc #t~post6; {2193#false} is VALID [2022-04-27 13:17:07,251 INFO L272 TraceCheckUtils]: 39: Hoare triple {2193#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2193#false} is VALID [2022-04-27 13:17:07,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#false} ~cond := #in~cond; {2193#false} is VALID [2022-04-27 13:17:07,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#false} assume 0 == ~cond; {2193#false} is VALID [2022-04-27 13:17:07,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2022-04-27 13:17:07,252 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-27 13:17:07,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:07,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2022-04-27 13:17:07,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#false} assume 0 == ~cond; {2193#false} is VALID [2022-04-27 13:17:07,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#false} ~cond := #in~cond; {2193#false} is VALID [2022-04-27 13:17:07,404 INFO L272 TraceCheckUtils]: 39: Hoare triple {2193#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2193#false} is VALID [2022-04-27 13:17:07,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#false} assume !(#t~post6 < 20);havoc #t~post6; {2193#false} is VALID [2022-04-27 13:17:07,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2193#false} is VALID [2022-04-27 13:17:07,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#false} assume !(#t~post8 < 20);havoc #t~post8; {2193#false} is VALID [2022-04-27 13:17:07,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2193#false} is VALID [2022-04-27 13:17:07,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {2351#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {2193#false} is VALID [2022-04-27 13:17:07,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {2355#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2351#(< |main_#t~post7| 20)} is VALID [2022-04-27 13:17:07,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {2355#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2355#(< ~counter~0 20)} is VALID [2022-04-27 13:17:07,406 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2192#true} {2355#(< ~counter~0 20)} #96#return; {2355#(< ~counter~0 20)} is VALID [2022-04-27 13:17:07,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:17:07,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:17:07,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:17:07,406 INFO L272 TraceCheckUtils]: 27: Hoare triple {2355#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2192#true} is VALID [2022-04-27 13:17:07,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {2355#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {2355#(< ~counter~0 20)} is VALID [2022-04-27 13:17:07,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2355#(< ~counter~0 20)} is VALID [2022-04-27 13:17:07,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {2380#(< ~counter~0 19)} assume !!(0 != ~r~0); {2380#(< ~counter~0 19)} is VALID [2022-04-27 13:17:07,407 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2192#true} {2380#(< ~counter~0 19)} #94#return; {2380#(< ~counter~0 19)} is VALID [2022-04-27 13:17:07,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:17:07,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:17:07,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:17:07,408 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2192#true} is VALID [2022-04-27 13:17:07,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {2380#(< ~counter~0 19)} is VALID [2022-04-27 13:17:07,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {2405#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(< ~counter~0 19)} is VALID [2022-04-27 13:17:07,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {2405#(< ~counter~0 18)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2405#(< ~counter~0 18)} is VALID [2022-04-27 13:17:07,410 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2192#true} {2405#(< ~counter~0 18)} #92#return; {2405#(< ~counter~0 18)} is VALID [2022-04-27 13:17:07,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:17:07,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:17:07,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:17:07,410 INFO L272 TraceCheckUtils]: 11: Hoare triple {2405#(< ~counter~0 18)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2192#true} is VALID [2022-04-27 13:17:07,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2192#true} {2405#(< ~counter~0 18)} #90#return; {2405#(< ~counter~0 18)} is VALID [2022-04-27 13:17:07,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:17:07,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:17:07,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:17:07,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {2405#(< ~counter~0 18)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2192#true} is VALID [2022-04-27 13:17:07,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#(< ~counter~0 18)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2405#(< ~counter~0 18)} is VALID [2022-04-27 13:17:07,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#(< ~counter~0 18)} call #t~ret9 := main(); {2405#(< ~counter~0 18)} is VALID [2022-04-27 13:17:07,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#(< ~counter~0 18)} {2192#true} #102#return; {2405#(< ~counter~0 18)} is VALID [2022-04-27 13:17:07,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#(< ~counter~0 18)} assume true; {2405#(< ~counter~0 18)} is VALID [2022-04-27 13:17:07,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {2192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2405#(< ~counter~0 18)} is VALID [2022-04-27 13:17:07,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2022-04-27 13:17:07,412 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-27 13:17:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:07,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513742036] [2022-04-27 13:17:07,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:07,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689632178] [2022-04-27 13:17:07,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689632178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:07,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:07,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:17:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087919422] [2022-04-27 13:17:07,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:07,413 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-27 13:17:07,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:07,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:07,454 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-27 13:17:07,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:17:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:17:07,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:07,455 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:07,845 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-04-27 13:17:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:17:07,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-27 13:17:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-27 13:17:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-27 13:17:07,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2022-04-27 13:17:07,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:07,958 INFO L225 Difference]: With dead ends: 129 [2022-04-27 13:17:07,959 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 13:17:07,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:17:07,959 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 106 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:07,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 213 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:17:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 13:17:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2022-04-27 13:17:08,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:08,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:08,003 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:08,003 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:08,007 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-27 13:17:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-04-27 13:17:08,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:08,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:08,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 108 states. [2022-04-27 13:17:08,008 INFO L87 Difference]: Start difference. First operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 108 states. [2022-04-27 13:17:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:08,011 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-27 13:17:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-04-27 13:17:08,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:08,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:08,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:08,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2022-04-27 13:17:08,014 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 43 [2022-04-27 13:17:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:08,014 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2022-04-27 13:17:08,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:17:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-27 13:17:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:17:08,015 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:08,016 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-27 13:17:08,035 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-27 13:17:08,230 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-27 13:17:08,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-27 13:17:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:08,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140677459] [2022-04-27 13:17:08,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:08,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:08,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:08,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112356320] [2022-04-27 13:17:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:08,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:08,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:08,242 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-27 13:17:08,243 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-27 13:17:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:08,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 13:17:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:08,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:08,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {2996#true} call ULTIMATE.init(); {2996#true} is VALID [2022-04-27 13:17:08,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {2996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2996#true} is VALID [2022-04-27 13:17:08,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2996#true} {2996#true} #102#return; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {2996#true} call #t~ret9 := main(); {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {2996#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; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {2996#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2996#true} {2996#true} #90#return; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L272 TraceCheckUtils]: 11: Hoare triple {2996#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)); {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2996#true} {2996#true} #92#return; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {2996#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {2996#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2996#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {2996#true} assume !!(#t~post6 < 20);havoc #t~post6; {2996#true} is VALID [2022-04-27 13:17:08,423 INFO L272 TraceCheckUtils]: 19: Hoare triple {2996#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)); {2996#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:08,423 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2996#true} {2996#true} #94#return; {2996#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {2996#true} assume !!(0 != ~r~0); {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:08,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {3073#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:08,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {3073#(not (= main_~r~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:08,424 INFO L272 TraceCheckUtils]: 27: Hoare triple {3073#(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)); {2996#true} is VALID [2022-04-27 13:17:08,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:08,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:08,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:08,425 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2996#true} {3073#(not (= main_~r~0 0))} #96#return; {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:08,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {3073#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:08,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:08,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 20);havoc #t~post8; {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:08,430 INFO L272 TraceCheckUtils]: 35: Hoare triple {3098#(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)); {2996#true} is VALID [2022-04-27 13:17:08,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:17:08,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:17:08,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:17:08,435 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2996#true} {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:08,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {2997#false} is VALID [2022-04-27 13:17:08,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {2997#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2997#false} is VALID [2022-04-27 13:17:08,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {2997#false} assume !(#t~post6 < 20);havoc #t~post6; {2997#false} is VALID [2022-04-27 13:17:08,436 INFO L272 TraceCheckUtils]: 43: Hoare triple {2997#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2997#false} is VALID [2022-04-27 13:17:08,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {2997#false} ~cond := #in~cond; {2997#false} is VALID [2022-04-27 13:17:08,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {2997#false} assume 0 == ~cond; {2997#false} is VALID [2022-04-27 13:17:08,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {2997#false} assume !false; {2997#false} is VALID [2022-04-27 13:17:08,437 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-27 13:17:08,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:08,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:08,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140677459] [2022-04-27 13:17:08,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:08,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112356320] [2022-04-27 13:17:08,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112356320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:08,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:08,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:17:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613446583] [2022-04-27 13:17:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:08,438 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-27 13:17:08,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:08,438 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-27 13:17:08,467 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-27 13:17:08,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:17:08,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:08,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:17:08,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:08,467 INFO L87 Difference]: Start difference. First operand 95 states and 117 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-27 13:17:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:08,604 INFO L93 Difference]: Finished difference Result 158 states and 202 transitions. [2022-04-27 13:17:08,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:17:08,604 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-27 13:17:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:08,604 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-27 13:17:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:17:08,605 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-27 13:17:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:17:08,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-27 13:17:08,683 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-27 13:17:08,685 INFO L225 Difference]: With dead ends: 158 [2022-04-27 13:17:08,685 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 13:17:08,685 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-27 13:17:08,686 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:08,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 13:17:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-04-27 13:17:08,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:08,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:17:08,725 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:17:08,725 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:17:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:08,729 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2022-04-27 13:17:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-27 13:17:08,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:08,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:08,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 119 states. [2022-04-27 13:17:08,729 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 119 states. [2022-04-27 13:17:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:08,732 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2022-04-27 13:17:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-27 13:17:08,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:08,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:08,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:08,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:17:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2022-04-27 13:17:08,744 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 47 [2022-04-27 13:17:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:08,745 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2022-04-27 13:17:08,745 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-27 13:17:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-27 13:17:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 13:17:08,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:08,745 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-27 13:17:08,773 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-27 13:17:08,945 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-27 13:17:08,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-27 13:17:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:08,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826724364] [2022-04-27 13:17:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:08,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:08,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558335159] [2022-04-27 13:17:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:08,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:08,957 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-27 13:17:08,958 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-27 13:17:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:08,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:17:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:09,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:09,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {3753#true} call ULTIMATE.init(); {3753#true} is VALID [2022-04-27 13:17:09,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {3753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3761#(<= ~counter~0 0)} {3753#true} #102#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {3761#(<= ~counter~0 0)} call #t~ret9 := main(); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {3761#(<= ~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; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {3761#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {3761#(<= ~counter~0 0)} ~cond := #in~cond; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {3761#(<= ~counter~0 0)} assume !(0 == ~cond); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3761#(<= ~counter~0 0)} {3761#(<= ~counter~0 0)} #90#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,247 INFO L272 TraceCheckUtils]: 11: Hoare triple {3761#(<= ~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)); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {3761#(<= ~counter~0 0)} ~cond := #in~cond; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {3761#(<= ~counter~0 0)} assume !(0 == ~cond); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,248 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3761#(<= ~counter~0 0)} {3761#(<= ~counter~0 0)} #92#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {3761#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:09,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {3761#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:09,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {3810#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:09,250 INFO L272 TraceCheckUtils]: 19: Hoare triple {3810#(<= ~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)); {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:09,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {3810#(<= ~counter~0 1)} ~cond := #in~cond; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:09,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {3810#(<= ~counter~0 1)} assume !(0 == ~cond); {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:09,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {3810#(<= ~counter~0 1)} assume true; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:09,251 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3810#(<= ~counter~0 1)} {3810#(<= ~counter~0 1)} #94#return; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:09,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {3810#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:09,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {3810#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:09,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {3835#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:09,252 INFO L272 TraceCheckUtils]: 27: Hoare triple {3835#(<= ~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)); {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:09,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {3835#(<= ~counter~0 2)} ~cond := #in~cond; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:09,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {3835#(<= ~counter~0 2)} assume !(0 == ~cond); {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:09,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {3835#(<= ~counter~0 2)} assume true; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:09,254 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3835#(<= ~counter~0 2)} {3835#(<= ~counter~0 2)} #96#return; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:09,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {3835#(<= ~counter~0 2)} assume !(~r~0 > 0); {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:09,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {3835#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:09,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {3860#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:09,256 INFO L272 TraceCheckUtils]: 35: Hoare triple {3860#(<= ~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)); {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:09,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {3860#(<= ~counter~0 3)} ~cond := #in~cond; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:09,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#(<= ~counter~0 3)} assume !(0 == ~cond); {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:09,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#(<= ~counter~0 3)} assume true; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:09,257 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3860#(<= ~counter~0 3)} {3860#(<= ~counter~0 3)} #98#return; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:09,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {3860#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:09,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {3860#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3885#(<= |main_#t~post8| 3)} is VALID [2022-04-27 13:17:09,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {3885#(<= |main_#t~post8| 3)} assume !(#t~post8 < 20);havoc #t~post8; {3754#false} is VALID [2022-04-27 13:17:09,258 INFO L290 TraceCheckUtils]: 43: Hoare triple {3754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3754#false} is VALID [2022-04-27 13:17:09,258 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#false} assume !(#t~post6 < 20);havoc #t~post6; {3754#false} is VALID [2022-04-27 13:17:09,258 INFO L272 TraceCheckUtils]: 45: Hoare triple {3754#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3754#false} is VALID [2022-04-27 13:17:09,258 INFO L290 TraceCheckUtils]: 46: Hoare triple {3754#false} ~cond := #in~cond; {3754#false} is VALID [2022-04-27 13:17:09,259 INFO L290 TraceCheckUtils]: 47: Hoare triple {3754#false} assume 0 == ~cond; {3754#false} is VALID [2022-04-27 13:17:09,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {3754#false} assume !false; {3754#false} is VALID [2022-04-27 13:17:09,259 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-27 13:17:09,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:09,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {3754#false} assume !false; {3754#false} is VALID [2022-04-27 13:17:09,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {3754#false} assume 0 == ~cond; {3754#false} is VALID [2022-04-27 13:17:09,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {3754#false} ~cond := #in~cond; {3754#false} is VALID [2022-04-27 13:17:09,495 INFO L272 TraceCheckUtils]: 45: Hoare triple {3754#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3754#false} is VALID [2022-04-27 13:17:09,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#false} assume !(#t~post6 < 20);havoc #t~post6; {3754#false} is VALID [2022-04-27 13:17:09,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {3754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3754#false} is VALID [2022-04-27 13:17:09,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {3925#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {3754#false} is VALID [2022-04-27 13:17:09,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {3929#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3925#(< |main_#t~post8| 20)} is VALID [2022-04-27 13:17:09,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {3929#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3929#(< ~counter~0 20)} is VALID [2022-04-27 13:17:09,496 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3753#true} {3929#(< ~counter~0 20)} #98#return; {3929#(< ~counter~0 20)} is VALID [2022-04-27 13:17:09,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:09,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:09,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:09,496 INFO L272 TraceCheckUtils]: 35: Hoare triple {3929#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:09,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {3929#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {3929#(< ~counter~0 20)} is VALID [2022-04-27 13:17:09,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {3954#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3929#(< ~counter~0 20)} is VALID [2022-04-27 13:17:09,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#(< ~counter~0 19)} assume !(~r~0 > 0); {3954#(< ~counter~0 19)} is VALID [2022-04-27 13:17:09,498 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3753#true} {3954#(< ~counter~0 19)} #96#return; {3954#(< ~counter~0 19)} is VALID [2022-04-27 13:17:09,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:09,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:09,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:09,498 INFO L272 TraceCheckUtils]: 27: Hoare triple {3954#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:09,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {3954#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {3954#(< ~counter~0 19)} is VALID [2022-04-27 13:17:09,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {3979#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3954#(< ~counter~0 19)} is VALID [2022-04-27 13:17:09,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {3979#(< ~counter~0 18)} assume !!(0 != ~r~0); {3979#(< ~counter~0 18)} is VALID [2022-04-27 13:17:09,500 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3753#true} {3979#(< ~counter~0 18)} #94#return; {3979#(< ~counter~0 18)} is VALID [2022-04-27 13:17:09,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:09,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:09,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:09,501 INFO L272 TraceCheckUtils]: 19: Hoare triple {3979#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:09,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {3979#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {3979#(< ~counter~0 18)} is VALID [2022-04-27 13:17:09,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {4004#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3979#(< ~counter~0 18)} is VALID [2022-04-27 13:17:09,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {4004#(< ~counter~0 17)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4004#(< ~counter~0 17)} is VALID [2022-04-27 13:17:09,502 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3753#true} {4004#(< ~counter~0 17)} #92#return; {4004#(< ~counter~0 17)} is VALID [2022-04-27 13:17:09,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:09,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:09,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:09,502 INFO L272 TraceCheckUtils]: 11: Hoare triple {4004#(< ~counter~0 17)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:09,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3753#true} {4004#(< ~counter~0 17)} #90#return; {4004#(< ~counter~0 17)} is VALID [2022-04-27 13:17:09,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:17:09,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:17:09,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:17:09,503 INFO L272 TraceCheckUtils]: 6: Hoare triple {4004#(< ~counter~0 17)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:17:09,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {4004#(< ~counter~0 17)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4004#(< ~counter~0 17)} is VALID [2022-04-27 13:17:09,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {4004#(< ~counter~0 17)} call #t~ret9 := main(); {4004#(< ~counter~0 17)} is VALID [2022-04-27 13:17:09,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4004#(< ~counter~0 17)} {3753#true} #102#return; {4004#(< ~counter~0 17)} is VALID [2022-04-27 13:17:09,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {4004#(< ~counter~0 17)} assume true; {4004#(< ~counter~0 17)} is VALID [2022-04-27 13:17:09,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {3753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4004#(< ~counter~0 17)} is VALID [2022-04-27 13:17:09,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {3753#true} call ULTIMATE.init(); {3753#true} is VALID [2022-04-27 13:17:09,505 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-27 13:17:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:09,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826724364] [2022-04-27 13:17:09,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:09,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558335159] [2022-04-27 13:17:09,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558335159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:09,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:09,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-27 13:17:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664749695] [2022-04-27 13:17:09,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-27 13:17:09,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:09,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:09,557 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-27 13:17:09,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:17:09,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:09,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:17:09,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:17:09,558 INFO L87 Difference]: Start difference. First operand 109 states and 137 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:10,087 INFO L93 Difference]: Finished difference Result 219 states and 283 transitions. [2022-04-27 13:17:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 13:17:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-27 13:17:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-27 13:17:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-27 13:17:10,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 194 transitions. [2022-04-27 13:17:10,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:10,232 INFO L225 Difference]: With dead ends: 219 [2022-04-27 13:17:10,232 INFO L226 Difference]: Without dead ends: 172 [2022-04-27 13:17:10,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-27 13:17:10,233 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 180 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:10,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 200 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:17:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-27 13:17:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 153. [2022-04-27 13:17:10,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:10,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:17:10,296 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:17:10,296 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:17:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:10,300 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-27 13:17:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-27 13:17:10,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:10,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:10,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-27 13:17:10,301 INFO L87 Difference]: Start difference. First operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-27 13:17:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:10,304 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-27 13:17:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-27 13:17:10,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:10,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:10,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:10,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:17:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2022-04-27 13:17:10,308 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 49 [2022-04-27 13:17:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:10,308 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2022-04-27 13:17:10,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:17:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-04-27 13:17:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:17:10,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:10,309 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-27 13:17:10,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 13:17:10,524 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-27 13:17:10,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-27 13:17:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:10,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624714560] [2022-04-27 13:17:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:10,550 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:10,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452554517] [2022-04-27 13:17:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:10,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:10,555 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-27 13:17:10,559 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-27 13:17:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:10,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:17:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:10,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:10,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {4930#true} call ULTIMATE.init(); {4930#true} is VALID [2022-04-27 13:17:10,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {4930#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4938#(<= ~counter~0 0)} {4930#true} #102#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {4938#(<= ~counter~0 0)} call #t~ret9 := main(); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {4938#(<= ~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; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,843 INFO L272 TraceCheckUtils]: 6: Hoare triple {4938#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {4938#(<= ~counter~0 0)} ~cond := #in~cond; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {4938#(<= ~counter~0 0)} assume !(0 == ~cond); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4938#(<= ~counter~0 0)} {4938#(<= ~counter~0 0)} #90#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,845 INFO L272 TraceCheckUtils]: 11: Hoare triple {4938#(<= ~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)); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {4938#(<= ~counter~0 0)} ~cond := #in~cond; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {4938#(<= ~counter~0 0)} assume !(0 == ~cond); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,846 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4938#(<= ~counter~0 0)} {4938#(<= ~counter~0 0)} #92#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {4938#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {4938#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {4987#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,847 INFO L272 TraceCheckUtils]: 19: Hoare triple {4987#(<= ~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)); {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {4987#(<= ~counter~0 1)} ~cond := #in~cond; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {4987#(<= ~counter~0 1)} assume !(0 == ~cond); {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {4987#(<= ~counter~0 1)} assume true; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4987#(<= ~counter~0 1)} {4987#(<= ~counter~0 1)} #94#return; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {4987#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {4987#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {5012#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,856 INFO L272 TraceCheckUtils]: 27: Hoare triple {5012#(<= ~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)); {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {5012#(<= ~counter~0 2)} ~cond := #in~cond; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {5012#(<= ~counter~0 2)} assume !(0 == ~cond); {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {5012#(<= ~counter~0 2)} assume true; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,857 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5012#(<= ~counter~0 2)} {5012#(<= ~counter~0 2)} #96#return; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {5012#(<= ~counter~0 2)} assume !(~r~0 > 0); {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {5012#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {5037#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,859 INFO L272 TraceCheckUtils]: 35: Hoare triple {5037#(<= ~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)); {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {5037#(<= ~counter~0 3)} ~cond := #in~cond; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {5037#(<= ~counter~0 3)} assume !(0 == ~cond); {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {5037#(<= ~counter~0 3)} assume true; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,861 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5037#(<= ~counter~0 3)} {5037#(<= ~counter~0 3)} #98#return; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {5037#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {5037#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:10,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {5062#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:10,862 INFO L272 TraceCheckUtils]: 43: Hoare triple {5062#(<= ~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)); {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:10,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {5062#(<= ~counter~0 4)} ~cond := #in~cond; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:10,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {5062#(<= ~counter~0 4)} assume !(0 == ~cond); {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:10,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {5062#(<= ~counter~0 4)} assume true; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:10,863 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5062#(<= ~counter~0 4)} {5062#(<= ~counter~0 4)} #98#return; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:10,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {5062#(<= ~counter~0 4)} assume !(~r~0 < 0); {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:10,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {5062#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5087#(<= |main_#t~post6| 4)} is VALID [2022-04-27 13:17:10,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {5087#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {4931#false} is VALID [2022-04-27 13:17:10,864 INFO L272 TraceCheckUtils]: 51: Hoare triple {4931#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4931#false} is VALID [2022-04-27 13:17:10,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {4931#false} ~cond := #in~cond; {4931#false} is VALID [2022-04-27 13:17:10,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {4931#false} assume 0 == ~cond; {4931#false} is VALID [2022-04-27 13:17:10,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-04-27 13:17:10,864 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-27 13:17:10,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:11,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-04-27 13:17:11,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {4931#false} assume 0 == ~cond; {4931#false} is VALID [2022-04-27 13:17:11,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {4931#false} ~cond := #in~cond; {4931#false} is VALID [2022-04-27 13:17:11,128 INFO L272 TraceCheckUtils]: 51: Hoare triple {4931#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4931#false} is VALID [2022-04-27 13:17:11,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {5115#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {4931#false} is VALID [2022-04-27 13:17:11,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {5119#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5115#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:17:11,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {5119#(< ~counter~0 20)} assume !(~r~0 < 0); {5119#(< ~counter~0 20)} is VALID [2022-04-27 13:17:11,129 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4930#true} {5119#(< ~counter~0 20)} #98#return; {5119#(< ~counter~0 20)} is VALID [2022-04-27 13:17:11,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:11,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:11,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:11,129 INFO L272 TraceCheckUtils]: 43: Hoare triple {5119#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:11,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {5119#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {5119#(< ~counter~0 20)} is VALID [2022-04-27 13:17:11,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5119#(< ~counter~0 20)} is VALID [2022-04-27 13:17:11,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5144#(< ~counter~0 19)} is VALID [2022-04-27 13:17:11,136 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4930#true} {5144#(< ~counter~0 19)} #98#return; {5144#(< ~counter~0 19)} is VALID [2022-04-27 13:17:11,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:11,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:11,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:11,137 INFO L272 TraceCheckUtils]: 35: Hoare triple {5144#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:11,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {5144#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {5144#(< ~counter~0 19)} is VALID [2022-04-27 13:17:11,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {5169#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5144#(< ~counter~0 19)} is VALID [2022-04-27 13:17:11,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {5169#(< ~counter~0 18)} assume !(~r~0 > 0); {5169#(< ~counter~0 18)} is VALID [2022-04-27 13:17:11,138 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4930#true} {5169#(< ~counter~0 18)} #96#return; {5169#(< ~counter~0 18)} is VALID [2022-04-27 13:17:11,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:11,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:11,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:11,138 INFO L272 TraceCheckUtils]: 27: Hoare triple {5169#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:11,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {5169#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {5169#(< ~counter~0 18)} is VALID [2022-04-27 13:17:11,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {5194#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5169#(< ~counter~0 18)} is VALID [2022-04-27 13:17:11,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {5194#(< ~counter~0 17)} assume !!(0 != ~r~0); {5194#(< ~counter~0 17)} is VALID [2022-04-27 13:17:11,140 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4930#true} {5194#(< ~counter~0 17)} #94#return; {5194#(< ~counter~0 17)} is VALID [2022-04-27 13:17:11,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:11,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:11,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:11,140 INFO L272 TraceCheckUtils]: 19: Hoare triple {5194#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:11,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {5194#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {5194#(< ~counter~0 17)} is VALID [2022-04-27 13:17:11,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {5219#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5194#(< ~counter~0 17)} is VALID [2022-04-27 13:17:11,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {5219#(< ~counter~0 16)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5219#(< ~counter~0 16)} is VALID [2022-04-27 13:17:11,141 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4930#true} {5219#(< ~counter~0 16)} #92#return; {5219#(< ~counter~0 16)} is VALID [2022-04-27 13:17:11,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:11,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:11,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:11,142 INFO L272 TraceCheckUtils]: 11: Hoare triple {5219#(< ~counter~0 16)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:11,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4930#true} {5219#(< ~counter~0 16)} #90#return; {5219#(< ~counter~0 16)} is VALID [2022-04-27 13:17:11,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:17:11,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:17:11,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:17:11,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {5219#(< ~counter~0 16)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:17:11,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#(< ~counter~0 16)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5219#(< ~counter~0 16)} is VALID [2022-04-27 13:17:11,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#(< ~counter~0 16)} call #t~ret9 := main(); {5219#(< ~counter~0 16)} is VALID [2022-04-27 13:17:11,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#(< ~counter~0 16)} {4930#true} #102#return; {5219#(< ~counter~0 16)} is VALID [2022-04-27 13:17:11,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#(< ~counter~0 16)} assume true; {5219#(< ~counter~0 16)} is VALID [2022-04-27 13:17:11,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {4930#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5219#(< ~counter~0 16)} is VALID [2022-04-27 13:17:11,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {4930#true} call ULTIMATE.init(); {4930#true} is VALID [2022-04-27 13:17:11,144 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-27 13:17:11,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:11,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624714560] [2022-04-27 13:17:11,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:11,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452554517] [2022-04-27 13:17:11,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452554517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:11,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:11,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:17:11,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771550039] [2022-04-27 13:17:11,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-27 13:17:11,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:11,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:11,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:11,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:17:11,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:11,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:17:11,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:17:11,209 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:11,905 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2022-04-27 13:17:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 13:17:11,906 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-27 13:17:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-27 13:17:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-27 13:17:11,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 204 transitions. [2022-04-27 13:17:12,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:12,059 INFO L225 Difference]: With dead ends: 211 [2022-04-27 13:17:12,059 INFO L226 Difference]: Without dead ends: 206 [2022-04-27 13:17:12,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:17:12,060 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 191 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:12,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 291 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:17:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-27 13:17:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2022-04-27 13:17:12,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:12,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:17:12,130 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:17:12,130 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:17:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:12,134 INFO L93 Difference]: Finished difference Result 206 states and 267 transitions. [2022-04-27 13:17:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2022-04-27 13:17:12,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:12,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:12,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 206 states. [2022-04-27 13:17:12,135 INFO L87 Difference]: Start difference. First operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 206 states. [2022-04-27 13:17:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:12,139 INFO L93 Difference]: Finished difference Result 206 states and 267 transitions. [2022-04-27 13:17:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2022-04-27 13:17:12,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:12,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:12,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:12,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 40 states have call successors, (40), 14 states have call predecessors, (40), 12 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-27 13:17:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 257 transitions. [2022-04-27 13:17:12,144 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 257 transitions. Word has length 55 [2022-04-27 13:17:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:12,144 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 257 transitions. [2022-04-27 13:17:12,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:17:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 257 transitions. [2022-04-27 13:17:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:17:12,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:12,145 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-27 13:17:12,163 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-27 13:17:12,361 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-27 13:17:12,362 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:12,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash -304792209, now seen corresponding path program 1 times [2022-04-27 13:17:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:12,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454610367] [2022-04-27 13:17:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:12,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:12,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136886023] [2022-04-27 13:17:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:12,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:12,375 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-27 13:17:12,395 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-27 13:17:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:12,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:17:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:12,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:12,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {6268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#true} {6268#true} #102#return; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {6268#true} call #t~ret9 := main(); {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {6268#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; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {6268#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6268#true} #90#return; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {6268#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)); {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,679 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6268#true} {6268#true} #92#return; {6268#true} is VALID [2022-04-27 13:17:12,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {6268#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {6321#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,680 INFO L272 TraceCheckUtils]: 19: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,681 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {6321#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,682 INFO L272 TraceCheckUtils]: 27: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,682 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 > 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {6321#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,683 INFO L272 TraceCheckUtils]: 35: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,684 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,684 INFO L272 TraceCheckUtils]: 43: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,685 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 < 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {6321#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,689 INFO L272 TraceCheckUtils]: 51: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,690 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {6321#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,691 INFO L272 TraceCheckUtils]: 59: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,691 INFO L290 TraceCheckUtils]: 60: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,691 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,692 INFO L290 TraceCheckUtils]: 64: Hoare triple {6321#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {6466#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,701 INFO L290 TraceCheckUtils]: 66: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 20);havoc #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,701 INFO L290 TraceCheckUtils]: 67: Hoare triple {6466#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,701 INFO L290 TraceCheckUtils]: 68: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,701 INFO L272 TraceCheckUtils]: 69: Hoare triple {6466#(< 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)); {6268#true} is VALID [2022-04-27 13:17:12,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,702 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6268#true} {6466#(< 0 (+ main_~r~0 1))} #98#return; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,702 INFO L290 TraceCheckUtils]: 74: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6269#false} is VALID [2022-04-27 13:17:12,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {6269#false} assume !!(#t~post8 < 20);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L272 TraceCheckUtils]: 77: Hoare triple {6269#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 79: Hoare triple {6269#false} assume !(0 == ~cond); {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 80: Hoare triple {6269#false} assume true; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6269#false} {6269#false} #98#return; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 82: Hoare triple {6269#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 83: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 84: Hoare triple {6269#false} assume !(#t~post8 < 20);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 85: Hoare triple {6269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 86: Hoare triple {6269#false} assume !(#t~post6 < 20);havoc #t~post6; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L272 TraceCheckUtils]: 87: Hoare triple {6269#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 88: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 89: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-27 13:17:12,705 INFO L290 TraceCheckUtils]: 90: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-27 13:17:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-27 13:17:12,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:12,974 INFO L290 TraceCheckUtils]: 90: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 89: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 88: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L272 TraceCheckUtils]: 87: Hoare triple {6269#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 86: Hoare triple {6269#false} assume !(#t~post6 < 20);havoc #t~post6; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 85: Hoare triple {6269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 84: Hoare triple {6269#false} assume !(#t~post8 < 20);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 83: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 82: Hoare triple {6269#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6268#true} {6269#false} #98#return; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 80: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 79: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 78: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,975 INFO L272 TraceCheckUtils]: 77: Hoare triple {6269#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6268#true} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {6269#false} assume !!(#t~post8 < 20);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:17:12,975 INFO L290 TraceCheckUtils]: 75: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-27 13:17:12,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6269#false} is VALID [2022-04-27 13:17:12,977 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6268#true} {6466#(< 0 (+ main_~r~0 1))} #98#return; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,977 INFO L290 TraceCheckUtils]: 72: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,977 INFO L290 TraceCheckUtils]: 71: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,977 INFO L272 TraceCheckUtils]: 69: Hoare triple {6466#(< 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)); {6268#true} is VALID [2022-04-27 13:17:12,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,977 INFO L290 TraceCheckUtils]: 67: Hoare triple {6466#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 20);havoc #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {6466#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {6321#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:17:12,979 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,979 INFO L272 TraceCheckUtils]: 59: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {6321#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,980 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,980 INFO L272 TraceCheckUtils]: 51: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {6321#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 < 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,982 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,982 INFO L272 TraceCheckUtils]: 43: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,983 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,984 INFO L272 TraceCheckUtils]: 35: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 20);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {6321#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 > 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,985 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,985 INFO L272 TraceCheckUtils]: 27: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {6321#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,986 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,987 INFO L272 TraceCheckUtils]: 19: Hoare triple {6321#(<= 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)); {6268#true} is VALID [2022-04-27 13:17:12,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {6321#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {6268#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:12,988 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6268#true} {6268#true} #92#return; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L272 TraceCheckUtils]: 11: Hoare triple {6268#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)); {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6268#true} #90#return; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L272 TraceCheckUtils]: 6: Hoare triple {6268#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {6268#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; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {6268#true} call #t~ret9 := main(); {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#true} {6268#true} #102#return; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {6268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6268#true} is VALID [2022-04-27 13:17:12,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-27 13:17:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-04-27 13:17:12,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:12,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454610367] [2022-04-27 13:17:12,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:12,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136886023] [2022-04-27 13:17:12,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136886023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:12,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:12,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-27 13:17:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933034577] [2022-04-27 13:17:12,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:12,990 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-27 13:17:12,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:12,990 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:13,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:13,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:17:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:17:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:13,029 INFO L87 Difference]: Start difference. First operand 198 states and 257 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,422 INFO L93 Difference]: Finished difference Result 502 states and 697 transitions. [2022-04-27 13:17:13,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:13,422 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-27 13:17:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:13,423 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 13:17:13,424 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 13:17:13,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-27 13:17:13,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:13,509 INFO L225 Difference]: With dead ends: 502 [2022-04-27 13:17:13,509 INFO L226 Difference]: Without dead ends: 359 [2022-04-27 13:17:13,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 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-27 13:17:13,510 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 17 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:13,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 141 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-27 13:17:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2022-04-27 13:17:13,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:13,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:17:13,671 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:17:13,672 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:17:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,679 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2022-04-27 13:17:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 490 transitions. [2022-04-27 13:17:13,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:13,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:13,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 359 states. [2022-04-27 13:17:13,681 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 359 states. [2022-04-27 13:17:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,689 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2022-04-27 13:17:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 490 transitions. [2022-04-27 13:17:13,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:13,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:13,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:13,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2666666666666666) internal successors, (323), 261 states have internal predecessors, (323), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:17:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 469 transitions. [2022-04-27 13:17:13,708 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 469 transitions. Word has length 91 [2022-04-27 13:17:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:13,708 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 469 transitions. [2022-04-27 13:17:13,708 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:17:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 469 transitions. [2022-04-27 13:17:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:17:13,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:13,710 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 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, 1] [2022-04-27 13:17:13,728 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-27 13:17:13,916 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-27 13:17:13,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1103092705, now seen corresponding path program 2 times [2022-04-27 13:17:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:13,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324309062] [2022-04-27 13:17:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:13,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:13,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855906866] [2022-04-27 13:17:13,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:17:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:13,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:13,932 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-27 13:17:13,933 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-27 13:17:13,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:17:13,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:13,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 13:17:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:13,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:14,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {8722#true} call ULTIMATE.init(); {8722#true} is VALID [2022-04-27 13:17:14,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {8722#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#(<= ~counter~0 0)} {8722#true} #102#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {8730#(<= ~counter~0 0)} call #t~ret9 := main(); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#(<= ~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; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {8730#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#(<= ~counter~0 0)} ~cond := #in~cond; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#(<= ~counter~0 0)} assume !(0 == ~cond); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8730#(<= ~counter~0 0)} {8730#(<= ~counter~0 0)} #90#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,386 INFO L272 TraceCheckUtils]: 11: Hoare triple {8730#(<= ~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)); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {8730#(<= ~counter~0 0)} ~cond := #in~cond; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {8730#(<= ~counter~0 0)} assume !(0 == ~cond); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,388 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8730#(<= ~counter~0 0)} {8730#(<= ~counter~0 0)} #92#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {8730#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:14,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {8730#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {8779#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,389 INFO L272 TraceCheckUtils]: 19: Hoare triple {8779#(<= ~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)); {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {8779#(<= ~counter~0 1)} ~cond := #in~cond; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {8779#(<= ~counter~0 1)} assume !(0 == ~cond); {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {8779#(<= ~counter~0 1)} assume true; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,390 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8779#(<= ~counter~0 1)} {8779#(<= ~counter~0 1)} #94#return; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {8779#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:14,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {8779#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {8804#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,392 INFO L272 TraceCheckUtils]: 27: Hoare triple {8804#(<= ~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)); {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {8804#(<= ~counter~0 2)} ~cond := #in~cond; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {8804#(<= ~counter~0 2)} assume !(0 == ~cond); {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {8804#(<= ~counter~0 2)} assume true; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,393 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8804#(<= ~counter~0 2)} {8804#(<= ~counter~0 2)} #96#return; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {8804#(<= ~counter~0 2)} assume !(~r~0 > 0); {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:14,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {8804#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:14,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {8829#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:14,394 INFO L272 TraceCheckUtils]: 35: Hoare triple {8829#(<= ~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)); {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:14,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {8829#(<= ~counter~0 3)} ~cond := #in~cond; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:14,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {8829#(<= ~counter~0 3)} assume !(0 == ~cond); {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:14,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {8829#(<= ~counter~0 3)} assume true; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:14,395 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8829#(<= ~counter~0 3)} {8829#(<= ~counter~0 3)} #98#return; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:14,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {8829#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:14,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {8829#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:14,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {8854#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:14,397 INFO L272 TraceCheckUtils]: 43: Hoare triple {8854#(<= ~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)); {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:14,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {8854#(<= ~counter~0 4)} ~cond := #in~cond; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:14,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {8854#(<= ~counter~0 4)} assume !(0 == ~cond); {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:14,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {8854#(<= ~counter~0 4)} assume true; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:14,398 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8854#(<= ~counter~0 4)} {8854#(<= ~counter~0 4)} #98#return; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:14,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {8854#(<= ~counter~0 4)} assume !(~r~0 < 0); {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:14,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {8854#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:14,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {8879#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:14,400 INFO L272 TraceCheckUtils]: 51: Hoare triple {8879#(<= ~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)); {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:14,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {8879#(<= ~counter~0 5)} ~cond := #in~cond; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:14,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {8879#(<= ~counter~0 5)} assume !(0 == ~cond); {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:14,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {8879#(<= ~counter~0 5)} assume true; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:14,401 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8879#(<= ~counter~0 5)} {8879#(<= ~counter~0 5)} #94#return; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:14,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {8879#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:14,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {8879#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:14,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {8904#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:14,402 INFO L272 TraceCheckUtils]: 59: Hoare triple {8904#(<= ~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)); {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:14,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {8904#(<= ~counter~0 6)} ~cond := #in~cond; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:14,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {8904#(<= ~counter~0 6)} assume !(0 == ~cond); {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:14,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {8904#(<= ~counter~0 6)} assume true; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:14,403 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8904#(<= ~counter~0 6)} {8904#(<= ~counter~0 6)} #96#return; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:14,404 INFO L290 TraceCheckUtils]: 64: Hoare triple {8904#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:14,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {8904#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:14,404 INFO L290 TraceCheckUtils]: 66: Hoare triple {8929#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:14,405 INFO L272 TraceCheckUtils]: 67: Hoare triple {8929#(<= ~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)); {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:14,405 INFO L290 TraceCheckUtils]: 68: Hoare triple {8929#(<= ~counter~0 7)} ~cond := #in~cond; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:14,405 INFO L290 TraceCheckUtils]: 69: Hoare triple {8929#(<= ~counter~0 7)} assume !(0 == ~cond); {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:14,405 INFO L290 TraceCheckUtils]: 70: Hoare triple {8929#(<= ~counter~0 7)} assume true; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:14,406 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8929#(<= ~counter~0 7)} {8929#(<= ~counter~0 7)} #96#return; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:14,406 INFO L290 TraceCheckUtils]: 72: Hoare triple {8929#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:14,406 INFO L290 TraceCheckUtils]: 73: Hoare triple {8929#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8954#(<= |main_#t~post7| 7)} is VALID [2022-04-27 13:17:14,407 INFO L290 TraceCheckUtils]: 74: Hoare triple {8954#(<= |main_#t~post7| 7)} assume !(#t~post7 < 20);havoc #t~post7; {8723#false} is VALID [2022-04-27 13:17:14,407 INFO L290 TraceCheckUtils]: 75: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {8723#false} assume !!(#t~post8 < 20);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L272 TraceCheckUtils]: 77: Hoare triple {8723#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {8723#false} assume !(0 == ~cond); {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 80: Hoare triple {8723#false} assume true; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8723#false} {8723#false} #98#return; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {8723#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 83: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {8723#false} assume !(#t~post8 < 20);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {8723#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8723#false} is VALID [2022-04-27 13:17:14,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {8723#false} assume !(#t~post6 < 20);havoc #t~post6; {8723#false} is VALID [2022-04-27 13:17:14,416 INFO L272 TraceCheckUtils]: 87: Hoare triple {8723#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8723#false} is VALID [2022-04-27 13:17:14,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:17:14,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {8723#false} assume 0 == ~cond; {8723#false} is VALID [2022-04-27 13:17:14,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {8723#false} assume !false; {8723#false} is VALID [2022-04-27 13:17:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 13:17:14,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:14,864 INFO L290 TraceCheckUtils]: 90: Hoare triple {8723#false} assume !false; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 89: Hoare triple {8723#false} assume 0 == ~cond; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 88: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L272 TraceCheckUtils]: 87: Hoare triple {8723#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 86: Hoare triple {8723#false} assume !(#t~post6 < 20);havoc #t~post6; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 85: Hoare triple {8723#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 84: Hoare triple {8723#false} assume !(#t~post8 < 20);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 82: Hoare triple {8723#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8722#true} {8723#false} #98#return; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 80: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,865 INFO L272 TraceCheckUtils]: 77: Hoare triple {8723#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {8723#false} assume !!(#t~post8 < 20);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:17:14,865 INFO L290 TraceCheckUtils]: 75: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-27 13:17:14,866 INFO L290 TraceCheckUtils]: 74: Hoare triple {9054#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {8723#false} is VALID [2022-04-27 13:17:14,866 INFO L290 TraceCheckUtils]: 73: Hoare triple {9058#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9054#(< |main_#t~post7| 20)} is VALID [2022-04-27 13:17:14,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {9058#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9058#(< ~counter~0 20)} is VALID [2022-04-27 13:17:14,867 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8722#true} {9058#(< ~counter~0 20)} #96#return; {9058#(< ~counter~0 20)} is VALID [2022-04-27 13:17:14,867 INFO L290 TraceCheckUtils]: 70: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,867 INFO L272 TraceCheckUtils]: 67: Hoare triple {9058#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {9058#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {9058#(< ~counter~0 20)} is VALID [2022-04-27 13:17:14,868 INFO L290 TraceCheckUtils]: 65: Hoare triple {9083#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9058#(< ~counter~0 20)} is VALID [2022-04-27 13:17:14,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {9083#(< ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9083#(< ~counter~0 19)} is VALID [2022-04-27 13:17:14,869 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8722#true} {9083#(< ~counter~0 19)} #96#return; {9083#(< ~counter~0 19)} is VALID [2022-04-27 13:17:14,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,869 INFO L272 TraceCheckUtils]: 59: Hoare triple {9083#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {9083#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {9083#(< ~counter~0 19)} is VALID [2022-04-27 13:17:14,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {9108#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9083#(< ~counter~0 19)} is VALID [2022-04-27 13:17:14,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {9108#(< ~counter~0 18)} assume !!(0 != ~r~0); {9108#(< ~counter~0 18)} is VALID [2022-04-27 13:17:14,870 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8722#true} {9108#(< ~counter~0 18)} #94#return; {9108#(< ~counter~0 18)} is VALID [2022-04-27 13:17:14,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,870 INFO L272 TraceCheckUtils]: 51: Hoare triple {9108#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {9108#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {9108#(< ~counter~0 18)} is VALID [2022-04-27 13:17:14,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {9133#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9108#(< ~counter~0 18)} is VALID [2022-04-27 13:17:14,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {9133#(< ~counter~0 17)} assume !(~r~0 < 0); {9133#(< ~counter~0 17)} is VALID [2022-04-27 13:17:14,872 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8722#true} {9133#(< ~counter~0 17)} #98#return; {9133#(< ~counter~0 17)} is VALID [2022-04-27 13:17:14,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,872 INFO L272 TraceCheckUtils]: 43: Hoare triple {9133#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {9133#(< ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {9133#(< ~counter~0 17)} is VALID [2022-04-27 13:17:14,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {9158#(< ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9133#(< ~counter~0 17)} is VALID [2022-04-27 13:17:14,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {9158#(< ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9158#(< ~counter~0 16)} is VALID [2022-04-27 13:17:14,873 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8722#true} {9158#(< ~counter~0 16)} #98#return; {9158#(< ~counter~0 16)} is VALID [2022-04-27 13:17:14,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,874 INFO L272 TraceCheckUtils]: 35: Hoare triple {9158#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {9158#(< ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {9158#(< ~counter~0 16)} is VALID [2022-04-27 13:17:14,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {9183#(< ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9158#(< ~counter~0 16)} is VALID [2022-04-27 13:17:14,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {9183#(< ~counter~0 15)} assume !(~r~0 > 0); {9183#(< ~counter~0 15)} is VALID [2022-04-27 13:17:14,875 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8722#true} {9183#(< ~counter~0 15)} #96#return; {9183#(< ~counter~0 15)} is VALID [2022-04-27 13:17:14,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,875 INFO L272 TraceCheckUtils]: 27: Hoare triple {9183#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {9183#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {9183#(< ~counter~0 15)} is VALID [2022-04-27 13:17:14,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {9208#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9183#(< ~counter~0 15)} is VALID [2022-04-27 13:17:14,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {9208#(< ~counter~0 14)} assume !!(0 != ~r~0); {9208#(< ~counter~0 14)} is VALID [2022-04-27 13:17:14,876 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8722#true} {9208#(< ~counter~0 14)} #94#return; {9208#(< ~counter~0 14)} is VALID [2022-04-27 13:17:14,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,877 INFO L272 TraceCheckUtils]: 19: Hoare triple {9208#(< ~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)); {8722#true} is VALID [2022-04-27 13:17:14,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {9208#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {9208#(< ~counter~0 14)} is VALID [2022-04-27 13:17:14,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {9233#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9208#(< ~counter~0 14)} is VALID [2022-04-27 13:17:14,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {9233#(< ~counter~0 13)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9233#(< ~counter~0 13)} is VALID [2022-04-27 13:17:14,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8722#true} {9233#(< ~counter~0 13)} #92#return; {9233#(< ~counter~0 13)} is VALID [2022-04-27 13:17:14,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,878 INFO L272 TraceCheckUtils]: 11: Hoare triple {9233#(< ~counter~0 13)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8722#true} {9233#(< ~counter~0 13)} #90#return; {9233#(< ~counter~0 13)} is VALID [2022-04-27 13:17:14,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:17:14,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:17:14,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:17:14,879 INFO L272 TraceCheckUtils]: 6: Hoare triple {9233#(< ~counter~0 13)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:17:14,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {9233#(< ~counter~0 13)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9233#(< ~counter~0 13)} is VALID [2022-04-27 13:17:14,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {9233#(< ~counter~0 13)} call #t~ret9 := main(); {9233#(< ~counter~0 13)} is VALID [2022-04-27 13:17:14,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9233#(< ~counter~0 13)} {8722#true} #102#return; {9233#(< ~counter~0 13)} is VALID [2022-04-27 13:17:14,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {9233#(< ~counter~0 13)} assume true; {9233#(< ~counter~0 13)} is VALID [2022-04-27 13:17:14,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {8722#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9233#(< ~counter~0 13)} is VALID [2022-04-27 13:17:14,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {8722#true} call ULTIMATE.init(); {8722#true} is VALID [2022-04-27 13:17:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-27 13:17:14,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:14,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324309062] [2022-04-27 13:17:14,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:14,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855906866] [2022-04-27 13:17:14,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855906866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:14,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:14,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-27 13:17:14,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967819543] [2022-04-27 13:17:14,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:14,882 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) Word has length 91 [2022-04-27 13:17:14,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:14,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:14,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:14,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 13:17:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:14,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 13:17:14,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:17:14,977 INFO L87 Difference]: Start difference. First operand 342 states and 469 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:16,581 INFO L93 Difference]: Finished difference Result 985 states and 1423 transitions. [2022-04-27 13:17:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 13:17:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) Word has length 91 [2022-04-27 13:17:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-27 13:17:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-27 13:17:16,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 373 transitions. [2022-04-27 13:17:16,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:16,859 INFO L225 Difference]: With dead ends: 985 [2022-04-27 13:17:16,860 INFO L226 Difference]: Without dead ends: 842 [2022-04-27 13:17:16,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=403, Invalid=719, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 13:17:16,861 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 352 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:16,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 364 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:17:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-27 13:17:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 793. [2022-04-27 13:17:17,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:17,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:17,293 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:17,293 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:17,319 INFO L93 Difference]: Finished difference Result 842 states and 1155 transitions. [2022-04-27 13:17:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-04-27 13:17:17,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:17,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:17,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) Second operand 842 states. [2022-04-27 13:17:17,323 INFO L87 Difference]: Start difference. First operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) Second operand 842 states. [2022-04-27 13:17:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:17,349 INFO L93 Difference]: Finished difference Result 842 states and 1155 transitions. [2022-04-27 13:17:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-04-27 13:17:17,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:17,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:17,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:17,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 597 states have (on average 1.2680067001675042) internal successors, (757), 606 states have internal predecessors, (757), 177 states have call successors, (177), 20 states have call predecessors, (177), 18 states have return successors, (175), 166 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:17:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1109 transitions. [2022-04-27 13:17:17,382 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1109 transitions. Word has length 91 [2022-04-27 13:17:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:17,382 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1109 transitions. [2022-04-27 13:17:17,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 18 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 17 states have call predecessors, (22), 18 states have call successors, (22) [2022-04-27 13:17:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1109 transitions. [2022-04-27 13:17:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 13:17:17,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:17,384 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-27 13:17:17,409 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-27 13:17:17,596 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-27 13:17:17,597 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 1 times [2022-04-27 13:17:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:17,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698555130] [2022-04-27 13:17:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:17,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:17,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789468581] [2022-04-27 13:17:17,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:17,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:17,618 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-27 13:17:17,619 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-27 13:17:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:17,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:17:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:17,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:18,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-27 13:17:18,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {13512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13520#(<= ~counter~0 0)} {13512#true} #102#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {13520#(<= ~counter~0 0)} call #t~ret9 := main(); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {13520#(<= ~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; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {13520#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {13520#(<= ~counter~0 0)} ~cond := #in~cond; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {13520#(<= ~counter~0 0)} assume !(0 == ~cond); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13520#(<= ~counter~0 0)} {13520#(<= ~counter~0 0)} #90#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,114 INFO L272 TraceCheckUtils]: 11: Hoare triple {13520#(<= ~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)); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {13520#(<= ~counter~0 0)} ~cond := #in~cond; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {13520#(<= ~counter~0 0)} assume !(0 == ~cond); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,115 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13520#(<= ~counter~0 0)} {13520#(<= ~counter~0 0)} #92#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {13520#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:18,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {13520#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {13569#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,117 INFO L272 TraceCheckUtils]: 19: Hoare triple {13569#(<= ~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)); {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {13569#(<= ~counter~0 1)} ~cond := #in~cond; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {13569#(<= ~counter~0 1)} assume !(0 == ~cond); {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {13569#(<= ~counter~0 1)} assume true; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,119 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13569#(<= ~counter~0 1)} {13569#(<= ~counter~0 1)} #94#return; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {13569#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:18,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {13569#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {13594#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,120 INFO L272 TraceCheckUtils]: 27: Hoare triple {13594#(<= ~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)); {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {13594#(<= ~counter~0 2)} ~cond := #in~cond; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {13594#(<= ~counter~0 2)} assume !(0 == ~cond); {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {13594#(<= ~counter~0 2)} assume true; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,121 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13594#(<= ~counter~0 2)} {13594#(<= ~counter~0 2)} #96#return; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {13594#(<= ~counter~0 2)} assume !(~r~0 > 0); {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:18,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {13594#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {13619#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,123 INFO L272 TraceCheckUtils]: 35: Hoare triple {13619#(<= ~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)); {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {13619#(<= ~counter~0 3)} ~cond := #in~cond; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {13619#(<= ~counter~0 3)} assume !(0 == ~cond); {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {13619#(<= ~counter~0 3)} assume true; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,124 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13619#(<= ~counter~0 3)} {13619#(<= ~counter~0 3)} #98#return; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {13619#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:18,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {13619#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {13644#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,125 INFO L272 TraceCheckUtils]: 43: Hoare triple {13644#(<= ~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)); {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {13644#(<= ~counter~0 4)} ~cond := #in~cond; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {13644#(<= ~counter~0 4)} assume !(0 == ~cond); {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {13644#(<= ~counter~0 4)} assume true; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,126 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13644#(<= ~counter~0 4)} {13644#(<= ~counter~0 4)} #98#return; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {13644#(<= ~counter~0 4)} assume !(~r~0 < 0); {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:18,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {13644#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:18,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {13669#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:18,128 INFO L272 TraceCheckUtils]: 51: Hoare triple {13669#(<= ~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)); {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:18,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {13669#(<= ~counter~0 5)} ~cond := #in~cond; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:18,128 INFO L290 TraceCheckUtils]: 53: Hoare triple {13669#(<= ~counter~0 5)} assume !(0 == ~cond); {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:18,128 INFO L290 TraceCheckUtils]: 54: Hoare triple {13669#(<= ~counter~0 5)} assume true; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:18,129 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13669#(<= ~counter~0 5)} {13669#(<= ~counter~0 5)} #94#return; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:18,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {13669#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:18,129 INFO L290 TraceCheckUtils]: 57: Hoare triple {13669#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:18,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {13694#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:18,130 INFO L272 TraceCheckUtils]: 59: Hoare triple {13694#(<= ~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)); {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:18,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {13694#(<= ~counter~0 6)} ~cond := #in~cond; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:18,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {13694#(<= ~counter~0 6)} assume !(0 == ~cond); {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:18,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {13694#(<= ~counter~0 6)} assume true; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:18,131 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13694#(<= ~counter~0 6)} {13694#(<= ~counter~0 6)} #96#return; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:18,132 INFO L290 TraceCheckUtils]: 64: Hoare triple {13694#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:18,132 INFO L290 TraceCheckUtils]: 65: Hoare triple {13694#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:18,132 INFO L290 TraceCheckUtils]: 66: Hoare triple {13719#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:18,133 INFO L272 TraceCheckUtils]: 67: Hoare triple {13719#(<= ~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)); {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:18,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {13719#(<= ~counter~0 7)} ~cond := #in~cond; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:18,134 INFO L290 TraceCheckUtils]: 69: Hoare triple {13719#(<= ~counter~0 7)} assume !(0 == ~cond); {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:18,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {13719#(<= ~counter~0 7)} assume true; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:18,135 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13719#(<= ~counter~0 7)} {13719#(<= ~counter~0 7)} #96#return; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:18,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {13719#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:18,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {13719#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:18,136 INFO L290 TraceCheckUtils]: 74: Hoare triple {13744#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:18,137 INFO L272 TraceCheckUtils]: 75: Hoare triple {13744#(<= ~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)); {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:18,137 INFO L290 TraceCheckUtils]: 76: Hoare triple {13744#(<= ~counter~0 8)} ~cond := #in~cond; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:18,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {13744#(<= ~counter~0 8)} assume !(0 == ~cond); {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:18,137 INFO L290 TraceCheckUtils]: 78: Hoare triple {13744#(<= ~counter~0 8)} assume true; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:18,138 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13744#(<= ~counter~0 8)} {13744#(<= ~counter~0 8)} #96#return; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:18,138 INFO L290 TraceCheckUtils]: 80: Hoare triple {13744#(<= ~counter~0 8)} assume !(~r~0 > 0); {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:18,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {13744#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:18,139 INFO L290 TraceCheckUtils]: 82: Hoare triple {13769#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:18,139 INFO L272 TraceCheckUtils]: 83: Hoare triple {13769#(<= ~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)); {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:18,139 INFO L290 TraceCheckUtils]: 84: Hoare triple {13769#(<= ~counter~0 9)} ~cond := #in~cond; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:18,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {13769#(<= ~counter~0 9)} assume !(0 == ~cond); {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:18,140 INFO L290 TraceCheckUtils]: 86: Hoare triple {13769#(<= ~counter~0 9)} assume true; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:18,140 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13769#(<= ~counter~0 9)} {13769#(<= ~counter~0 9)} #98#return; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:18,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {13769#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:18,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {13769#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13794#(<= |main_#t~post8| 9)} is VALID [2022-04-27 13:17:18,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {13794#(<= |main_#t~post8| 9)} assume !(#t~post8 < 20);havoc #t~post8; {13513#false} is VALID [2022-04-27 13:17:18,141 INFO L290 TraceCheckUtils]: 91: Hoare triple {13513#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13513#false} is VALID [2022-04-27 13:17:18,141 INFO L290 TraceCheckUtils]: 92: Hoare triple {13513#false} assume !(#t~post6 < 20);havoc #t~post6; {13513#false} is VALID [2022-04-27 13:17:18,141 INFO L272 TraceCheckUtils]: 93: Hoare triple {13513#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13513#false} is VALID [2022-04-27 13:17:18,141 INFO L290 TraceCheckUtils]: 94: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:17:18,141 INFO L290 TraceCheckUtils]: 95: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-27 13:17:18,142 INFO L290 TraceCheckUtils]: 96: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-27 13:17:18,142 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-27 13:17:18,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:18,653 INFO L290 TraceCheckUtils]: 96: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-27 13:17:18,654 INFO L290 TraceCheckUtils]: 95: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-27 13:17:18,654 INFO L290 TraceCheckUtils]: 94: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:17:18,654 INFO L272 TraceCheckUtils]: 93: Hoare triple {13513#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13513#false} is VALID [2022-04-27 13:17:18,654 INFO L290 TraceCheckUtils]: 92: Hoare triple {13513#false} assume !(#t~post6 < 20);havoc #t~post6; {13513#false} is VALID [2022-04-27 13:17:18,654 INFO L290 TraceCheckUtils]: 91: Hoare triple {13513#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13513#false} is VALID [2022-04-27 13:17:18,654 INFO L290 TraceCheckUtils]: 90: Hoare triple {13834#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {13513#false} is VALID [2022-04-27 13:17:18,654 INFO L290 TraceCheckUtils]: 89: Hoare triple {13838#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13834#(< |main_#t~post8| 20)} is VALID [2022-04-27 13:17:18,655 INFO L290 TraceCheckUtils]: 88: Hoare triple {13838#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13838#(< ~counter~0 20)} is VALID [2022-04-27 13:17:18,655 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13512#true} {13838#(< ~counter~0 20)} #98#return; {13838#(< ~counter~0 20)} is VALID [2022-04-27 13:17:18,655 INFO L290 TraceCheckUtils]: 86: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,655 INFO L290 TraceCheckUtils]: 84: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,655 INFO L272 TraceCheckUtils]: 83: Hoare triple {13838#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:18,656 INFO L290 TraceCheckUtils]: 82: Hoare triple {13838#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {13838#(< ~counter~0 20)} is VALID [2022-04-27 13:17:18,656 INFO L290 TraceCheckUtils]: 81: Hoare triple {13863#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13838#(< ~counter~0 20)} is VALID [2022-04-27 13:17:18,656 INFO L290 TraceCheckUtils]: 80: Hoare triple {13863#(< ~counter~0 19)} assume !(~r~0 > 0); {13863#(< ~counter~0 19)} is VALID [2022-04-27 13:17:18,657 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13512#true} {13863#(< ~counter~0 19)} #96#return; {13863#(< ~counter~0 19)} is VALID [2022-04-27 13:17:18,657 INFO L290 TraceCheckUtils]: 78: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,657 INFO L272 TraceCheckUtils]: 75: Hoare triple {13863#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:18,657 INFO L290 TraceCheckUtils]: 74: Hoare triple {13863#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {13863#(< ~counter~0 19)} is VALID [2022-04-27 13:17:18,658 INFO L290 TraceCheckUtils]: 73: Hoare triple {13888#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13863#(< ~counter~0 19)} is VALID [2022-04-27 13:17:18,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {13888#(< ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13888#(< ~counter~0 18)} is VALID [2022-04-27 13:17:18,658 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13512#true} {13888#(< ~counter~0 18)} #96#return; {13888#(< ~counter~0 18)} is VALID [2022-04-27 13:17:18,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,659 INFO L290 TraceCheckUtils]: 69: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,659 INFO L290 TraceCheckUtils]: 68: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,659 INFO L272 TraceCheckUtils]: 67: Hoare triple {13888#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:18,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {13888#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {13888#(< ~counter~0 18)} is VALID [2022-04-27 13:17:18,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {13913#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13888#(< ~counter~0 18)} is VALID [2022-04-27 13:17:18,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {13913#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13913#(< ~counter~0 17)} is VALID [2022-04-27 13:17:18,660 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13512#true} {13913#(< ~counter~0 17)} #96#return; {13913#(< ~counter~0 17)} is VALID [2022-04-27 13:17:18,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,660 INFO L272 TraceCheckUtils]: 59: Hoare triple {13913#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:18,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {13913#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {13913#(< ~counter~0 17)} is VALID [2022-04-27 13:17:18,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {13938#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13913#(< ~counter~0 17)} is VALID [2022-04-27 13:17:18,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {13938#(< ~counter~0 16)} assume !!(0 != ~r~0); {13938#(< ~counter~0 16)} is VALID [2022-04-27 13:17:18,661 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13512#true} {13938#(< ~counter~0 16)} #94#return; {13938#(< ~counter~0 16)} is VALID [2022-04-27 13:17:18,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,662 INFO L272 TraceCheckUtils]: 51: Hoare triple {13938#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:18,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {13938#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {13938#(< ~counter~0 16)} is VALID [2022-04-27 13:17:18,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {13963#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13938#(< ~counter~0 16)} is VALID [2022-04-27 13:17:18,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {13963#(< ~counter~0 15)} assume !(~r~0 < 0); {13963#(< ~counter~0 15)} is VALID [2022-04-27 13:17:18,663 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13512#true} {13963#(< ~counter~0 15)} #98#return; {13963#(< ~counter~0 15)} is VALID [2022-04-27 13:17:18,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,663 INFO L272 TraceCheckUtils]: 43: Hoare triple {13963#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:18,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {13963#(< ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {13963#(< ~counter~0 15)} is VALID [2022-04-27 13:17:18,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {13988#(< ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13963#(< ~counter~0 15)} is VALID [2022-04-27 13:17:18,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {13988#(< ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13988#(< ~counter~0 14)} is VALID [2022-04-27 13:17:18,674 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13512#true} {13988#(< ~counter~0 14)} #98#return; {13988#(< ~counter~0 14)} is VALID [2022-04-27 13:17:18,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,674 INFO L272 TraceCheckUtils]: 35: Hoare triple {13988#(< ~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)); {13512#true} is VALID [2022-04-27 13:17:18,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {13988#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {13988#(< ~counter~0 14)} is VALID [2022-04-27 13:17:18,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {14013#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13988#(< ~counter~0 14)} is VALID [2022-04-27 13:17:18,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {14013#(< ~counter~0 13)} assume !(~r~0 > 0); {14013#(< ~counter~0 13)} is VALID [2022-04-27 13:17:18,675 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13512#true} {14013#(< ~counter~0 13)} #96#return; {14013#(< ~counter~0 13)} is VALID [2022-04-27 13:17:18,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,676 INFO L272 TraceCheckUtils]: 27: Hoare triple {14013#(< ~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)); {13512#true} is VALID [2022-04-27 13:17:18,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {14013#(< ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {14013#(< ~counter~0 13)} is VALID [2022-04-27 13:17:18,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {14038#(< ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14013#(< ~counter~0 13)} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {14038#(< ~counter~0 12)} assume !!(0 != ~r~0); {14038#(< ~counter~0 12)} is VALID [2022-04-27 13:17:18,677 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13512#true} {14038#(< ~counter~0 12)} #94#return; {14038#(< ~counter~0 12)} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,677 INFO L272 TraceCheckUtils]: 19: Hoare triple {14038#(< ~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)); {13512#true} is VALID [2022-04-27 13:17:18,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {14038#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {14038#(< ~counter~0 12)} is VALID [2022-04-27 13:17:18,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {14063#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14038#(< ~counter~0 12)} is VALID [2022-04-27 13:17:18,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {14063#(< ~counter~0 11)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14063#(< ~counter~0 11)} is VALID [2022-04-27 13:17:18,678 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13512#true} {14063#(< ~counter~0 11)} #92#return; {14063#(< ~counter~0 11)} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {14063#(< ~counter~0 11)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:18,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13512#true} {14063#(< ~counter~0 11)} #90#return; {14063#(< ~counter~0 11)} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:17:18,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {14063#(< ~counter~0 11)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:17:18,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {14063#(< ~counter~0 11)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14063#(< ~counter~0 11)} is VALID [2022-04-27 13:17:18,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {14063#(< ~counter~0 11)} call #t~ret9 := main(); {14063#(< ~counter~0 11)} is VALID [2022-04-27 13:17:18,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14063#(< ~counter~0 11)} {13512#true} #102#return; {14063#(< ~counter~0 11)} is VALID [2022-04-27 13:17:18,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {14063#(< ~counter~0 11)} assume true; {14063#(< ~counter~0 11)} is VALID [2022-04-27 13:17:18,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {13512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14063#(< ~counter~0 11)} is VALID [2022-04-27 13:17:18,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-27 13:17:18,681 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-27 13:17:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:18,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698555130] [2022-04-27 13:17:18,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:18,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789468581] [2022-04-27 13:17:18,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789468581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:18,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:18,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-27 13:17:18,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156002459] [2022-04-27 13:17:18,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:18,682 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) Word has length 97 [2022-04-27 13:17:18,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:18,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:18,784 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-27 13:17:18,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:17:18,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:17:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:17:18,785 INFO L87 Difference]: Start difference. First operand 793 states and 1109 transitions. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:20,989 INFO L93 Difference]: Finished difference Result 1285 states and 1799 transitions. [2022-04-27 13:17:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-27 13:17:20,989 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) Word has length 97 [2022-04-27 13:17:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-27 13:17:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-27 13:17:20,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 467 transitions. [2022-04-27 13:17:21,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:21,334 INFO L225 Difference]: With dead ends: 1285 [2022-04-27 13:17:21,334 INFO L226 Difference]: Without dead ends: 795 [2022-04-27 13:17:21,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 13:17:21,335 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 597 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:21,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 507 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:17:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-27 13:17:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 740. [2022-04-27 13:17:21,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:21,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:21,765 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:21,770 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:21,793 INFO L93 Difference]: Finished difference Result 795 states and 1047 transitions. [2022-04-27 13:17:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1047 transitions. [2022-04-27 13:17:21,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:21,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:21,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) Second operand 795 states. [2022-04-27 13:17:21,797 INFO L87 Difference]: Start difference. First operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) Second operand 795 states. [2022-04-27 13:17:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:21,820 INFO L93 Difference]: Finished difference Result 795 states and 1047 transitions. [2022-04-27 13:17:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1047 transitions. [2022-04-27 13:17:21,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:21,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:21,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:21,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 553 states have (on average 1.2206148282097649) internal successors, (675), 557 states have internal predecessors, (675), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 158 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1001 transitions. [2022-04-27 13:17:21,846 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1001 transitions. Word has length 97 [2022-04-27 13:17:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:21,848 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1001 transitions. [2022-04-27 13:17:21,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2022-04-27 13:17:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1001 transitions. [2022-04-27 13:17:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 13:17:21,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:21,849 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-27 13:17:21,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:22,055 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-27 13:17:22,055 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 1 times [2022-04-27 13:17:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340463523] [2022-04-27 13:17:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:22,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:22,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719672351] [2022-04-27 13:17:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:22,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:22,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:22,081 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-27 13:17:22,081 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-27 13:17:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:22,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:17:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:22,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:22,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-27 13:17:22,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18589#(<= ~counter~0 0)} {18581#true} #102#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {18589#(<= ~counter~0 0)} call #t~ret9 := main(); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {18589#(<= ~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; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,649 INFO L272 TraceCheckUtils]: 6: Hoare triple {18589#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {18589#(<= ~counter~0 0)} ~cond := #in~cond; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {18589#(<= ~counter~0 0)} assume !(0 == ~cond); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18589#(<= ~counter~0 0)} {18589#(<= ~counter~0 0)} #90#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,651 INFO L272 TraceCheckUtils]: 11: Hoare triple {18589#(<= ~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)); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {18589#(<= ~counter~0 0)} ~cond := #in~cond; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {18589#(<= ~counter~0 0)} assume !(0 == ~cond); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,652 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18589#(<= ~counter~0 0)} {18589#(<= ~counter~0 0)} #92#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {18589#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:22,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {18589#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:22,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {18638#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:22,653 INFO L272 TraceCheckUtils]: 19: Hoare triple {18638#(<= ~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)); {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:22,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {18638#(<= ~counter~0 1)} ~cond := #in~cond; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:22,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {18638#(<= ~counter~0 1)} assume !(0 == ~cond); {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:22,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {18638#(<= ~counter~0 1)} assume true; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:22,654 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18638#(<= ~counter~0 1)} {18638#(<= ~counter~0 1)} #94#return; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:22,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {18638#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:22,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {18638#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:22,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {18663#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:22,656 INFO L272 TraceCheckUtils]: 27: Hoare triple {18663#(<= ~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)); {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:22,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {18663#(<= ~counter~0 2)} ~cond := #in~cond; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:22,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {18663#(<= ~counter~0 2)} assume !(0 == ~cond); {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:22,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {18663#(<= ~counter~0 2)} assume true; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:22,657 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18663#(<= ~counter~0 2)} {18663#(<= ~counter~0 2)} #96#return; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:22,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {18663#(<= ~counter~0 2)} assume !(~r~0 > 0); {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:22,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {18663#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:22,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {18688#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:22,659 INFO L272 TraceCheckUtils]: 35: Hoare triple {18688#(<= ~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)); {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:22,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {18688#(<= ~counter~0 3)} ~cond := #in~cond; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:22,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {18688#(<= ~counter~0 3)} assume !(0 == ~cond); {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:22,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {18688#(<= ~counter~0 3)} assume true; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:22,660 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18688#(<= ~counter~0 3)} {18688#(<= ~counter~0 3)} #98#return; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:22,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {18688#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:22,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {18688#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:22,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {18713#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:22,662 INFO L272 TraceCheckUtils]: 43: Hoare triple {18713#(<= ~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)); {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:22,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {18713#(<= ~counter~0 4)} ~cond := #in~cond; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:22,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {18713#(<= ~counter~0 4)} assume !(0 == ~cond); {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:22,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {18713#(<= ~counter~0 4)} assume true; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:22,663 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18713#(<= ~counter~0 4)} {18713#(<= ~counter~0 4)} #98#return; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:22,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {18713#(<= ~counter~0 4)} assume !(~r~0 < 0); {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:22,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {18713#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:22,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {18738#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:22,664 INFO L272 TraceCheckUtils]: 51: Hoare triple {18738#(<= ~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)); {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:22,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {18738#(<= ~counter~0 5)} ~cond := #in~cond; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:22,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {18738#(<= ~counter~0 5)} assume !(0 == ~cond); {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:22,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {18738#(<= ~counter~0 5)} assume true; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:22,665 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18738#(<= ~counter~0 5)} {18738#(<= ~counter~0 5)} #94#return; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:22,666 INFO L290 TraceCheckUtils]: 56: Hoare triple {18738#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:22,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {18738#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:22,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {18763#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:22,667 INFO L272 TraceCheckUtils]: 59: Hoare triple {18763#(<= ~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)); {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:22,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {18763#(<= ~counter~0 6)} ~cond := #in~cond; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:22,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {18763#(<= ~counter~0 6)} assume !(0 == ~cond); {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:22,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {18763#(<= ~counter~0 6)} assume true; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:22,668 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18763#(<= ~counter~0 6)} {18763#(<= ~counter~0 6)} #96#return; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:22,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {18763#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:22,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {18763#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:22,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {18788#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:22,669 INFO L272 TraceCheckUtils]: 67: Hoare triple {18788#(<= ~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)); {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:22,670 INFO L290 TraceCheckUtils]: 68: Hoare triple {18788#(<= ~counter~0 7)} ~cond := #in~cond; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:22,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {18788#(<= ~counter~0 7)} assume !(0 == ~cond); {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:22,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {18788#(<= ~counter~0 7)} assume true; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:22,671 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18788#(<= ~counter~0 7)} {18788#(<= ~counter~0 7)} #96#return; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:22,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {18788#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:22,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {18788#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:22,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {18813#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:22,672 INFO L272 TraceCheckUtils]: 75: Hoare triple {18813#(<= ~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)); {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:22,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {18813#(<= ~counter~0 8)} ~cond := #in~cond; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:22,673 INFO L290 TraceCheckUtils]: 77: Hoare triple {18813#(<= ~counter~0 8)} assume !(0 == ~cond); {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:22,673 INFO L290 TraceCheckUtils]: 78: Hoare triple {18813#(<= ~counter~0 8)} assume true; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:22,673 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18813#(<= ~counter~0 8)} {18813#(<= ~counter~0 8)} #96#return; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:22,674 INFO L290 TraceCheckUtils]: 80: Hoare triple {18813#(<= ~counter~0 8)} assume !(~r~0 > 0); {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:22,674 INFO L290 TraceCheckUtils]: 81: Hoare triple {18813#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:22,674 INFO L290 TraceCheckUtils]: 82: Hoare triple {18838#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:22,675 INFO L272 TraceCheckUtils]: 83: Hoare triple {18838#(<= ~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)); {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:22,675 INFO L290 TraceCheckUtils]: 84: Hoare triple {18838#(<= ~counter~0 9)} ~cond := #in~cond; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:22,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {18838#(<= ~counter~0 9)} assume !(0 == ~cond); {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:22,675 INFO L290 TraceCheckUtils]: 86: Hoare triple {18838#(<= ~counter~0 9)} assume true; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:22,676 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18838#(<= ~counter~0 9)} {18838#(<= ~counter~0 9)} #98#return; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:22,676 INFO L290 TraceCheckUtils]: 88: Hoare triple {18838#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:22,677 INFO L290 TraceCheckUtils]: 89: Hoare triple {18838#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:22,677 INFO L290 TraceCheckUtils]: 90: Hoare triple {18863#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:22,677 INFO L272 TraceCheckUtils]: 91: Hoare triple {18863#(<= ~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)); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:22,678 INFO L290 TraceCheckUtils]: 92: Hoare triple {18863#(<= ~counter~0 10)} ~cond := #in~cond; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:22,678 INFO L290 TraceCheckUtils]: 93: Hoare triple {18863#(<= ~counter~0 10)} assume !(0 == ~cond); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:22,678 INFO L290 TraceCheckUtils]: 94: Hoare triple {18863#(<= ~counter~0 10)} assume true; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:22,678 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18863#(<= ~counter~0 10)} {18863#(<= ~counter~0 10)} #98#return; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:22,679 INFO L290 TraceCheckUtils]: 96: Hoare triple {18863#(<= ~counter~0 10)} assume !(~r~0 < 0); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:22,679 INFO L290 TraceCheckUtils]: 97: Hoare triple {18863#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18888#(<= |main_#t~post6| 10)} is VALID [2022-04-27 13:17:22,679 INFO L290 TraceCheckUtils]: 98: Hoare triple {18888#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {18582#false} is VALID [2022-04-27 13:17:22,679 INFO L272 TraceCheckUtils]: 99: Hoare triple {18582#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18582#false} is VALID [2022-04-27 13:17:22,680 INFO L290 TraceCheckUtils]: 100: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 13:17:22,680 INFO L290 TraceCheckUtils]: 101: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 13:17:22,680 INFO L290 TraceCheckUtils]: 102: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 13:17:22,680 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-27 13:17:22,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:23,194 INFO L290 TraceCheckUtils]: 102: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 13:17:23,194 INFO L290 TraceCheckUtils]: 101: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 13:17:23,194 INFO L290 TraceCheckUtils]: 100: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 13:17:23,195 INFO L272 TraceCheckUtils]: 99: Hoare triple {18582#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18582#false} is VALID [2022-04-27 13:17:23,195 INFO L290 TraceCheckUtils]: 98: Hoare triple {18916#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {18582#false} is VALID [2022-04-27 13:17:23,195 INFO L290 TraceCheckUtils]: 97: Hoare triple {18920#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18916#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:17:23,195 INFO L290 TraceCheckUtils]: 96: Hoare triple {18920#(< ~counter~0 20)} assume !(~r~0 < 0); {18920#(< ~counter~0 20)} is VALID [2022-04-27 13:17:23,196 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18581#true} {18920#(< ~counter~0 20)} #98#return; {18920#(< ~counter~0 20)} is VALID [2022-04-27 13:17:23,196 INFO L290 TraceCheckUtils]: 94: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,196 INFO L290 TraceCheckUtils]: 93: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,196 INFO L290 TraceCheckUtils]: 92: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,196 INFO L272 TraceCheckUtils]: 91: Hoare triple {18920#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:23,196 INFO L290 TraceCheckUtils]: 90: Hoare triple {18920#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {18920#(< ~counter~0 20)} is VALID [2022-04-27 13:17:23,197 INFO L290 TraceCheckUtils]: 89: Hoare triple {18945#(< ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18920#(< ~counter~0 20)} is VALID [2022-04-27 13:17:23,197 INFO L290 TraceCheckUtils]: 88: Hoare triple {18945#(< ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18945#(< ~counter~0 19)} is VALID [2022-04-27 13:17:23,198 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18581#true} {18945#(< ~counter~0 19)} #98#return; {18945#(< ~counter~0 19)} is VALID [2022-04-27 13:17:23,198 INFO L290 TraceCheckUtils]: 86: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,198 INFO L290 TraceCheckUtils]: 85: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,198 INFO L290 TraceCheckUtils]: 84: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,198 INFO L272 TraceCheckUtils]: 83: Hoare triple {18945#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:23,198 INFO L290 TraceCheckUtils]: 82: Hoare triple {18945#(< ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {18945#(< ~counter~0 19)} is VALID [2022-04-27 13:17:23,199 INFO L290 TraceCheckUtils]: 81: Hoare triple {18970#(< ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18945#(< ~counter~0 19)} is VALID [2022-04-27 13:17:23,199 INFO L290 TraceCheckUtils]: 80: Hoare triple {18970#(< ~counter~0 18)} assume !(~r~0 > 0); {18970#(< ~counter~0 18)} is VALID [2022-04-27 13:17:23,200 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18581#true} {18970#(< ~counter~0 18)} #96#return; {18970#(< ~counter~0 18)} is VALID [2022-04-27 13:17:23,200 INFO L290 TraceCheckUtils]: 78: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,200 INFO L290 TraceCheckUtils]: 77: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,200 INFO L290 TraceCheckUtils]: 76: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,200 INFO L272 TraceCheckUtils]: 75: Hoare triple {18970#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:23,200 INFO L290 TraceCheckUtils]: 74: Hoare triple {18970#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {18970#(< ~counter~0 18)} is VALID [2022-04-27 13:17:23,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {18995#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18970#(< ~counter~0 18)} is VALID [2022-04-27 13:17:23,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {18995#(< ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18995#(< ~counter~0 17)} is VALID [2022-04-27 13:17:23,201 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18581#true} {18995#(< ~counter~0 17)} #96#return; {18995#(< ~counter~0 17)} is VALID [2022-04-27 13:17:23,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,202 INFO L272 TraceCheckUtils]: 67: Hoare triple {18995#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:23,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {18995#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {18995#(< ~counter~0 17)} is VALID [2022-04-27 13:17:23,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {19020#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18995#(< ~counter~0 17)} is VALID [2022-04-27 13:17:23,203 INFO L290 TraceCheckUtils]: 64: Hoare triple {19020#(< ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19020#(< ~counter~0 16)} is VALID [2022-04-27 13:17:23,203 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18581#true} {19020#(< ~counter~0 16)} #96#return; {19020#(< ~counter~0 16)} is VALID [2022-04-27 13:17:23,203 INFO L290 TraceCheckUtils]: 62: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,203 INFO L290 TraceCheckUtils]: 61: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,203 INFO L290 TraceCheckUtils]: 60: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,203 INFO L272 TraceCheckUtils]: 59: Hoare triple {19020#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:23,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {19020#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {19020#(< ~counter~0 16)} is VALID [2022-04-27 13:17:23,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {19045#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19020#(< ~counter~0 16)} is VALID [2022-04-27 13:17:23,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {19045#(< ~counter~0 15)} assume !!(0 != ~r~0); {19045#(< ~counter~0 15)} is VALID [2022-04-27 13:17:23,205 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18581#true} {19045#(< ~counter~0 15)} #94#return; {19045#(< ~counter~0 15)} is VALID [2022-04-27 13:17:23,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,205 INFO L272 TraceCheckUtils]: 51: Hoare triple {19045#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:23,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {19045#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {19045#(< ~counter~0 15)} is VALID [2022-04-27 13:17:23,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {19070#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19045#(< ~counter~0 15)} is VALID [2022-04-27 13:17:23,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {19070#(< ~counter~0 14)} assume !(~r~0 < 0); {19070#(< ~counter~0 14)} is VALID [2022-04-27 13:17:23,206 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18581#true} {19070#(< ~counter~0 14)} #98#return; {19070#(< ~counter~0 14)} is VALID [2022-04-27 13:17:23,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,207 INFO L272 TraceCheckUtils]: 43: Hoare triple {19070#(< ~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)); {18581#true} is VALID [2022-04-27 13:17:23,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {19070#(< ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {19070#(< ~counter~0 14)} is VALID [2022-04-27 13:17:23,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {19095#(< ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19070#(< ~counter~0 14)} is VALID [2022-04-27 13:17:23,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {19095#(< ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19095#(< ~counter~0 13)} is VALID [2022-04-27 13:17:23,208 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18581#true} {19095#(< ~counter~0 13)} #98#return; {19095#(< ~counter~0 13)} is VALID [2022-04-27 13:17:23,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,208 INFO L272 TraceCheckUtils]: 35: Hoare triple {19095#(< ~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)); {18581#true} is VALID [2022-04-27 13:17:23,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {19095#(< ~counter~0 13)} assume !!(#t~post8 < 20);havoc #t~post8; {19095#(< ~counter~0 13)} is VALID [2022-04-27 13:17:23,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {19120#(< ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19095#(< ~counter~0 13)} is VALID [2022-04-27 13:17:23,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {19120#(< ~counter~0 12)} assume !(~r~0 > 0); {19120#(< ~counter~0 12)} is VALID [2022-04-27 13:17:23,210 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18581#true} {19120#(< ~counter~0 12)} #96#return; {19120#(< ~counter~0 12)} is VALID [2022-04-27 13:17:23,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,210 INFO L272 TraceCheckUtils]: 27: Hoare triple {19120#(< ~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)); {18581#true} is VALID [2022-04-27 13:17:23,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {19120#(< ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {19120#(< ~counter~0 12)} is VALID [2022-04-27 13:17:23,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {18863#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19120#(< ~counter~0 12)} is VALID [2022-04-27 13:17:23,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {18863#(<= ~counter~0 10)} assume !!(0 != ~r~0); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:23,218 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18581#true} {18863#(<= ~counter~0 10)} #94#return; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:23,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,218 INFO L272 TraceCheckUtils]: 19: Hoare triple {18863#(<= ~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)); {18581#true} is VALID [2022-04-27 13:17:23,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {18863#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:23,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {18838#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:23,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {18838#(<= ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:23,219 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18581#true} {18838#(<= ~counter~0 9)} #92#return; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:23,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,220 INFO L272 TraceCheckUtils]: 11: Hoare triple {18838#(<= ~counter~0 9)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:23,220 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18581#true} {18838#(<= ~counter~0 9)} #90#return; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:23,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:17:23,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:17:23,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:17:23,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {18838#(<= ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:17:23,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {18838#(<= ~counter~0 9)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:23,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {18838#(<= ~counter~0 9)} call #t~ret9 := main(); {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:23,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18838#(<= ~counter~0 9)} {18581#true} #102#return; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:23,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {18838#(<= ~counter~0 9)} assume true; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:23,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:23,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-27 13:17:23,222 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-27 13:17:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:23,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340463523] [2022-04-27 13:17:23,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:23,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719672351] [2022-04-27 13:17:23,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719672351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:23,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:23,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-27 13:17:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143791529] [2022-04-27 13:17:23,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:23,224 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 103 [2022-04-27 13:17:23,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:23,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 13:17:23,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:23,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:17:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:23,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:17:23,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:17:23,335 INFO L87 Difference]: Start difference. First operand 740 states and 1001 transitions. Second operand has 24 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 13:17:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:25,217 INFO L93 Difference]: Finished difference Result 757 states and 1019 transitions. [2022-04-27 13:17:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-27 13:17:25,218 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 103 [2022-04-27 13:17:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 13:17:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 407 transitions. [2022-04-27 13:17:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 13:17:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 407 transitions. [2022-04-27 13:17:25,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 407 transitions. [2022-04-27 13:17:25,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:25,541 INFO L225 Difference]: With dead ends: 757 [2022-04-27 13:17:25,541 INFO L226 Difference]: Without dead ends: 752 [2022-04-27 13:17:25,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=551, Invalid=1009, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 13:17:25,543 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 478 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:25,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 499 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 13:17:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-04-27 13:17:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 746. [2022-04-27 13:17:25,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:25,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 752 states. Second operand has 746 states, 559 states have (on average 1.186046511627907) internal successors, (663), 561 states have internal predecessors, (663), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:25,935 INFO L74 IsIncluded]: Start isIncluded. First operand 752 states. Second operand has 746 states, 559 states have (on average 1.186046511627907) internal successors, (663), 561 states have internal predecessors, (663), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:25,936 INFO L87 Difference]: Start difference. First operand 752 states. Second operand has 746 states, 559 states have (on average 1.186046511627907) internal successors, (663), 561 states have internal predecessors, (663), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:25,954 INFO L93 Difference]: Finished difference Result 752 states and 995 transitions. [2022-04-27 13:17:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 995 transitions. [2022-04-27 13:17:25,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:25,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:25,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 746 states, 559 states have (on average 1.186046511627907) internal successors, (663), 561 states have internal predecessors, (663), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) Second operand 752 states. [2022-04-27 13:17:25,958 INFO L87 Difference]: Start difference. First operand has 746 states, 559 states have (on average 1.186046511627907) internal successors, (663), 561 states have internal predecessors, (663), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) Second operand 752 states. [2022-04-27 13:17:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:25,978 INFO L93 Difference]: Finished difference Result 752 states and 995 transitions. [2022-04-27 13:17:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 995 transitions. [2022-04-27 13:17:25,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:25,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:25,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:25,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 559 states have (on average 1.186046511627907) internal successors, (663), 561 states have internal predecessors, (663), 164 states have call successors, (164), 24 states have call predecessors, (164), 22 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:17:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 989 transitions. [2022-04-27 13:17:26,004 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 989 transitions. Word has length 103 [2022-04-27 13:17:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:26,004 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 989 transitions. [2022-04-27 13:17:26,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 13:17:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 989 transitions. [2022-04-27 13:17:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-27 13:17:26,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:26,007 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:26,023 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-27 13:17:26,223 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-27 13:17:26,223 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1139261776, now seen corresponding path program 3 times [2022-04-27 13:17:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:26,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707427885] [2022-04-27 13:17:26,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:26,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:26,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578321447] [2022-04-27 13:17:26,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:17:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:26,241 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-27 13:17:26,242 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-27 13:17:26,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:17:26,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:26,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 13:17:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:26,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:26,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {22859#true} call ULTIMATE.init(); {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {22859#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22859#true} {22859#true} #102#return; {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {22859#true} call #t~ret9 := main(); {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {22859#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; {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {22859#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22859#true} {22859#true} #90#return; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L272 TraceCheckUtils]: 11: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22859#true} {22859#true} #92#return; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {22859#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {22859#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {22859#true} assume !!(#t~post6 < 20);havoc #t~post6; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L272 TraceCheckUtils]: 19: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22859#true} {22859#true} #94#return; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {22859#true} assume !!(0 != ~r~0); {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {22859#true} assume !!(#t~post7 < 20);havoc #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L272 TraceCheckUtils]: 27: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22859#true} {22859#true} #96#return; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {22859#true} assume !(~r~0 > 0); {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {22859#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {22859#true} assume !!(#t~post8 < 20);havoc #t~post8; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L272 TraceCheckUtils]: 35: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22859#true} {22859#true} #98#return; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {22859#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {22859#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {22859#true} assume !!(#t~post8 < 20);havoc #t~post8; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L272 TraceCheckUtils]: 43: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22859#true} {22859#true} #98#return; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {22859#true} assume !(~r~0 < 0); {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {22859#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {22859#true} assume !!(#t~post6 < 20);havoc #t~post6; {22859#true} is VALID [2022-04-27 13:17:26,697 INFO L272 TraceCheckUtils]: 51: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22859#true} {22859#true} #94#return; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {22859#true} assume !!(0 != ~r~0); {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {22859#true} assume !!(#t~post7 < 20);havoc #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L272 TraceCheckUtils]: 59: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 61: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 62: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22859#true} {22859#true} #96#return; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 64: Hoare triple {22859#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 65: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 66: Hoare triple {22859#true} assume !!(#t~post7 < 20);havoc #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L272 TraceCheckUtils]: 67: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 68: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 69: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 70: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22859#true} {22859#true} #96#return; {22859#true} is VALID [2022-04-27 13:17:26,698 INFO L290 TraceCheckUtils]: 72: Hoare triple {22859#true} assume !(~r~0 > 0); {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 73: Hoare triple {22859#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 74: Hoare triple {22859#true} assume !!(#t~post8 < 20);havoc #t~post8; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L272 TraceCheckUtils]: 75: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 78: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22859#true} {22859#true} #98#return; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 80: Hoare triple {22859#true} assume !(~r~0 < 0); {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 81: Hoare triple {22859#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {22859#true} assume !!(#t~post6 < 20);havoc #t~post6; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L272 TraceCheckUtils]: 83: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 84: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 85: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 86: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {22859#true} {22859#true} #94#return; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 88: Hoare triple {22859#true} assume !!(0 != ~r~0); {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 89: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 90: Hoare triple {22859#true} assume !!(#t~post7 < 20);havoc #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L272 TraceCheckUtils]: 91: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,699 INFO L290 TraceCheckUtils]: 92: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 93: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 94: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {22859#true} {22859#true} #96#return; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 96: Hoare triple {22859#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 97: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 98: Hoare triple {22859#true} assume !!(#t~post7 < 20);havoc #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L272 TraceCheckUtils]: 99: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 100: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 101: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 102: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22859#true} {22859#true} #96#return; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {22859#true} assume !(~r~0 > 0); {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 105: Hoare triple {22859#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 106: Hoare triple {22859#true} assume !!(#t~post8 < 20);havoc #t~post8; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L272 TraceCheckUtils]: 107: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 108: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 109: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 110: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22859#true} {22859#true} #98#return; {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 112: Hoare triple {22859#true} assume !(~r~0 < 0); {22859#true} is VALID [2022-04-27 13:17:26,700 INFO L290 TraceCheckUtils]: 113: Hoare triple {22859#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 114: Hoare triple {22859#true} assume !!(#t~post6 < 20);havoc #t~post6; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L272 TraceCheckUtils]: 115: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 116: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 117: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 118: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {22859#true} {22859#true} #94#return; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 120: Hoare triple {22859#true} assume !!(0 != ~r~0); {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 121: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 122: Hoare triple {22859#true} assume !!(#t~post7 < 20);havoc #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L272 TraceCheckUtils]: 123: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 124: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 125: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 126: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22859#true} {22859#true} #96#return; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 128: Hoare triple {22859#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 129: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 130: Hoare triple {22859#true} assume !!(#t~post7 < 20);havoc #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L272 TraceCheckUtils]: 131: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 132: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 133: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,701 INFO L290 TraceCheckUtils]: 134: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {22859#true} {22859#true} #96#return; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L290 TraceCheckUtils]: 136: Hoare triple {22859#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L290 TraceCheckUtils]: 137: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L290 TraceCheckUtils]: 138: Hoare triple {22859#true} assume !!(#t~post7 < 20);havoc #t~post7; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L272 TraceCheckUtils]: 139: Hoare triple {22859#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)); {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L290 TraceCheckUtils]: 140: Hoare triple {22859#true} ~cond := #in~cond; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L290 TraceCheckUtils]: 141: Hoare triple {22859#true} assume !(0 == ~cond); {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L290 TraceCheckUtils]: 142: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {22859#true} {22859#true} #96#return; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L290 TraceCheckUtils]: 144: Hoare triple {22859#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22859#true} is VALID [2022-04-27 13:17:26,702 INFO L290 TraceCheckUtils]: 145: Hoare triple {22859#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23299#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-27 13:17:26,703 INFO L290 TraceCheckUtils]: 146: Hoare triple {23299#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 20);havoc #t~post7; {23303#(<= 21 ~counter~0)} is VALID [2022-04-27 13:17:26,703 INFO L290 TraceCheckUtils]: 147: Hoare triple {23303#(<= 21 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23307#(<= 22 ~counter~0)} is VALID [2022-04-27 13:17:26,703 INFO L290 TraceCheckUtils]: 148: Hoare triple {23307#(<= 22 ~counter~0)} assume !!(#t~post8 < 20);havoc #t~post8; {23307#(<= 22 ~counter~0)} is VALID [2022-04-27 13:17:26,704 INFO L272 TraceCheckUtils]: 149: Hoare triple {23307#(<= 22 ~counter~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)); {23307#(<= 22 ~counter~0)} is VALID [2022-04-27 13:17:26,704 INFO L290 TraceCheckUtils]: 150: Hoare triple {23307#(<= 22 ~counter~0)} ~cond := #in~cond; {23307#(<= 22 ~counter~0)} is VALID [2022-04-27 13:17:26,704 INFO L290 TraceCheckUtils]: 151: Hoare triple {23307#(<= 22 ~counter~0)} assume !(0 == ~cond); {23307#(<= 22 ~counter~0)} is VALID [2022-04-27 13:17:26,705 INFO L290 TraceCheckUtils]: 152: Hoare triple {23307#(<= 22 ~counter~0)} assume true; {23307#(<= 22 ~counter~0)} is VALID [2022-04-27 13:17:26,705 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {23307#(<= 22 ~counter~0)} {23307#(<= 22 ~counter~0)} #98#return; {23307#(<= 22 ~counter~0)} is VALID [2022-04-27 13:17:26,705 INFO L290 TraceCheckUtils]: 154: Hoare triple {23307#(<= 22 ~counter~0)} assume !(~r~0 < 0); {23307#(<= 22 ~counter~0)} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 155: Hoare triple {23307#(<= 22 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23332#(<= 22 |main_#t~post6|)} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 156: Hoare triple {23332#(<= 22 |main_#t~post6|)} assume !!(#t~post6 < 20);havoc #t~post6; {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L272 TraceCheckUtils]: 157: Hoare triple {22860#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 158: Hoare triple {22860#false} ~cond := #in~cond; {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 159: Hoare triple {22860#false} assume !(0 == ~cond); {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 160: Hoare triple {22860#false} assume true; {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {22860#false} {22860#false} #94#return; {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 162: Hoare triple {22860#false} assume !!(0 != ~r~0); {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 163: Hoare triple {22860#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 164: Hoare triple {22860#false} assume !(#t~post7 < 20);havoc #t~post7; {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 165: Hoare triple {22860#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 166: Hoare triple {22860#false} assume !(#t~post8 < 20);havoc #t~post8; {22860#false} is VALID [2022-04-27 13:17:26,706 INFO L290 TraceCheckUtils]: 167: Hoare triple {22860#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22860#false} is VALID [2022-04-27 13:17:26,707 INFO L290 TraceCheckUtils]: 168: Hoare triple {22860#false} assume !(#t~post6 < 20);havoc #t~post6; {22860#false} is VALID [2022-04-27 13:17:26,707 INFO L272 TraceCheckUtils]: 169: Hoare triple {22860#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22860#false} is VALID [2022-04-27 13:17:26,707 INFO L290 TraceCheckUtils]: 170: Hoare triple {22860#false} ~cond := #in~cond; {22860#false} is VALID [2022-04-27 13:17:26,707 INFO L290 TraceCheckUtils]: 171: Hoare triple {22860#false} assume 0 == ~cond; {22860#false} is VALID [2022-04-27 13:17:26,707 INFO L290 TraceCheckUtils]: 172: Hoare triple {22860#false} assume !false; {22860#false} is VALID [2022-04-27 13:17:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2022-04-27 13:17:26,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:26,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707427885] [2022-04-27 13:17:26,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:26,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578321447] [2022-04-27 13:17:26,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578321447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:26,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:26,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:17:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179975042] [2022-04-27 13:17:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 173 [2022-04-27 13:17:26,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:26,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:26,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:26,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:17:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:26,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:17:26,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:17:26,744 INFO L87 Difference]: Start difference. First operand 746 states and 989 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:27,421 INFO L93 Difference]: Finished difference Result 936 states and 1251 transitions. [2022-04-27 13:17:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:17:27,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 173 [2022-04-27 13:17:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 13:17:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 13:17:27,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-27 13:17:27,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:27,498 INFO L225 Difference]: With dead ends: 936 [2022-04-27 13:17:27,498 INFO L226 Difference]: Without dead ends: 807 [2022-04-27 13:17:27,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:17:27,501 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:27,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-04-27 13:17:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 772. [2022-04-27 13:17:27,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:27,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 807 states. Second operand has 772 states, 580 states have (on average 1.1741379310344828) internal successors, (681), 582 states have internal predecessors, (681), 166 states have call successors, (166), 27 states have call predecessors, (166), 25 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-27 13:17:27,887 INFO L74 IsIncluded]: Start isIncluded. First operand 807 states. Second operand has 772 states, 580 states have (on average 1.1741379310344828) internal successors, (681), 582 states have internal predecessors, (681), 166 states have call successors, (166), 27 states have call predecessors, (166), 25 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-27 13:17:27,887 INFO L87 Difference]: Start difference. First operand 807 states. Second operand has 772 states, 580 states have (on average 1.1741379310344828) internal successors, (681), 582 states have internal predecessors, (681), 166 states have call successors, (166), 27 states have call predecessors, (166), 25 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-27 13:17:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:27,911 INFO L93 Difference]: Finished difference Result 807 states and 1052 transitions. [2022-04-27 13:17:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1052 transitions. [2022-04-27 13:17:27,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:27,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:27,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 772 states, 580 states have (on average 1.1741379310344828) internal successors, (681), 582 states have internal predecessors, (681), 166 states have call successors, (166), 27 states have call predecessors, (166), 25 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) Second operand 807 states. [2022-04-27 13:17:27,914 INFO L87 Difference]: Start difference. First operand has 772 states, 580 states have (on average 1.1741379310344828) internal successors, (681), 582 states have internal predecessors, (681), 166 states have call successors, (166), 27 states have call predecessors, (166), 25 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) Second operand 807 states. [2022-04-27 13:17:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:27,937 INFO L93 Difference]: Finished difference Result 807 states and 1052 transitions. [2022-04-27 13:17:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1052 transitions. [2022-04-27 13:17:27,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:27,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:27,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:27,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 580 states have (on average 1.1741379310344828) internal successors, (681), 582 states have internal predecessors, (681), 166 states have call successors, (166), 27 states have call predecessors, (166), 25 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-27 13:17:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1011 transitions. [2022-04-27 13:17:27,965 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1011 transitions. Word has length 173 [2022-04-27 13:17:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:27,965 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 1011 transitions. [2022-04-27 13:17:27,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:17:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1011 transitions. [2022-04-27 13:17:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-27 13:17:27,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:27,968 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 9, 8, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:27,974 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-27 13:17:28,174 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-27 13:17:28,174 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:28,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash 531769879, now seen corresponding path program 1 times [2022-04-27 13:17:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:28,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013363312] [2022-04-27 13:17:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:28,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:28,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:28,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1360182354] [2022-04-27 13:17:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:28,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:28,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:28,198 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-27 13:17:28,199 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-27 13:17:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:28,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-27 13:17:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:28,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:28,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {27374#true} call ULTIMATE.init(); {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {27374#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27374#true} {27374#true} #102#return; {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {27374#true} call #t~ret9 := main(); {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {27374#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; {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L272 TraceCheckUtils]: 6: Hoare triple {27374#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27374#true} {27374#true} #90#return; {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L272 TraceCheckUtils]: 11: Hoare triple {27374#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)); {27374#true} is VALID [2022-04-27 13:17:28,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27374#true} {27374#true} #92#return; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {27374#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {27374#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {27374#true} assume !!(#t~post6 < 20);havoc #t~post6; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L272 TraceCheckUtils]: 19: Hoare triple {27374#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)); {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {27374#true} {27374#true} #94#return; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {27374#true} assume !!(0 != ~r~0); {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {27374#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {27374#true} assume !!(#t~post7 < 20);havoc #t~post7; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L272 TraceCheckUtils]: 27: Hoare triple {27374#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)); {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {27374#true} {27374#true} #96#return; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {27374#true} assume !(~r~0 > 0); {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {27374#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {27374#true} assume !!(#t~post8 < 20);havoc #t~post8; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L272 TraceCheckUtils]: 35: Hoare triple {27374#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)); {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27374#true} {27374#true} #98#return; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {27374#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {27374#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {27374#true} assume !!(#t~post8 < 20);havoc #t~post8; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L272 TraceCheckUtils]: 43: Hoare triple {27374#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)); {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {27374#true} {27374#true} #98#return; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {27374#true} assume !(~r~0 < 0); {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {27374#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {27374#true} assume !!(#t~post6 < 20);havoc #t~post6; {27374#true} is VALID [2022-04-27 13:17:28,572 INFO L272 TraceCheckUtils]: 51: Hoare triple {27374#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)); {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {27374#true} {27374#true} #94#return; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {27374#true} assume !!(0 != ~r~0); {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {27374#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {27374#true} assume !!(#t~post7 < 20);havoc #t~post7; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L272 TraceCheckUtils]: 59: Hoare triple {27374#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)); {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 60: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 61: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {27374#true} {27374#true} #96#return; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 64: Hoare triple {27374#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 65: Hoare triple {27374#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 66: Hoare triple {27374#true} assume !!(#t~post7 < 20);havoc #t~post7; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L272 TraceCheckUtils]: 67: Hoare triple {27374#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)); {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 69: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,573 INFO L290 TraceCheckUtils]: 70: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,574 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27374#true} {27374#true} #96#return; {27374#true} is VALID [2022-04-27 13:17:28,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {27374#true} assume !(~r~0 > 0); {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,574 INFO L290 TraceCheckUtils]: 73: Hoare triple {27595#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,574 INFO L290 TraceCheckUtils]: 74: Hoare triple {27595#(not (< 0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,574 INFO L272 TraceCheckUtils]: 75: Hoare triple {27595#(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)); {27374#true} is VALID [2022-04-27 13:17:28,574 INFO L290 TraceCheckUtils]: 76: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,574 INFO L290 TraceCheckUtils]: 77: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,574 INFO L290 TraceCheckUtils]: 78: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,586 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {27374#true} {27595#(not (< 0 main_~r~0))} #98#return; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {27595#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,587 INFO L290 TraceCheckUtils]: 81: Hoare triple {27595#(not (< 0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {27595#(not (< 0 main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,587 INFO L272 TraceCheckUtils]: 83: Hoare triple {27595#(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)); {27374#true} is VALID [2022-04-27 13:17:28,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,588 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {27374#true} {27595#(not (< 0 main_~r~0))} #94#return; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,588 INFO L290 TraceCheckUtils]: 88: Hoare triple {27595#(not (< 0 main_~r~0))} assume !!(0 != ~r~0); {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {27595#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,588 INFO L290 TraceCheckUtils]: 90: Hoare triple {27595#(not (< 0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,588 INFO L272 TraceCheckUtils]: 91: Hoare triple {27595#(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)); {27374#true} is VALID [2022-04-27 13:17:28,588 INFO L290 TraceCheckUtils]: 92: Hoare triple {27374#true} ~cond := #in~cond; {27374#true} is VALID [2022-04-27 13:17:28,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {27374#true} assume !(0 == ~cond); {27374#true} is VALID [2022-04-27 13:17:28,589 INFO L290 TraceCheckUtils]: 94: Hoare triple {27374#true} assume true; {27374#true} is VALID [2022-04-27 13:17:28,589 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {27374#true} {27595#(not (< 0 main_~r~0))} #96#return; {27595#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:28,589 INFO L290 TraceCheckUtils]: 96: Hoare triple {27595#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {27375#false} is VALID [2022-04-27 13:17:28,589 INFO L290 TraceCheckUtils]: 97: Hoare triple {27375#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,589 INFO L290 TraceCheckUtils]: 98: Hoare triple {27375#false} assume !!(#t~post7 < 20);havoc #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,589 INFO L272 TraceCheckUtils]: 99: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,589 INFO L290 TraceCheckUtils]: 100: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,589 INFO L290 TraceCheckUtils]: 101: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {27375#false} {27375#false} #96#return; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 104: Hoare triple {27375#false} assume !(~r~0 > 0); {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 105: Hoare triple {27375#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 106: Hoare triple {27375#false} assume !!(#t~post8 < 20);havoc #t~post8; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L272 TraceCheckUtils]: 107: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 108: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 109: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 110: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {27375#false} {27375#false} #98#return; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 112: Hoare triple {27375#false} assume !(~r~0 < 0); {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 113: Hoare triple {27375#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 114: Hoare triple {27375#false} assume !!(#t~post6 < 20);havoc #t~post6; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L272 TraceCheckUtils]: 115: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 116: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 117: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 118: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {27375#false} {27375#false} #94#return; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 120: Hoare triple {27375#false} assume !!(0 != ~r~0); {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 121: Hoare triple {27375#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,590 INFO L290 TraceCheckUtils]: 122: Hoare triple {27375#false} assume !!(#t~post7 < 20);havoc #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L272 TraceCheckUtils]: 123: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 124: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 125: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 126: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {27375#false} {27375#false} #96#return; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 128: Hoare triple {27375#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 129: Hoare triple {27375#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 130: Hoare triple {27375#false} assume !!(#t~post7 < 20);havoc #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L272 TraceCheckUtils]: 131: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 132: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 133: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 134: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {27375#false} {27375#false} #96#return; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 136: Hoare triple {27375#false} assume !(~r~0 > 0); {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 137: Hoare triple {27375#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 138: Hoare triple {27375#false} assume !!(#t~post8 < 20);havoc #t~post8; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L272 TraceCheckUtils]: 139: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 140: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 141: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,591 INFO L290 TraceCheckUtils]: 142: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {27375#false} {27375#false} #98#return; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 144: Hoare triple {27375#false} assume !(~r~0 < 0); {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 145: Hoare triple {27375#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 146: Hoare triple {27375#false} assume !!(#t~post6 < 20);havoc #t~post6; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L272 TraceCheckUtils]: 147: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 148: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 149: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 150: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {27375#false} {27375#false} #94#return; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 152: Hoare triple {27375#false} assume !!(0 != ~r~0); {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 153: Hoare triple {27375#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 154: Hoare triple {27375#false} assume !!(#t~post7 < 20);havoc #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L272 TraceCheckUtils]: 155: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 156: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 157: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 158: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {27375#false} {27375#false} #96#return; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 160: Hoare triple {27375#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 161: Hoare triple {27375#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 162: Hoare triple {27375#false} assume !(#t~post7 < 20);havoc #t~post7; {27375#false} is VALID [2022-04-27 13:17:28,592 INFO L290 TraceCheckUtils]: 163: Hoare triple {27375#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 164: Hoare triple {27375#false} assume !!(#t~post8 < 20);havoc #t~post8; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L272 TraceCheckUtils]: 165: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 166: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 167: Hoare triple {27375#false} assume !(0 == ~cond); {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 168: Hoare triple {27375#false} assume true; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {27375#false} {27375#false} #98#return; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 170: Hoare triple {27375#false} assume !(~r~0 < 0); {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 171: Hoare triple {27375#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 172: Hoare triple {27375#false} assume !(#t~post6 < 20);havoc #t~post6; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L272 TraceCheckUtils]: 173: Hoare triple {27375#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 174: Hoare triple {27375#false} ~cond := #in~cond; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 175: Hoare triple {27375#false} assume 0 == ~cond; {27375#false} is VALID [2022-04-27 13:17:28,593 INFO L290 TraceCheckUtils]: 176: Hoare triple {27375#false} assume !false; {27375#false} is VALID [2022-04-27 13:17:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-04-27 13:17:28,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:28,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013363312] [2022-04-27 13:17:28,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:28,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360182354] [2022-04-27 13:17:28,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360182354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:28,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:28,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:17:28,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575442113] [2022-04-27 13:17:28,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:28,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 177 [2022-04-27 13:17:28,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:28,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:28,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:28,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:17:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:28,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:17:28,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:17:28,640 INFO L87 Difference]: Start difference. First operand 772 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:29,325 INFO L93 Difference]: Finished difference Result 1298 states and 1701 transitions. [2022-04-27 13:17:29,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:17:29,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 177 [2022-04-27 13:17:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-27 13:17:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-27 13:17:29,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-04-27 13:17:29,376 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-27 13:17:29,402 INFO L225 Difference]: With dead ends: 1298 [2022-04-27 13:17:29,403 INFO L226 Difference]: Without dead ends: 818 [2022-04-27 13:17:29,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:17:29,404 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:29,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-04-27 13:17:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 769. [2022-04-27 13:17:29,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:29,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 818 states. Second operand has 769 states, 580 states have (on average 1.1706896551724137) internal successors, (679), 583 states have internal predecessors, (679), 163 states have call successors, (163), 27 states have call predecessors, (163), 25 states have return successors, (161), 158 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-27 13:17:29,775 INFO L74 IsIncluded]: Start isIncluded. First operand 818 states. Second operand has 769 states, 580 states have (on average 1.1706896551724137) internal successors, (679), 583 states have internal predecessors, (679), 163 states have call successors, (163), 27 states have call predecessors, (163), 25 states have return successors, (161), 158 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-27 13:17:29,775 INFO L87 Difference]: Start difference. First operand 818 states. Second operand has 769 states, 580 states have (on average 1.1706896551724137) internal successors, (679), 583 states have internal predecessors, (679), 163 states have call successors, (163), 27 states have call predecessors, (163), 25 states have return successors, (161), 158 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-27 13:17:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:29,798 INFO L93 Difference]: Finished difference Result 818 states and 1067 transitions. [2022-04-27 13:17:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1067 transitions. [2022-04-27 13:17:29,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:29,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:29,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 769 states, 580 states have (on average 1.1706896551724137) internal successors, (679), 583 states have internal predecessors, (679), 163 states have call successors, (163), 27 states have call predecessors, (163), 25 states have return successors, (161), 158 states have call predecessors, (161), 161 states have call successors, (161) Second operand 818 states. [2022-04-27 13:17:29,801 INFO L87 Difference]: Start difference. First operand has 769 states, 580 states have (on average 1.1706896551724137) internal successors, (679), 583 states have internal predecessors, (679), 163 states have call successors, (163), 27 states have call predecessors, (163), 25 states have return successors, (161), 158 states have call predecessors, (161), 161 states have call successors, (161) Second operand 818 states. [2022-04-27 13:17:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:29,823 INFO L93 Difference]: Finished difference Result 818 states and 1067 transitions. [2022-04-27 13:17:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1067 transitions. [2022-04-27 13:17:29,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:29,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:29,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:29,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 580 states have (on average 1.1706896551724137) internal successors, (679), 583 states have internal predecessors, (679), 163 states have call successors, (163), 27 states have call predecessors, (163), 25 states have return successors, (161), 158 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-27 13:17:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1003 transitions. [2022-04-27 13:17:29,865 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1003 transitions. Word has length 177 [2022-04-27 13:17:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:29,866 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 1003 transitions. [2022-04-27 13:17:29,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-27 13:17:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1003 transitions. [2022-04-27 13:17:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-27 13:17:29,868 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:29,868 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 8, 8, 8, 8, 8, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:29,884 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-27 13:17:30,084 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-27 13:17:30,084 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash -242041725, now seen corresponding path program 2 times [2022-04-27 13:17:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:30,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584248687] [2022-04-27 13:17:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:30,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:30,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387822931] [2022-04-27 13:17:30,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:17:30,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:30,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:30,107 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-27 13:17:30,108 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-27 13:17:30,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:17:30,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:30,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 13:17:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:30,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:31,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {32411#true} call ULTIMATE.init(); {32411#true} is VALID [2022-04-27 13:17:31,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {32411#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {32419#(<= ~counter~0 0)} assume true; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32419#(<= ~counter~0 0)} {32411#true} #102#return; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {32419#(<= ~counter~0 0)} call #t~ret9 := main(); {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {32419#(<= ~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; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {32419#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {32419#(<= ~counter~0 0)} ~cond := #in~cond; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {32419#(<= ~counter~0 0)} assume !(0 == ~cond); {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {32419#(<= ~counter~0 0)} assume true; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32419#(<= ~counter~0 0)} {32419#(<= ~counter~0 0)} #90#return; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,053 INFO L272 TraceCheckUtils]: 11: Hoare triple {32419#(<= ~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)); {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {32419#(<= ~counter~0 0)} ~cond := #in~cond; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {32419#(<= ~counter~0 0)} assume !(0 == ~cond); {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {32419#(<= ~counter~0 0)} assume true; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,054 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32419#(<= ~counter~0 0)} {32419#(<= ~counter~0 0)} #92#return; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {32419#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32419#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:31,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {32419#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32468#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:31,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {32468#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {32468#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:31,060 INFO L272 TraceCheckUtils]: 19: Hoare triple {32468#(<= ~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)); {32468#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:31,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {32468#(<= ~counter~0 1)} ~cond := #in~cond; {32468#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:31,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {32468#(<= ~counter~0 1)} assume !(0 == ~cond); {32468#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:31,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {32468#(<= ~counter~0 1)} assume true; {32468#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:31,062 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {32468#(<= ~counter~0 1)} {32468#(<= ~counter~0 1)} #94#return; {32468#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:31,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {32468#(<= ~counter~0 1)} assume !!(0 != ~r~0); {32468#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:31,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {32468#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {32493#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,063 INFO L272 TraceCheckUtils]: 27: Hoare triple {32493#(<= ~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)); {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {32493#(<= ~counter~0 2)} ~cond := #in~cond; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {32493#(<= ~counter~0 2)} assume !(0 == ~cond); {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {32493#(<= ~counter~0 2)} assume true; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,065 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {32493#(<= ~counter~0 2)} {32493#(<= ~counter~0 2)} #96#return; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {32493#(<= ~counter~0 2)} assume !(~r~0 > 0); {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {32493#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {32518#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,066 INFO L272 TraceCheckUtils]: 35: Hoare triple {32518#(<= ~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)); {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {32518#(<= ~counter~0 3)} ~cond := #in~cond; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {32518#(<= ~counter~0 3)} assume !(0 == ~cond); {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {32518#(<= ~counter~0 3)} assume true; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,068 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {32518#(<= ~counter~0 3)} {32518#(<= ~counter~0 3)} #98#return; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {32518#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {32518#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {32543#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,069 INFO L272 TraceCheckUtils]: 43: Hoare triple {32543#(<= ~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)); {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {32543#(<= ~counter~0 4)} ~cond := #in~cond; {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {32543#(<= ~counter~0 4)} assume !(0 == ~cond); {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {32543#(<= ~counter~0 4)} assume true; {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,071 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {32543#(<= ~counter~0 4)} {32543#(<= ~counter~0 4)} #98#return; {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {32543#(<= ~counter~0 4)} assume !(~r~0 < 0); {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {32543#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {32568#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,073 INFO L272 TraceCheckUtils]: 51: Hoare triple {32568#(<= ~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)); {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {32568#(<= ~counter~0 5)} ~cond := #in~cond; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {32568#(<= ~counter~0 5)} assume !(0 == ~cond); {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {32568#(<= ~counter~0 5)} assume true; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,074 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32568#(<= ~counter~0 5)} {32568#(<= ~counter~0 5)} #94#return; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {32568#(<= ~counter~0 5)} assume !!(0 != ~r~0); {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,075 INFO L290 TraceCheckUtils]: 57: Hoare triple {32568#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {32593#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,076 INFO L272 TraceCheckUtils]: 59: Hoare triple {32593#(<= ~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)); {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,076 INFO L290 TraceCheckUtils]: 60: Hoare triple {32593#(<= ~counter~0 6)} ~cond := #in~cond; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,076 INFO L290 TraceCheckUtils]: 61: Hoare triple {32593#(<= ~counter~0 6)} assume !(0 == ~cond); {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,076 INFO L290 TraceCheckUtils]: 62: Hoare triple {32593#(<= ~counter~0 6)} assume true; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,077 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {32593#(<= ~counter~0 6)} {32593#(<= ~counter~0 6)} #96#return; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {32593#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {32593#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {32618#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,079 INFO L272 TraceCheckUtils]: 67: Hoare triple {32618#(<= ~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)); {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {32618#(<= ~counter~0 7)} ~cond := #in~cond; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {32618#(<= ~counter~0 7)} assume !(0 == ~cond); {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,080 INFO L290 TraceCheckUtils]: 70: Hoare triple {32618#(<= ~counter~0 7)} assume true; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,080 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32618#(<= ~counter~0 7)} {32618#(<= ~counter~0 7)} #96#return; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {32618#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {32618#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,081 INFO L290 TraceCheckUtils]: 74: Hoare triple {32643#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,082 INFO L272 TraceCheckUtils]: 75: Hoare triple {32643#(<= ~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)); {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {32643#(<= ~counter~0 8)} ~cond := #in~cond; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {32643#(<= ~counter~0 8)} assume !(0 == ~cond); {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,083 INFO L290 TraceCheckUtils]: 78: Hoare triple {32643#(<= ~counter~0 8)} assume true; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,083 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {32643#(<= ~counter~0 8)} {32643#(<= ~counter~0 8)} #96#return; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {32643#(<= ~counter~0 8)} assume !(~r~0 > 0); {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,084 INFO L290 TraceCheckUtils]: 81: Hoare triple {32643#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,084 INFO L290 TraceCheckUtils]: 82: Hoare triple {32668#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,085 INFO L272 TraceCheckUtils]: 83: Hoare triple {32668#(<= ~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)); {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,085 INFO L290 TraceCheckUtils]: 84: Hoare triple {32668#(<= ~counter~0 9)} ~cond := #in~cond; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,085 INFO L290 TraceCheckUtils]: 85: Hoare triple {32668#(<= ~counter~0 9)} assume !(0 == ~cond); {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,086 INFO L290 TraceCheckUtils]: 86: Hoare triple {32668#(<= ~counter~0 9)} assume true; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,086 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32668#(<= ~counter~0 9)} {32668#(<= ~counter~0 9)} #98#return; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,086 INFO L290 TraceCheckUtils]: 88: Hoare triple {32668#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {32668#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {32693#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,088 INFO L272 TraceCheckUtils]: 91: Hoare triple {32693#(<= ~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)); {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {32693#(<= ~counter~0 10)} ~cond := #in~cond; {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {32693#(<= ~counter~0 10)} assume !(0 == ~cond); {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,089 INFO L290 TraceCheckUtils]: 94: Hoare triple {32693#(<= ~counter~0 10)} assume true; {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,089 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {32693#(<= ~counter~0 10)} {32693#(<= ~counter~0 10)} #98#return; {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,090 INFO L290 TraceCheckUtils]: 96: Hoare triple {32693#(<= ~counter~0 10)} assume !(~r~0 < 0); {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,090 INFO L290 TraceCheckUtils]: 97: Hoare triple {32693#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,090 INFO L290 TraceCheckUtils]: 98: Hoare triple {32718#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,091 INFO L272 TraceCheckUtils]: 99: Hoare triple {32718#(<= ~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)); {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,091 INFO L290 TraceCheckUtils]: 100: Hoare triple {32718#(<= ~counter~0 11)} ~cond := #in~cond; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,091 INFO L290 TraceCheckUtils]: 101: Hoare triple {32718#(<= ~counter~0 11)} assume !(0 == ~cond); {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,091 INFO L290 TraceCheckUtils]: 102: Hoare triple {32718#(<= ~counter~0 11)} assume true; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,092 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {32718#(<= ~counter~0 11)} {32718#(<= ~counter~0 11)} #94#return; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,092 INFO L290 TraceCheckUtils]: 104: Hoare triple {32718#(<= ~counter~0 11)} assume !!(0 != ~r~0); {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,093 INFO L290 TraceCheckUtils]: 105: Hoare triple {32718#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,093 INFO L290 TraceCheckUtils]: 106: Hoare triple {32743#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,093 INFO L272 TraceCheckUtils]: 107: Hoare triple {32743#(<= ~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)); {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,094 INFO L290 TraceCheckUtils]: 108: Hoare triple {32743#(<= ~counter~0 12)} ~cond := #in~cond; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,094 INFO L290 TraceCheckUtils]: 109: Hoare triple {32743#(<= ~counter~0 12)} assume !(0 == ~cond); {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,094 INFO L290 TraceCheckUtils]: 110: Hoare triple {32743#(<= ~counter~0 12)} assume true; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,094 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {32743#(<= ~counter~0 12)} {32743#(<= ~counter~0 12)} #96#return; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,095 INFO L290 TraceCheckUtils]: 112: Hoare triple {32743#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,095 INFO L290 TraceCheckUtils]: 113: Hoare triple {32743#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,095 INFO L290 TraceCheckUtils]: 114: Hoare triple {32768#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,096 INFO L272 TraceCheckUtils]: 115: Hoare triple {32768#(<= ~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)); {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,096 INFO L290 TraceCheckUtils]: 116: Hoare triple {32768#(<= ~counter~0 13)} ~cond := #in~cond; {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,096 INFO L290 TraceCheckUtils]: 117: Hoare triple {32768#(<= ~counter~0 13)} assume !(0 == ~cond); {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,096 INFO L290 TraceCheckUtils]: 118: Hoare triple {32768#(<= ~counter~0 13)} assume true; {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,097 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {32768#(<= ~counter~0 13)} {32768#(<= ~counter~0 13)} #96#return; {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,097 INFO L290 TraceCheckUtils]: 120: Hoare triple {32768#(<= ~counter~0 13)} assume !(~r~0 > 0); {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,098 INFO L290 TraceCheckUtils]: 121: Hoare triple {32768#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,098 INFO L290 TraceCheckUtils]: 122: Hoare triple {32793#(<= ~counter~0 14)} assume !!(#t~post8 < 20);havoc #t~post8; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,098 INFO L272 TraceCheckUtils]: 123: Hoare triple {32793#(<= ~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)); {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,098 INFO L290 TraceCheckUtils]: 124: Hoare triple {32793#(<= ~counter~0 14)} ~cond := #in~cond; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,099 INFO L290 TraceCheckUtils]: 125: Hoare triple {32793#(<= ~counter~0 14)} assume !(0 == ~cond); {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,099 INFO L290 TraceCheckUtils]: 126: Hoare triple {32793#(<= ~counter~0 14)} assume true; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,099 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {32793#(<= ~counter~0 14)} {32793#(<= ~counter~0 14)} #98#return; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,100 INFO L290 TraceCheckUtils]: 128: Hoare triple {32793#(<= ~counter~0 14)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,100 INFO L290 TraceCheckUtils]: 129: Hoare triple {32793#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,100 INFO L290 TraceCheckUtils]: 130: Hoare triple {32818#(<= ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,101 INFO L272 TraceCheckUtils]: 131: Hoare triple {32818#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,101 INFO L290 TraceCheckUtils]: 132: Hoare triple {32818#(<= ~counter~0 15)} ~cond := #in~cond; {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,101 INFO L290 TraceCheckUtils]: 133: Hoare triple {32818#(<= ~counter~0 15)} assume !(0 == ~cond); {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,101 INFO L290 TraceCheckUtils]: 134: Hoare triple {32818#(<= ~counter~0 15)} assume true; {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,102 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {32818#(<= ~counter~0 15)} {32818#(<= ~counter~0 15)} #98#return; {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,102 INFO L290 TraceCheckUtils]: 136: Hoare triple {32818#(<= ~counter~0 15)} assume !(~r~0 < 0); {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,102 INFO L290 TraceCheckUtils]: 137: Hoare triple {32818#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,103 INFO L290 TraceCheckUtils]: 138: Hoare triple {32843#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,103 INFO L272 TraceCheckUtils]: 139: Hoare triple {32843#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,103 INFO L290 TraceCheckUtils]: 140: Hoare triple {32843#(<= ~counter~0 16)} ~cond := #in~cond; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,104 INFO L290 TraceCheckUtils]: 141: Hoare triple {32843#(<= ~counter~0 16)} assume !(0 == ~cond); {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,104 INFO L290 TraceCheckUtils]: 142: Hoare triple {32843#(<= ~counter~0 16)} assume true; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,104 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {32843#(<= ~counter~0 16)} {32843#(<= ~counter~0 16)} #94#return; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,104 INFO L290 TraceCheckUtils]: 144: Hoare triple {32843#(<= ~counter~0 16)} assume !!(0 != ~r~0); {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,105 INFO L290 TraceCheckUtils]: 145: Hoare triple {32843#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,105 INFO L290 TraceCheckUtils]: 146: Hoare triple {32868#(<= ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,106 INFO L272 TraceCheckUtils]: 147: Hoare triple {32868#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,106 INFO L290 TraceCheckUtils]: 148: Hoare triple {32868#(<= ~counter~0 17)} ~cond := #in~cond; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,106 INFO L290 TraceCheckUtils]: 149: Hoare triple {32868#(<= ~counter~0 17)} assume !(0 == ~cond); {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,106 INFO L290 TraceCheckUtils]: 150: Hoare triple {32868#(<= ~counter~0 17)} assume true; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,107 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {32868#(<= ~counter~0 17)} {32868#(<= ~counter~0 17)} #96#return; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,107 INFO L290 TraceCheckUtils]: 152: Hoare triple {32868#(<= ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,107 INFO L290 TraceCheckUtils]: 153: Hoare triple {32868#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32893#(<= |main_#t~post7| 17)} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 154: Hoare triple {32893#(<= |main_#t~post7| 17)} assume !(#t~post7 < 20);havoc #t~post7; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 155: Hoare triple {32412#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 156: Hoare triple {32412#false} assume !!(#t~post8 < 20);havoc #t~post8; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L272 TraceCheckUtils]: 157: Hoare triple {32412#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 158: Hoare triple {32412#false} ~cond := #in~cond; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 159: Hoare triple {32412#false} assume !(0 == ~cond); {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 160: Hoare triple {32412#false} assume true; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {32412#false} {32412#false} #98#return; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 162: Hoare triple {32412#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 163: Hoare triple {32412#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 164: Hoare triple {32412#false} assume !!(#t~post8 < 20);havoc #t~post8; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L272 TraceCheckUtils]: 165: Hoare triple {32412#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 166: Hoare triple {32412#false} ~cond := #in~cond; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 167: Hoare triple {32412#false} assume !(0 == ~cond); {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 168: Hoare triple {32412#false} assume true; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {32412#false} {32412#false} #98#return; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 170: Hoare triple {32412#false} assume !(~r~0 < 0); {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 171: Hoare triple {32412#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L290 TraceCheckUtils]: 172: Hoare triple {32412#false} assume !(#t~post6 < 20);havoc #t~post6; {32412#false} is VALID [2022-04-27 13:17:31,108 INFO L272 TraceCheckUtils]: 173: Hoare triple {32412#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32412#false} is VALID [2022-04-27 13:17:31,109 INFO L290 TraceCheckUtils]: 174: Hoare triple {32412#false} ~cond := #in~cond; {32412#false} is VALID [2022-04-27 13:17:31,109 INFO L290 TraceCheckUtils]: 175: Hoare triple {32412#false} assume 0 == ~cond; {32412#false} is VALID [2022-04-27 13:17:31,109 INFO L290 TraceCheckUtils]: 176: Hoare triple {32412#false} assume !false; {32412#false} is VALID [2022-04-27 13:17:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 226 proven. 726 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:17:31,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:31,853 INFO L290 TraceCheckUtils]: 176: Hoare triple {32412#false} assume !false; {32412#false} is VALID [2022-04-27 13:17:31,853 INFO L290 TraceCheckUtils]: 175: Hoare triple {32412#false} assume 0 == ~cond; {32412#false} is VALID [2022-04-27 13:17:31,853 INFO L290 TraceCheckUtils]: 174: Hoare triple {32412#false} ~cond := #in~cond; {32412#false} is VALID [2022-04-27 13:17:31,853 INFO L272 TraceCheckUtils]: 173: Hoare triple {32412#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 172: Hoare triple {32412#false} assume !(#t~post6 < 20);havoc #t~post6; {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 171: Hoare triple {32412#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 170: Hoare triple {32412#false} assume !(~r~0 < 0); {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {32411#true} {32412#false} #98#return; {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 168: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 167: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 166: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,854 INFO L272 TraceCheckUtils]: 165: Hoare triple {32412#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 164: Hoare triple {32412#false} assume !!(#t~post8 < 20);havoc #t~post8; {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 163: Hoare triple {32412#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 162: Hoare triple {32412#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {32411#true} {32412#false} #98#return; {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 160: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 159: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 158: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,854 INFO L272 TraceCheckUtils]: 157: Hoare triple {32412#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 156: Hoare triple {32412#false} assume !!(#t~post8 < 20);havoc #t~post8; {32412#false} is VALID [2022-04-27 13:17:31,854 INFO L290 TraceCheckUtils]: 155: Hoare triple {32412#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32412#false} is VALID [2022-04-27 13:17:31,855 INFO L290 TraceCheckUtils]: 154: Hoare triple {33029#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {32412#false} is VALID [2022-04-27 13:17:31,855 INFO L290 TraceCheckUtils]: 153: Hoare triple {33033#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33029#(< |main_#t~post7| 20)} is VALID [2022-04-27 13:17:31,855 INFO L290 TraceCheckUtils]: 152: Hoare triple {33033#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33033#(< ~counter~0 20)} is VALID [2022-04-27 13:17:31,856 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {32411#true} {33033#(< ~counter~0 20)} #96#return; {33033#(< ~counter~0 20)} is VALID [2022-04-27 13:17:31,856 INFO L290 TraceCheckUtils]: 150: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,856 INFO L290 TraceCheckUtils]: 149: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,856 INFO L290 TraceCheckUtils]: 148: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,856 INFO L272 TraceCheckUtils]: 147: Hoare triple {33033#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,856 INFO L290 TraceCheckUtils]: 146: Hoare triple {33033#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {33033#(< ~counter~0 20)} is VALID [2022-04-27 13:17:31,857 INFO L290 TraceCheckUtils]: 145: Hoare triple {33058#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33033#(< ~counter~0 20)} is VALID [2022-04-27 13:17:31,857 INFO L290 TraceCheckUtils]: 144: Hoare triple {33058#(< ~counter~0 19)} assume !!(0 != ~r~0); {33058#(< ~counter~0 19)} is VALID [2022-04-27 13:17:31,858 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {32411#true} {33058#(< ~counter~0 19)} #94#return; {33058#(< ~counter~0 19)} is VALID [2022-04-27 13:17:31,858 INFO L290 TraceCheckUtils]: 142: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,858 INFO L290 TraceCheckUtils]: 141: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,858 INFO L290 TraceCheckUtils]: 140: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,858 INFO L272 TraceCheckUtils]: 139: Hoare triple {33058#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,858 INFO L290 TraceCheckUtils]: 138: Hoare triple {33058#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {33058#(< ~counter~0 19)} is VALID [2022-04-27 13:17:31,858 INFO L290 TraceCheckUtils]: 137: Hoare triple {32868#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33058#(< ~counter~0 19)} is VALID [2022-04-27 13:17:31,859 INFO L290 TraceCheckUtils]: 136: Hoare triple {32868#(<= ~counter~0 17)} assume !(~r~0 < 0); {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,859 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {32411#true} {32868#(<= ~counter~0 17)} #98#return; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,859 INFO L290 TraceCheckUtils]: 134: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,859 INFO L290 TraceCheckUtils]: 133: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,859 INFO L290 TraceCheckUtils]: 132: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,859 INFO L272 TraceCheckUtils]: 131: Hoare triple {32868#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,860 INFO L290 TraceCheckUtils]: 130: Hoare triple {32868#(<= ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,860 INFO L290 TraceCheckUtils]: 129: Hoare triple {32843#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32868#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:31,860 INFO L290 TraceCheckUtils]: 128: Hoare triple {32843#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,861 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {32411#true} {32843#(<= ~counter~0 16)} #98#return; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,861 INFO L290 TraceCheckUtils]: 126: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,861 INFO L290 TraceCheckUtils]: 125: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,861 INFO L290 TraceCheckUtils]: 124: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,861 INFO L272 TraceCheckUtils]: 123: Hoare triple {32843#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,861 INFO L290 TraceCheckUtils]: 122: Hoare triple {32843#(<= ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,862 INFO L290 TraceCheckUtils]: 121: Hoare triple {32818#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32843#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:31,862 INFO L290 TraceCheckUtils]: 120: Hoare triple {32818#(<= ~counter~0 15)} assume !(~r~0 > 0); {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,862 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {32411#true} {32818#(<= ~counter~0 15)} #96#return; {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,862 INFO L290 TraceCheckUtils]: 118: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,862 INFO L290 TraceCheckUtils]: 117: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,862 INFO L290 TraceCheckUtils]: 116: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,863 INFO L272 TraceCheckUtils]: 115: Hoare triple {32818#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,863 INFO L290 TraceCheckUtils]: 114: Hoare triple {32818#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,863 INFO L290 TraceCheckUtils]: 113: Hoare triple {32793#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32818#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:31,863 INFO L290 TraceCheckUtils]: 112: Hoare triple {32793#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,864 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {32411#true} {32793#(<= ~counter~0 14)} #96#return; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,864 INFO L290 TraceCheckUtils]: 110: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,864 INFO L290 TraceCheckUtils]: 109: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,864 INFO L290 TraceCheckUtils]: 108: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,864 INFO L272 TraceCheckUtils]: 107: Hoare triple {32793#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,865 INFO L290 TraceCheckUtils]: 106: Hoare triple {32793#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,865 INFO L290 TraceCheckUtils]: 105: Hoare triple {32768#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32793#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:31,865 INFO L290 TraceCheckUtils]: 104: Hoare triple {32768#(<= ~counter~0 13)} assume !!(0 != ~r~0); {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,866 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {32411#true} {32768#(<= ~counter~0 13)} #94#return; {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,866 INFO L290 TraceCheckUtils]: 102: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,866 INFO L290 TraceCheckUtils]: 101: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,866 INFO L290 TraceCheckUtils]: 100: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,866 INFO L272 TraceCheckUtils]: 99: Hoare triple {32768#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,866 INFO L290 TraceCheckUtils]: 98: Hoare triple {32768#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,867 INFO L290 TraceCheckUtils]: 97: Hoare triple {32743#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32768#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:31,867 INFO L290 TraceCheckUtils]: 96: Hoare triple {32743#(<= ~counter~0 12)} assume !(~r~0 < 0); {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,867 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {32411#true} {32743#(<= ~counter~0 12)} #98#return; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,868 INFO L290 TraceCheckUtils]: 94: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,868 INFO L290 TraceCheckUtils]: 93: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,868 INFO L290 TraceCheckUtils]: 92: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,868 INFO L272 TraceCheckUtils]: 91: Hoare triple {32743#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,868 INFO L290 TraceCheckUtils]: 90: Hoare triple {32743#(<= ~counter~0 12)} assume !!(#t~post8 < 20);havoc #t~post8; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,868 INFO L290 TraceCheckUtils]: 89: Hoare triple {32718#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32743#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:31,869 INFO L290 TraceCheckUtils]: 88: Hoare triple {32718#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,869 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32411#true} {32718#(<= ~counter~0 11)} #98#return; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,869 INFO L290 TraceCheckUtils]: 86: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,869 INFO L290 TraceCheckUtils]: 85: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,869 INFO L290 TraceCheckUtils]: 84: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,869 INFO L272 TraceCheckUtils]: 83: Hoare triple {32718#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,869 INFO L290 TraceCheckUtils]: 82: Hoare triple {32718#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {32693#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32718#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:31,870 INFO L290 TraceCheckUtils]: 80: Hoare triple {32693#(<= ~counter~0 10)} assume !(~r~0 > 0); {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,871 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {32411#true} {32693#(<= ~counter~0 10)} #96#return; {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,871 INFO L290 TraceCheckUtils]: 78: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,871 INFO L290 TraceCheckUtils]: 77: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,871 INFO L290 TraceCheckUtils]: 76: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,871 INFO L272 TraceCheckUtils]: 75: Hoare triple {32693#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,871 INFO L290 TraceCheckUtils]: 74: Hoare triple {32693#(<= ~counter~0 10)} assume !!(#t~post7 < 20);havoc #t~post7; {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,871 INFO L290 TraceCheckUtils]: 73: Hoare triple {32668#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32693#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:31,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {32668#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,872 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32411#true} {32668#(<= ~counter~0 9)} #96#return; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,872 INFO L290 TraceCheckUtils]: 70: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,872 INFO L290 TraceCheckUtils]: 68: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,872 INFO L272 TraceCheckUtils]: 67: Hoare triple {32668#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {32668#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {32643#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32668#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:31,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {32643#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,874 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {32411#true} {32643#(<= ~counter~0 8)} #96#return; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,874 INFO L272 TraceCheckUtils]: 59: Hoare triple {32643#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {32643#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {32618#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32643#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:31,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {32618#(<= ~counter~0 7)} assume !!(0 != ~r~0); {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,875 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32411#true} {32618#(<= ~counter~0 7)} #94#return; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,875 INFO L290 TraceCheckUtils]: 52: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,876 INFO L272 TraceCheckUtils]: 51: Hoare triple {32618#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {32618#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {32593#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32618#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:31,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {32593#(<= ~counter~0 6)} assume !(~r~0 < 0); {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,877 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {32411#true} {32593#(<= ~counter~0 6)} #98#return; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,877 INFO L272 TraceCheckUtils]: 43: Hoare triple {32593#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {32593#(<= ~counter~0 6)} assume !!(#t~post8 < 20);havoc #t~post8; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {32568#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32593#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:31,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {32568#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,878 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {32411#true} {32568#(<= ~counter~0 5)} #98#return; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,879 INFO L272 TraceCheckUtils]: 35: Hoare triple {32568#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {32568#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {32543#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32568#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:31,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {32543#(<= ~counter~0 4)} assume !(~r~0 > 0); {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,880 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {32411#true} {32543#(<= ~counter~0 4)} #96#return; {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,880 INFO L272 TraceCheckUtils]: 27: Hoare triple {32543#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {32543#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {32518#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32543#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:31,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {32518#(<= ~counter~0 3)} assume !!(0 != ~r~0); {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,882 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {32411#true} {32518#(<= ~counter~0 3)} #94#return; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,882 INFO L272 TraceCheckUtils]: 19: Hoare triple {32518#(<= ~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)); {32411#true} is VALID [2022-04-27 13:17:31,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {32518#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {32493#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32518#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:31,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {32493#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,883 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32411#true} {32493#(<= ~counter~0 2)} #92#return; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,883 INFO L272 TraceCheckUtils]: 11: Hoare triple {32493#(<= ~counter~0 2)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32411#true} {32493#(<= ~counter~0 2)} #90#return; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {32411#true} assume true; {32411#true} is VALID [2022-04-27 13:17:31,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {32411#true} assume !(0 == ~cond); {32411#true} is VALID [2022-04-27 13:17:31,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {32411#true} ~cond := #in~cond; {32411#true} is VALID [2022-04-27 13:17:31,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {32493#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {32411#true} is VALID [2022-04-27 13:17:31,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {32493#(<= ~counter~0 2)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {32493#(<= ~counter~0 2)} call #t~ret9 := main(); {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32493#(<= ~counter~0 2)} {32411#true} #102#return; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {32493#(<= ~counter~0 2)} assume true; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {32411#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32493#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:31,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {32411#true} call ULTIMATE.init(); {32411#true} is VALID [2022-04-27 13:17:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 94 proven. 182 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-04-27 13:17:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:31,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584248687] [2022-04-27 13:17:31,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:31,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387822931] [2022-04-27 13:17:31,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387822931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:31,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:31,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-27 13:17:31,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806766595] [2022-04-27 13:17:31,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:31,891 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 24 states have internal predecessors, (183), 22 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (42), 21 states have call predecessors, (42), 22 states have call successors, (42) Word has length 177 [2022-04-27 13:17:31,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:31,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 7.625) internal successors, (183), 24 states have internal predecessors, (183), 22 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (42), 21 states have call predecessors, (42), 22 states have call successors, (42) [2022-04-27 13:17:32,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:32,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:17:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:17:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:17:32,059 INFO L87 Difference]: Start difference. First operand 769 states and 1003 transitions. Second operand has 24 states, 24 states have (on average 7.625) internal successors, (183), 24 states have internal predecessors, (183), 22 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (42), 21 states have call predecessors, (42), 22 states have call successors, (42) [2022-04-27 13:17:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:34,078 INFO L93 Difference]: Finished difference Result 801 states and 1043 transitions. [2022-04-27 13:17:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-27 13:17:34,079 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 24 states have internal predecessors, (183), 22 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (42), 21 states have call predecessors, (42), 22 states have call successors, (42) Word has length 177 [2022-04-27 13:17:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 7.625) internal successors, (183), 24 states have internal predecessors, (183), 22 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (42), 21 states have call predecessors, (42), 22 states have call successors, (42) [2022-04-27 13:17:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 408 transitions. [2022-04-27 13:17:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 7.625) internal successors, (183), 24 states have internal predecessors, (183), 22 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (42), 21 states have call predecessors, (42), 22 states have call successors, (42) [2022-04-27 13:17:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 408 transitions. [2022-04-27 13:17:34,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 408 transitions. [2022-04-27 13:17:34,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:34,390 INFO L225 Difference]: With dead ends: 801 [2022-04-27 13:17:34,390 INFO L226 Difference]: Without dead ends: 752 [2022-04-27 13:17:34,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=631, Invalid=1091, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 13:17:34,391 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 389 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:34,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 404 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:17:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-04-27 13:17:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 748. [2022-04-27 13:17:34,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:34,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 752 states. Second operand has 748 states, 566 states have (on average 1.1607773851590106) internal successors, (657), 566 states have internal predecessors, (657), 158 states have call successors, (158), 25 states have call predecessors, (158), 23 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-27 13:17:34,884 INFO L74 IsIncluded]: Start isIncluded. First operand 752 states. Second operand has 748 states, 566 states have (on average 1.1607773851590106) internal successors, (657), 566 states have internal predecessors, (657), 158 states have call successors, (158), 25 states have call predecessors, (158), 23 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-27 13:17:34,885 INFO L87 Difference]: Start difference. First operand 752 states. Second operand has 748 states, 566 states have (on average 1.1607773851590106) internal successors, (657), 566 states have internal predecessors, (657), 158 states have call successors, (158), 25 states have call predecessors, (158), 23 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-27 13:17:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:34,902 INFO L93 Difference]: Finished difference Result 752 states and 976 transitions. [2022-04-27 13:17:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 976 transitions. [2022-04-27 13:17:34,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:34,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:34,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 748 states, 566 states have (on average 1.1607773851590106) internal successors, (657), 566 states have internal predecessors, (657), 158 states have call successors, (158), 25 states have call predecessors, (158), 23 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) Second operand 752 states. [2022-04-27 13:17:34,904 INFO L87 Difference]: Start difference. First operand has 748 states, 566 states have (on average 1.1607773851590106) internal successors, (657), 566 states have internal predecessors, (657), 158 states have call successors, (158), 25 states have call predecessors, (158), 23 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) Second operand 752 states. [2022-04-27 13:17:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:34,921 INFO L93 Difference]: Finished difference Result 752 states and 976 transitions. [2022-04-27 13:17:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 976 transitions. [2022-04-27 13:17:34,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:34,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:34,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:34,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 566 states have (on average 1.1607773851590106) internal successors, (657), 566 states have internal predecessors, (657), 158 states have call successors, (158), 25 states have call predecessors, (158), 23 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-27 13:17:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 971 transitions. [2022-04-27 13:17:34,944 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 971 transitions. Word has length 177 [2022-04-27 13:17:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:34,945 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 971 transitions. [2022-04-27 13:17:34,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 24 states have internal predecessors, (183), 22 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (42), 21 states have call predecessors, (42), 22 states have call successors, (42) [2022-04-27 13:17:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 971 transitions. [2022-04-27 13:17:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-04-27 13:17:34,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:34,948 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 8, 8, 8, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:34,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:35,163 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-27 13:17:35,164 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash 826556577, now seen corresponding path program 2 times [2022-04-27 13:17:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:35,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318173184] [2022-04-27 13:17:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:35,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:35,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957942413] [2022-04-27 13:17:35,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:17:35,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:35,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:35,195 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-27 13:17:35,203 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-27 13:17:35,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:17:35,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:35,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 13:17:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:35,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:19:12,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {37181#true} call ULTIMATE.init(); {37181#true} is VALID [2022-04-27 13:19:12,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {37181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37181#true} is VALID [2022-04-27 13:19:12,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:12,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37181#true} {37181#true} #102#return; {37181#true} is VALID [2022-04-27 13:19:12,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {37181#true} call #t~ret9 := main(); {37181#true} is VALID [2022-04-27 13:19:12,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {37181#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; {37181#true} is VALID [2022-04-27 13:19:12,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {37181#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:12,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {37181#true} ~cond := #in~cond; {37207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:19:12,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {37207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {37211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:19:12,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {37211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {37211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:19:12,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37211#(not (= |assume_abort_if_not_#in~cond| 0))} {37181#true} #90#return; {37218#(< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))} is VALID [2022-04-27 13:19:12,627 INFO L272 TraceCheckUtils]: 11: Hoare triple {37218#(< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:12,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {37181#true} ~cond := #in~cond; {37207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:19:12,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {37207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {37211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:19:12,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {37211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {37211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:19:12,628 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37211#(not (= |assume_abort_if_not_#in~cond| 0))} {37218#(< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))} #92#return; {37234#(and (= (mod main_~A~0 2) 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} is VALID [2022-04-27 13:19:14,640 WARN L290 TraceCheckUtils]: 16: Hoare triple {37234#(and (= (mod main_~A~0 2) 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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 < 20);havoc #t~post6; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,642 INFO L272 TraceCheckUtils]: 19: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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)); {37181#true} is VALID [2022-04-27 13:19:14,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:14,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:14,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:14,642 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37181#true} {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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); {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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 < 20);havoc #t~post7; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,644 INFO L272 TraceCheckUtils]: 27: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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)); {37181#true} is VALID [2022-04-27 13:19:14,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:14,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:14,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:14,645 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37181#true} {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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); {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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 < 20);havoc #t~post8; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,646 INFO L272 TraceCheckUtils]: 35: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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)); {37181#true} is VALID [2022-04-27 13:19:14,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:14,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:14,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:14,647 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37181#true} {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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; {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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-27 13:19:14,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {37238#(and (< (+ main_~r~0 1) (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= (mod (+ main_~u~0 1) 2) 0) (= 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; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:14,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:14,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} assume !!(#t~post8 < 20);havoc #t~post8; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:14,755 INFO L272 TraceCheckUtils]: 43: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~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)); {37181#true} is VALID [2022-04-27 13:19:14,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:14,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:14,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:14,756 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37181#true} {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} #98#return; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:14,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} assume !(~r~0 < 0); {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:14,958 INFO L290 TraceCheckUtils]: 49: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:14,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:14,970 INFO L272 TraceCheckUtils]: 51: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~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)); {37181#true} is VALID [2022-04-27 13:19:14,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:14,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:14,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:14,970 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37181#true} {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} #94#return; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:14,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} assume !!(0 != ~r~0); {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:15,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:17,071 WARN L290 TraceCheckUtils]: 58: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is UNKNOWN [2022-04-27 13:19:17,071 INFO L272 TraceCheckUtils]: 59: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~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)); {37181#true} is VALID [2022-04-27 13:19:17,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:17,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:17,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:17,072 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37181#true} {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} #96#return; {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} is VALID [2022-04-27 13:19:19,078 WARN L290 TraceCheckUtils]: 64: Hoare triple {37311#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 2)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (= main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (<= main_~v~0 3))} is UNKNOWN [2022-04-27 13:19:19,124 INFO L290 TraceCheckUtils]: 65: Hoare triple {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (<= main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (<= main_~v~0 3))} is VALID [2022-04-27 13:19:19,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (<= main_~v~0 3))} assume !!(#t~post7 < 20);havoc #t~post7; {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (<= main_~v~0 3))} is VALID [2022-04-27 13:19:19,127 INFO L272 TraceCheckUtils]: 67: Hoare triple {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~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)); {37181#true} is VALID [2022-04-27 13:19:19,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:19,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:19,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:19,127 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37181#true} {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (<= main_~v~0 3))} #96#return; {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (<= main_~v~0 3))} is VALID [2022-04-27 13:19:19,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {37384#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 2) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))) (<= main_~v~0 3))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} is VALID [2022-04-27 13:19:19,145 INFO L290 TraceCheckUtils]: 73: Hoare triple {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} is VALID [2022-04-27 13:19:19,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} is VALID [2022-04-27 13:19:19,160 INFO L272 TraceCheckUtils]: 75: Hoare triple {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 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)); {37181#true} is VALID [2022-04-27 13:19:19,160 INFO L290 TraceCheckUtils]: 76: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:19,160 INFO L290 TraceCheckUtils]: 77: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:19,160 INFO L290 TraceCheckUtils]: 78: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:19,161 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37181#true} {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} #96#return; {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} is VALID [2022-04-27 13:19:19,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} assume !(~r~0 > 0); {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} is VALID [2022-04-27 13:19:19,180 INFO L290 TraceCheckUtils]: 81: Hoare triple {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} is VALID [2022-04-27 13:19:19,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} assume !!(#t~post8 < 20);havoc #t~post8; {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} is VALID [2022-04-27 13:19:19,201 INFO L272 TraceCheckUtils]: 83: Hoare triple {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 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)); {37181#true} is VALID [2022-04-27 13:19:19,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:19,201 INFO L290 TraceCheckUtils]: 85: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:19,201 INFO L290 TraceCheckUtils]: 86: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:19,202 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37181#true} {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} #98#return; {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} is VALID [2022-04-27 13:19:19,214 INFO L290 TraceCheckUtils]: 88: Hoare triple {37409#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5) (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2) (<= (+ (* 2 aux_div_v_main_~u~0_47_42) 3) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~u~0)))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,215 INFO L290 TraceCheckUtils]: 89: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,216 INFO L290 TraceCheckUtils]: 90: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} assume !!(#t~post8 < 20);havoc #t~post8; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,216 INFO L272 TraceCheckUtils]: 91: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= 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)); {37181#true} is VALID [2022-04-27 13:19:19,216 INFO L290 TraceCheckUtils]: 92: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:19,216 INFO L290 TraceCheckUtils]: 93: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:19,216 INFO L290 TraceCheckUtils]: 94: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:19,217 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {37181#true} {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} #98#return; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,231 INFO L290 TraceCheckUtils]: 96: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} assume !(~r~0 < 0); {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,232 INFO L290 TraceCheckUtils]: 97: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,232 INFO L290 TraceCheckUtils]: 98: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} assume !!(#t~post6 < 20);havoc #t~post6; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,232 INFO L272 TraceCheckUtils]: 99: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= 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)); {37181#true} is VALID [2022-04-27 13:19:19,233 INFO L290 TraceCheckUtils]: 100: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:19,233 INFO L290 TraceCheckUtils]: 101: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:19,233 INFO L290 TraceCheckUtils]: 102: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:19,233 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {37181#true} {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} #94#return; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,234 INFO L290 TraceCheckUtils]: 104: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} assume !!(0 != ~r~0); {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,234 INFO L290 TraceCheckUtils]: 105: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,235 INFO L290 TraceCheckUtils]: 106: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} assume !!(#t~post7 < 20);havoc #t~post7; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,235 INFO L272 TraceCheckUtils]: 107: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= 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)); {37181#true} is VALID [2022-04-27 13:19:19,235 INFO L290 TraceCheckUtils]: 108: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:19,235 INFO L290 TraceCheckUtils]: 109: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:19,235 INFO L290 TraceCheckUtils]: 110: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:19,235 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {37181#true} {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} #96#return; {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} is VALID [2022-04-27 13:19:19,240 INFO L290 TraceCheckUtils]: 112: Hoare triple {37458#(and (exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2))) (<= main_~v~0 5))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} is VALID [2022-04-27 13:19:19,243 INFO L290 TraceCheckUtils]: 113: Hoare triple {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} is VALID [2022-04-27 13:19:19,248 INFO L290 TraceCheckUtils]: 114: Hoare triple {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} assume !!(#t~post7 < 20);havoc #t~post7; {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} is VALID [2022-04-27 13:19:19,248 INFO L272 TraceCheckUtils]: 115: Hoare triple {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 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)); {37181#true} is VALID [2022-04-27 13:19:19,248 INFO L290 TraceCheckUtils]: 116: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:19,248 INFO L290 TraceCheckUtils]: 117: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:19,248 INFO L290 TraceCheckUtils]: 118: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:19,249 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {37181#true} {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} #96#return; {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} is VALID [2022-04-27 13:19:19,251 INFO L290 TraceCheckUtils]: 120: Hoare triple {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} assume !(~r~0 > 0); {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} is VALID [2022-04-27 13:19:19,256 INFO L290 TraceCheckUtils]: 121: Hoare triple {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} is VALID [2022-04-27 13:19:19,265 INFO L290 TraceCheckUtils]: 122: Hoare triple {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} assume !!(#t~post8 < 20);havoc #t~post8; {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} is VALID [2022-04-27 13:19:19,266 INFO L272 TraceCheckUtils]: 123: Hoare triple {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 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)); {37181#true} is VALID [2022-04-27 13:19:19,266 INFO L290 TraceCheckUtils]: 124: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:19,266 INFO L290 TraceCheckUtils]: 125: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:19,266 INFO L290 TraceCheckUtils]: 126: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:19,266 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {37181#true} {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} #98#return; {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} is VALID [2022-04-27 13:19:19,268 INFO L290 TraceCheckUtils]: 128: Hoare triple {37531#(exists ((aux_div_aux_mod_v_main_~u~0_47_42_33 Int) (aux_div_v_main_~r~0_65_101 Int) (aux_div_v_main_~u~0_47_42 Int)) (and (< (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_v_main_~u~0_47_42)) 1) (+ (* aux_div_aux_mod_v_main_~u~0_47_42_33 aux_div_aux_mod_v_main_~u~0_47_42_33) (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42))) (< (* 2 aux_div_v_main_~u~0_47_42) (+ 5 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) main_~r~0)) (<= 0 (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (< (+ (* aux_div_v_main_~u~0_47_42 aux_div_v_main_~u~0_47_42) (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33)) (+ (* aux_div_v_main_~r~0_65_101 2) (* 2 aux_div_v_main_~u~0_47_42) 1)) (< (* 2 aux_div_aux_mod_v_main_~u~0_47_42_33) 2)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 129: Hoare triple {37182#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 130: Hoare triple {37182#false} assume !!(#t~post8 < 20);havoc #t~post8; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L272 TraceCheckUtils]: 131: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 132: Hoare triple {37182#false} ~cond := #in~cond; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 133: Hoare triple {37182#false} assume !(0 == ~cond); {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 134: Hoare triple {37182#false} assume true; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {37182#false} {37182#false} #98#return; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 136: Hoare triple {37182#false} assume !(~r~0 < 0); {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 137: Hoare triple {37182#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 138: Hoare triple {37182#false} assume !!(#t~post6 < 20);havoc #t~post6; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L272 TraceCheckUtils]: 139: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 140: Hoare triple {37182#false} ~cond := #in~cond; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 141: Hoare triple {37182#false} assume !(0 == ~cond); {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 142: Hoare triple {37182#false} assume true; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {37182#false} {37182#false} #94#return; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 144: Hoare triple {37182#false} assume !!(0 != ~r~0); {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 145: Hoare triple {37182#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 146: Hoare triple {37182#false} assume !!(#t~post7 < 20);havoc #t~post7; {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L272 TraceCheckUtils]: 147: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37182#false} is VALID [2022-04-27 13:19:19,269 INFO L290 TraceCheckUtils]: 148: Hoare triple {37182#false} ~cond := #in~cond; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 149: Hoare triple {37182#false} assume !(0 == ~cond); {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 150: Hoare triple {37182#false} assume true; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {37182#false} {37182#false} #96#return; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 152: Hoare triple {37182#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 153: Hoare triple {37182#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 154: Hoare triple {37182#false} assume !!(#t~post7 < 20);havoc #t~post7; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L272 TraceCheckUtils]: 155: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 156: Hoare triple {37182#false} ~cond := #in~cond; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 157: Hoare triple {37182#false} assume !(0 == ~cond); {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 158: Hoare triple {37182#false} assume true; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {37182#false} {37182#false} #96#return; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 160: Hoare triple {37182#false} assume !(~r~0 > 0); {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 161: Hoare triple {37182#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 162: Hoare triple {37182#false} assume !!(#t~post8 < 20);havoc #t~post8; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L272 TraceCheckUtils]: 163: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 164: Hoare triple {37182#false} ~cond := #in~cond; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 165: Hoare triple {37182#false} assume !(0 == ~cond); {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 166: Hoare triple {37182#false} assume true; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {37182#false} {37182#false} #98#return; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 168: Hoare triple {37182#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37182#false} is VALID [2022-04-27 13:19:19,270 INFO L290 TraceCheckUtils]: 169: Hoare triple {37182#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 170: Hoare triple {37182#false} assume !!(#t~post8 < 20);havoc #t~post8; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L272 TraceCheckUtils]: 171: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 172: Hoare triple {37182#false} ~cond := #in~cond; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 173: Hoare triple {37182#false} assume !(0 == ~cond); {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 174: Hoare triple {37182#false} assume true; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {37182#false} {37182#false} #98#return; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 176: Hoare triple {37182#false} assume !(~r~0 < 0); {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 177: Hoare triple {37182#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 178: Hoare triple {37182#false} assume !(#t~post6 < 20);havoc #t~post6; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L272 TraceCheckUtils]: 179: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 180: Hoare triple {37182#false} ~cond := #in~cond; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 181: Hoare triple {37182#false} assume 0 == ~cond; {37182#false} is VALID [2022-04-27 13:19:19,271 INFO L290 TraceCheckUtils]: 182: Hoare triple {37182#false} assume !false; {37182#false} is VALID [2022-04-27 13:19:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 490 proven. 112 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-04-27 13:19:19,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:19:21,150 INFO L290 TraceCheckUtils]: 182: Hoare triple {37182#false} assume !false; {37182#false} is VALID [2022-04-27 13:19:21,150 INFO L290 TraceCheckUtils]: 181: Hoare triple {37182#false} assume 0 == ~cond; {37182#false} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 180: Hoare triple {37182#false} ~cond := #in~cond; {37182#false} is VALID [2022-04-27 13:19:21,151 INFO L272 TraceCheckUtils]: 179: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37182#false} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 178: Hoare triple {37182#false} assume !(#t~post6 < 20);havoc #t~post6; {37182#false} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 177: Hoare triple {37182#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37182#false} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 176: Hoare triple {37182#false} assume !(~r~0 < 0); {37182#false} is VALID [2022-04-27 13:19:21,151 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {37181#true} {37182#false} #98#return; {37182#false} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 174: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 173: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 172: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,151 INFO L272 TraceCheckUtils]: 171: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 170: Hoare triple {37182#false} assume !!(#t~post8 < 20);havoc #t~post8; {37182#false} is VALID [2022-04-27 13:19:21,151 INFO L290 TraceCheckUtils]: 169: Hoare triple {37182#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 168: Hoare triple {37182#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {37181#true} {37182#false} #98#return; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 166: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 165: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 164: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L272 TraceCheckUtils]: 163: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 162: Hoare triple {37182#false} assume !!(#t~post8 < 20);havoc #t~post8; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 161: Hoare triple {37182#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 160: Hoare triple {37182#false} assume !(~r~0 > 0); {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {37181#true} {37182#false} #96#return; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 158: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 157: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 156: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L272 TraceCheckUtils]: 155: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 154: Hoare triple {37182#false} assume !!(#t~post7 < 20);havoc #t~post7; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 153: Hoare triple {37182#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 152: Hoare triple {37182#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {37181#true} {37182#false} #96#return; {37182#false} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 150: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 149: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,152 INFO L290 TraceCheckUtils]: 148: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L272 TraceCheckUtils]: 147: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 146: Hoare triple {37182#false} assume !!(#t~post7 < 20);havoc #t~post7; {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 145: Hoare triple {37182#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 144: Hoare triple {37182#false} assume !!(0 != ~r~0); {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {37181#true} {37182#false} #94#return; {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 142: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 141: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 140: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L272 TraceCheckUtils]: 139: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 138: Hoare triple {37182#false} assume !!(#t~post6 < 20);havoc #t~post6; {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 137: Hoare triple {37182#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 136: Hoare triple {37182#false} assume !(~r~0 < 0); {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {37181#true} {37182#false} #98#return; {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 134: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 133: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 132: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L272 TraceCheckUtils]: 131: Hoare triple {37182#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 130: Hoare triple {37182#false} assume !!(#t~post8 < 20);havoc #t~post8; {37182#false} is VALID [2022-04-27 13:19:21,153 INFO L290 TraceCheckUtils]: 129: Hoare triple {37182#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37182#false} is VALID [2022-04-27 13:19:21,154 INFO L290 TraceCheckUtils]: 128: Hoare triple {37904#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37182#false} is VALID [2022-04-27 13:19:21,154 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {37181#true} {37904#(not (< main_~r~0 0))} #98#return; {37904#(not (< main_~r~0 0))} is VALID [2022-04-27 13:19:21,154 INFO L290 TraceCheckUtils]: 126: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,154 INFO L290 TraceCheckUtils]: 125: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,154 INFO L290 TraceCheckUtils]: 124: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,154 INFO L272 TraceCheckUtils]: 123: Hoare triple {37904#(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)); {37181#true} is VALID [2022-04-27 13:19:21,155 INFO L290 TraceCheckUtils]: 122: Hoare triple {37904#(not (< main_~r~0 0))} assume !!(#t~post8 < 20);havoc #t~post8; {37904#(not (< main_~r~0 0))} is VALID [2022-04-27 13:19:21,155 INFO L290 TraceCheckUtils]: 121: Hoare triple {37904#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37904#(not (< main_~r~0 0))} is VALID [2022-04-27 13:19:21,155 INFO L290 TraceCheckUtils]: 120: Hoare triple {37904#(not (< main_~r~0 0))} assume !(~r~0 > 0); {37904#(not (< main_~r~0 0))} is VALID [2022-04-27 13:19:21,156 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {37181#true} {37904#(not (< main_~r~0 0))} #96#return; {37904#(not (< main_~r~0 0))} is VALID [2022-04-27 13:19:21,156 INFO L290 TraceCheckUtils]: 118: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,156 INFO L290 TraceCheckUtils]: 117: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,156 INFO L290 TraceCheckUtils]: 116: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,156 INFO L272 TraceCheckUtils]: 115: Hoare triple {37904#(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)); {37181#true} is VALID [2022-04-27 13:19:21,156 INFO L290 TraceCheckUtils]: 114: Hoare triple {37904#(not (< main_~r~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {37904#(not (< main_~r~0 0))} is VALID [2022-04-27 13:19:21,156 INFO L290 TraceCheckUtils]: 113: Hoare triple {37904#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37904#(not (< main_~r~0 0))} is VALID [2022-04-27 13:19:21,157 INFO L290 TraceCheckUtils]: 112: Hoare triple {37953#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37904#(not (< main_~r~0 0))} is VALID [2022-04-27 13:19:21,158 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {37181#true} {37953#(<= main_~v~0 main_~r~0)} #96#return; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,158 INFO L290 TraceCheckUtils]: 110: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,158 INFO L290 TraceCheckUtils]: 109: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,158 INFO L290 TraceCheckUtils]: 108: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,158 INFO L272 TraceCheckUtils]: 107: Hoare triple {37953#(<= 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)); {37181#true} is VALID [2022-04-27 13:19:21,158 INFO L290 TraceCheckUtils]: 106: Hoare triple {37953#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 20);havoc #t~post7; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,158 INFO L290 TraceCheckUtils]: 105: Hoare triple {37953#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,159 INFO L290 TraceCheckUtils]: 104: Hoare triple {37953#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,159 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {37181#true} {37953#(<= main_~v~0 main_~r~0)} #94#return; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,159 INFO L290 TraceCheckUtils]: 102: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,159 INFO L290 TraceCheckUtils]: 101: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,159 INFO L290 TraceCheckUtils]: 100: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,159 INFO L272 TraceCheckUtils]: 99: Hoare triple {37953#(<= 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)); {37181#true} is VALID [2022-04-27 13:19:21,159 INFO L290 TraceCheckUtils]: 98: Hoare triple {37953#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 20);havoc #t~post6; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,160 INFO L290 TraceCheckUtils]: 97: Hoare triple {37953#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,160 INFO L290 TraceCheckUtils]: 96: Hoare triple {37953#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,160 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {37181#true} {37953#(<= main_~v~0 main_~r~0)} #98#return; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,160 INFO L290 TraceCheckUtils]: 94: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,160 INFO L290 TraceCheckUtils]: 93: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,161 INFO L272 TraceCheckUtils]: 91: Hoare triple {37953#(<= 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)); {37181#true} is VALID [2022-04-27 13:19:21,161 INFO L290 TraceCheckUtils]: 90: Hoare triple {37953#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 20);havoc #t~post8; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,161 INFO L290 TraceCheckUtils]: 89: Hoare triple {37953#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,162 INFO L290 TraceCheckUtils]: 88: Hoare triple {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37953#(<= main_~v~0 main_~r~0)} is VALID [2022-04-27 13:19:21,162 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37181#true} {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:19:21,162 INFO L290 TraceCheckUtils]: 86: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,163 INFO L290 TraceCheckUtils]: 85: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,163 INFO L290 TraceCheckUtils]: 84: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,163 INFO L272 TraceCheckUtils]: 83: Hoare triple {38026#(<= 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)); {37181#true} is VALID [2022-04-27 13:19:21,163 INFO L290 TraceCheckUtils]: 82: Hoare triple {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:19:21,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:19:21,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:19:21,164 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37181#true} {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:19:21,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,164 INFO L272 TraceCheckUtils]: 75: Hoare triple {38026#(<= 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)); {37181#true} is VALID [2022-04-27 13:19:21,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:19:21,165 INFO L290 TraceCheckUtils]: 73: Hoare triple {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:19:21,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {38075#(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; {38026#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:19:21,166 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37181#true} {38075#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {38075#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-27 13:19:21,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,166 INFO L290 TraceCheckUtils]: 69: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,166 INFO L290 TraceCheckUtils]: 68: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,166 INFO L272 TraceCheckUtils]: 67: Hoare triple {38075#(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)); {37181#true} is VALID [2022-04-27 13:19:21,166 INFO L290 TraceCheckUtils]: 66: Hoare triple {38075#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {38075#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-27 13:19:21,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {38075#(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; {38075#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-27 13:19:21,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {38100#(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; {38075#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-27 13:19:21,168 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37181#true} {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,168 INFO L272 TraceCheckUtils]: 59: Hoare triple {38100#(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)); {37181#true} is VALID [2022-04-27 13:19:21,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 20);havoc #t~post7; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {38100#(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; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,170 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37181#true} {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,170 INFO L272 TraceCheckUtils]: 51: Hoare triple {38100#(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)); {37181#true} is VALID [2022-04-27 13:19:21,170 INFO L290 TraceCheckUtils]: 50: Hoare triple {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 20);havoc #t~post6; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {38100#(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; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,171 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37181#true} {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,171 INFO L272 TraceCheckUtils]: 43: Hoare triple {38100#(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)); {37181#true} is VALID [2022-04-27 13:19:21,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 20);havoc #t~post8; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {38100#(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; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {38173#(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; {38100#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-27 13:19:21,174 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37181#true} {38173#(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; {38173#(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-27 13:19:21,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,174 INFO L272 TraceCheckUtils]: 35: Hoare triple {38173#(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)); {37181#true} is VALID [2022-04-27 13:19:21,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {38173#(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 < 20);havoc #t~post8; {38173#(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-27 13:19:21,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {38173#(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; {38173#(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-27 13:19:21,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {38173#(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); {38173#(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-27 13:19:21,176 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37181#true} {38173#(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; {38173#(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-27 13:19:21,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,176 INFO L272 TraceCheckUtils]: 27: Hoare triple {38173#(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)); {37181#true} is VALID [2022-04-27 13:19:21,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {38173#(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 < 20);havoc #t~post7; {38173#(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-27 13:19:21,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {38173#(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; {38173#(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-27 13:19:21,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {38173#(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); {38173#(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-27 13:19:21,177 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37181#true} {38173#(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; {38173#(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-27 13:19:21,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,177 INFO L272 TraceCheckUtils]: 19: Hoare triple {38173#(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)); {37181#true} is VALID [2022-04-27 13:19:21,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {38173#(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 < 20);havoc #t~post6; {38173#(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-27 13:19:21,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {38173#(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; {38173#(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-27 13:19:21,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {38246#(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; {38173#(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-27 13:19:21,181 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37211#(not (= |assume_abort_if_not_#in~cond| 0))} {37181#true} #92#return; {38246#(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-27 13:19:21,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {37211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {37211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:19:21,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {38259#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {37211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:19:21,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {37181#true} ~cond := #in~cond; {38259#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:19:21,182 INFO L272 TraceCheckUtils]: 11: Hoare triple {37181#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)); {37181#true} is VALID [2022-04-27 13:19:21,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37181#true} {37181#true} #90#return; {37181#true} is VALID [2022-04-27 13:19:21,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {37181#true} assume !(0 == ~cond); {37181#true} is VALID [2022-04-27 13:19:21,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {37181#true} ~cond := #in~cond; {37181#true} is VALID [2022-04-27 13:19:21,182 INFO L272 TraceCheckUtils]: 6: Hoare triple {37181#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37181#true} is VALID [2022-04-27 13:19:21,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {37181#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; {37181#true} is VALID [2022-04-27 13:19:21,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {37181#true} call #t~ret9 := main(); {37181#true} is VALID [2022-04-27 13:19:21,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37181#true} {37181#true} #102#return; {37181#true} is VALID [2022-04-27 13:19:21,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {37181#true} assume true; {37181#true} is VALID [2022-04-27 13:19:21,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {37181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37181#true} is VALID [2022-04-27 13:19:21,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {37181#true} call ULTIMATE.init(); {37181#true} is VALID [2022-04-27 13:19:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 189 proven. 92 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2022-04-27 13:19:21,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:19:21,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318173184] [2022-04-27 13:19:21,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:19:21,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957942413] [2022-04-27 13:19:21,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957942413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:19:21,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:19:21,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-04-27 13:19:21,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429366477] [2022-04-27 13:19:21,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:19:21,186 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.157894736842105) internal successors, (117), 17 states have internal predecessors, (117), 15 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) Word has length 183 [2022-04-27 13:19:21,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:19:21,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 6.157894736842105) internal successors, (117), 17 states have internal predecessors, (117), 15 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) [2022-04-27 13:19:32,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 193 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:32,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 13:19:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:19:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 13:19:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:19:32,121 INFO L87 Difference]: Start difference. First operand 748 states and 971 transitions. Second operand has 20 states, 19 states have (on average 6.157894736842105) internal successors, (117), 17 states have internal predecessors, (117), 15 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) [2022-04-27 13:19:44,604 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-27 13:20:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:12,179 INFO L93 Difference]: Finished difference Result 2293 states and 3134 transitions. [2022-04-27 13:20:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 13:20:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.157894736842105) internal successors, (117), 17 states have internal predecessors, (117), 15 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) Word has length 183 [2022-04-27 13:20:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 6.157894736842105) internal successors, (117), 17 states have internal predecessors, (117), 15 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) [2022-04-27 13:20:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 665 transitions. [2022-04-27 13:20:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 6.157894736842105) internal successors, (117), 17 states have internal predecessors, (117), 15 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) [2022-04-27 13:20:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 665 transitions. [2022-04-27 13:20:12,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 665 transitions. [2022-04-27 13:20:33,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 665 edges. 657 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:33,219 INFO L225 Difference]: With dead ends: 2293 [2022-04-27 13:20:33,219 INFO L226 Difference]: Without dead ends: 1992 [2022-04-27 13:20:33,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 347 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=354, Invalid=2095, Unknown=1, NotChecked=0, Total=2450 [2022-04-27 13:20:33,221 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 268 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 193 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 945 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:33,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1787 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 806 Invalid, 1 Unknown, 945 Unchecked, 7.2s Time] [2022-04-27 13:20:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-04-27 13:20:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1090. [2022-04-27 13:20:34,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:34,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1992 states. Second operand has 1090 states, 828 states have (on average 1.2016908212560387) internal successors, (995), 828 states have internal predecessors, (995), 238 states have call successors, (238), 25 states have call predecessors, (238), 23 states have return successors, (236), 236 states have call predecessors, (236), 236 states have call successors, (236) [2022-04-27 13:20:34,367 INFO L74 IsIncluded]: Start isIncluded. First operand 1992 states. Second operand has 1090 states, 828 states have (on average 1.2016908212560387) internal successors, (995), 828 states have internal predecessors, (995), 238 states have call successors, (238), 25 states have call predecessors, (238), 23 states have return successors, (236), 236 states have call predecessors, (236), 236 states have call successors, (236) [2022-04-27 13:20:34,368 INFO L87 Difference]: Start difference. First operand 1992 states. Second operand has 1090 states, 828 states have (on average 1.2016908212560387) internal successors, (995), 828 states have internal predecessors, (995), 238 states have call successors, (238), 25 states have call predecessors, (238), 23 states have return successors, (236), 236 states have call predecessors, (236), 236 states have call successors, (236) [2022-04-27 13:20:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:34,493 INFO L93 Difference]: Finished difference Result 1992 states and 2737 transitions. [2022-04-27 13:20:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2737 transitions. [2022-04-27 13:20:34,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:34,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:34,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 1090 states, 828 states have (on average 1.2016908212560387) internal successors, (995), 828 states have internal predecessors, (995), 238 states have call successors, (238), 25 states have call predecessors, (238), 23 states have return successors, (236), 236 states have call predecessors, (236), 236 states have call successors, (236) Second operand 1992 states. [2022-04-27 13:20:34,501 INFO L87 Difference]: Start difference. First operand has 1090 states, 828 states have (on average 1.2016908212560387) internal successors, (995), 828 states have internal predecessors, (995), 238 states have call successors, (238), 25 states have call predecessors, (238), 23 states have return successors, (236), 236 states have call predecessors, (236), 236 states have call successors, (236) Second operand 1992 states. [2022-04-27 13:20:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:34,618 INFO L93 Difference]: Finished difference Result 1992 states and 2737 transitions. [2022-04-27 13:20:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2737 transitions. [2022-04-27 13:20:34,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:34,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:34,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:34,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 828 states have (on average 1.2016908212560387) internal successors, (995), 828 states have internal predecessors, (995), 238 states have call successors, (238), 25 states have call predecessors, (238), 23 states have return successors, (236), 236 states have call predecessors, (236), 236 states have call successors, (236) [2022-04-27 13:20:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1469 transitions. [2022-04-27 13:20:34,669 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1469 transitions. Word has length 183 [2022-04-27 13:20:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:34,670 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1469 transitions. [2022-04-27 13:20:34,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.157894736842105) internal successors, (117), 17 states have internal predecessors, (117), 15 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) [2022-04-27 13:20:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1469 transitions. [2022-04-27 13:20:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-04-27 13:20:34,673 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:34,673 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 9, 9, 9, 9, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:34,689 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-27 13:20:34,887 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-27 13:20:34,887 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash -222091437, now seen corresponding path program 3 times [2022-04-27 13:20:34,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:34,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172788206] [2022-04-27 13:20:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:34,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:34,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:34,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1117035796] [2022-04-27 13:20:34,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:20:34,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:34,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:34,914 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-27 13:20:34,915 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-27 13:20:34,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 13:20:34,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:20:34,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:20:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:35,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:20:35,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {47067#true} call ULTIMATE.init(); {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {47067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47067#true} {47067#true} #102#return; {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {47067#true} call #t~ret9 := main(); {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {47067#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; {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {47067#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,673 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47067#true} {47067#true} #90#return; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L272 TraceCheckUtils]: 11: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47067#true} {47067#true} #92#return; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {47067#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {47067#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {47067#true} assume !!(#t~post6 < 20);havoc #t~post6; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L272 TraceCheckUtils]: 19: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47067#true} {47067#true} #94#return; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {47067#true} assume !!(0 != ~r~0); {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L272 TraceCheckUtils]: 27: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,674 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {47067#true} assume !(~r~0 > 0); {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {47067#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {47067#true} assume !!(#t~post8 < 20);havoc #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L272 TraceCheckUtils]: 35: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47067#true} {47067#true} #98#return; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {47067#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {47067#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {47067#true} assume !!(#t~post8 < 20);havoc #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L272 TraceCheckUtils]: 43: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47067#true} {47067#true} #98#return; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {47067#true} assume !(~r~0 < 0); {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {47067#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {47067#true} assume !!(#t~post6 < 20);havoc #t~post6; {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L272 TraceCheckUtils]: 51: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47067#true} {47067#true} #94#return; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {47067#true} assume !!(0 != ~r~0); {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L272 TraceCheckUtils]: 59: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 64: Hoare triple {47067#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 65: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 66: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L272 TraceCheckUtils]: 67: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,676 INFO L290 TraceCheckUtils]: 69: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,687 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {47067#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47067#true} is VALID [2022-04-27 13:20:35,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L272 TraceCheckUtils]: 75: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 78: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 80: Hoare triple {47067#true} assume !(~r~0 > 0); {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 81: Hoare triple {47067#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 82: Hoare triple {47067#true} assume !!(#t~post8 < 20);havoc #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L272 TraceCheckUtils]: 83: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 84: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 85: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 86: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47067#true} {47067#true} #98#return; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 88: Hoare triple {47067#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 89: Hoare triple {47067#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 90: Hoare triple {47067#true} assume !!(#t~post8 < 20);havoc #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L272 TraceCheckUtils]: 91: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 92: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 93: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,688 INFO L290 TraceCheckUtils]: 94: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47067#true} {47067#true} #98#return; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 96: Hoare triple {47067#true} assume !(~r~0 < 0); {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 97: Hoare triple {47067#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 98: Hoare triple {47067#true} assume !!(#t~post6 < 20);havoc #t~post6; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L272 TraceCheckUtils]: 99: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 100: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 101: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 102: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {47067#true} {47067#true} #94#return; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 104: Hoare triple {47067#true} assume !!(0 != ~r~0); {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 105: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 106: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L272 TraceCheckUtils]: 107: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 108: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 109: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 110: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 112: Hoare triple {47067#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 113: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L290 TraceCheckUtils]: 114: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,689 INFO L272 TraceCheckUtils]: 115: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 116: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 117: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 118: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 120: Hoare triple {47067#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 121: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 122: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L272 TraceCheckUtils]: 123: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 124: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 125: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 126: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 128: Hoare triple {47067#true} assume !(~r~0 > 0); {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 129: Hoare triple {47067#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 130: Hoare triple {47067#true} assume !!(#t~post8 < 20);havoc #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L272 TraceCheckUtils]: 131: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 132: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 133: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 134: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {47067#true} {47067#true} #98#return; {47067#true} is VALID [2022-04-27 13:20:35,690 INFO L290 TraceCheckUtils]: 136: Hoare triple {47067#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 137: Hoare triple {47067#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 138: Hoare triple {47067#true} assume !!(#t~post8 < 20);havoc #t~post8; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L272 TraceCheckUtils]: 139: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 140: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 141: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 142: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {47067#true} {47067#true} #98#return; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 144: Hoare triple {47067#true} assume !(~r~0 < 0); {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 145: Hoare triple {47067#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 146: Hoare triple {47067#true} assume !!(#t~post6 < 20);havoc #t~post6; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L272 TraceCheckUtils]: 147: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 148: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 149: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 150: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {47067#true} {47067#true} #94#return; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 152: Hoare triple {47067#true} assume !!(0 != ~r~0); {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 153: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 154: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L272 TraceCheckUtils]: 155: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 156: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,691 INFO L290 TraceCheckUtils]: 157: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L290 TraceCheckUtils]: 158: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L290 TraceCheckUtils]: 160: Hoare triple {47067#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L290 TraceCheckUtils]: 161: Hoare triple {47067#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L290 TraceCheckUtils]: 162: Hoare triple {47067#true} assume !!(#t~post7 < 20);havoc #t~post7; {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L272 TraceCheckUtils]: 163: Hoare triple {47067#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)); {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L290 TraceCheckUtils]: 164: Hoare triple {47067#true} ~cond := #in~cond; {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L290 TraceCheckUtils]: 165: Hoare triple {47067#true} assume !(0 == ~cond); {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L290 TraceCheckUtils]: 166: Hoare triple {47067#true} assume true; {47067#true} is VALID [2022-04-27 13:20:35,692 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {47067#true} {47067#true} #96#return; {47067#true} is VALID [2022-04-27 13:20:35,693 INFO L290 TraceCheckUtils]: 168: Hoare triple {47067#true} assume !(~r~0 > 0); {47576#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:20:35,693 INFO L290 TraceCheckUtils]: 169: Hoare triple {47576#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47576#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:20:35,693 INFO L290 TraceCheckUtils]: 170: Hoare triple {47576#(not (< 0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {47576#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:20:35,693 INFO L272 TraceCheckUtils]: 171: Hoare triple {47576#(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)); {47067#true} is VALID [2022-04-27 13:20:35,694 INFO L290 TraceCheckUtils]: 172: Hoare triple {47067#true} ~cond := #in~cond; {47589#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:20:35,694 INFO L290 TraceCheckUtils]: 173: Hoare triple {47589#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {47593#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:20:35,694 INFO L290 TraceCheckUtils]: 174: Hoare triple {47593#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {47593#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:20:35,695 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {47593#(not (= |__VERIFIER_assert_#in~cond| 0))} {47576#(not (< 0 main_~r~0))} #98#return; {47600#(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-27 13:20:35,697 INFO L290 TraceCheckUtils]: 176: Hoare triple {47600#(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); {47604#(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-27 13:20:35,697 INFO L290 TraceCheckUtils]: 177: Hoare triple {47604#(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; {47604#(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-27 13:20:35,698 INFO L290 TraceCheckUtils]: 178: Hoare triple {47604#(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 < 20);havoc #t~post6; {47604#(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-27 13:20:35,699 INFO L272 TraceCheckUtils]: 179: Hoare triple {47604#(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)); {47614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:20:35,699 INFO L290 TraceCheckUtils]: 180: Hoare triple {47614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {47618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:20:35,699 INFO L290 TraceCheckUtils]: 181: Hoare triple {47618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {47068#false} is VALID [2022-04-27 13:20:35,699 INFO L290 TraceCheckUtils]: 182: Hoare triple {47068#false} assume !false; {47068#false} is VALID [2022-04-27 13:20:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 128 proven. 1 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2022-04-27 13:20:35,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:20:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:38,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172788206] [2022-04-27 13:20:38,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:20:38,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117035796] [2022-04-27 13:20:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117035796] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:20:38,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:20:38,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 13:20:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261741616] [2022-04-27 13:20:38,098 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:20:38,099 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 183 [2022-04-27 13:20:38,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:38,099 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-27 13:20:38,142 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-27 13:20:38,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:20:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:38,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:20:38,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-27 13:20:38,143 INFO L87 Difference]: Start difference. First operand 1090 states and 1469 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-27 13:20:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:40,068 INFO L93 Difference]: Finished difference Result 1185 states and 1590 transitions. [2022-04-27 13:20:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:20:40,068 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 183 [2022-04-27 13:20:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:40,069 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-27 13:20:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-04-27 13:20:40,070 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-27 13:20:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-04-27 13:20:40,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 106 transitions. [2022-04-27 13:20:40,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:40,205 INFO L225 Difference]: With dead ends: 1185 [2022-04-27 13:20:40,206 INFO L226 Difference]: Without dead ends: 1117 [2022-04-27 13:20:40,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-04-27 13:20:40,206 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:40,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 259 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:20:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2022-04-27 13:20:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1057. [2022-04-27 13:20:41,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:41,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1117 states. Second operand has 1057 states, 797 states have (on average 1.191969887076537) internal successors, (950), 808 states have internal predecessors, (950), 234 states have call successors, (234), 27 states have call predecessors, (234), 25 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-27 13:20:41,324 INFO L74 IsIncluded]: Start isIncluded. First operand 1117 states. Second operand has 1057 states, 797 states have (on average 1.191969887076537) internal successors, (950), 808 states have internal predecessors, (950), 234 states have call successors, (234), 27 states have call predecessors, (234), 25 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-27 13:20:41,325 INFO L87 Difference]: Start difference. First operand 1117 states. Second operand has 1057 states, 797 states have (on average 1.191969887076537) internal successors, (950), 808 states have internal predecessors, (950), 234 states have call successors, (234), 27 states have call predecessors, (234), 25 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-27 13:20:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:41,361 INFO L93 Difference]: Finished difference Result 1117 states and 1499 transitions. [2022-04-27 13:20:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1499 transitions. [2022-04-27 13:20:41,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:41,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:41,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 1057 states, 797 states have (on average 1.191969887076537) internal successors, (950), 808 states have internal predecessors, (950), 234 states have call successors, (234), 27 states have call predecessors, (234), 25 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) Second operand 1117 states. [2022-04-27 13:20:41,365 INFO L87 Difference]: Start difference. First operand has 1057 states, 797 states have (on average 1.191969887076537) internal successors, (950), 808 states have internal predecessors, (950), 234 states have call successors, (234), 27 states have call predecessors, (234), 25 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) Second operand 1117 states. [2022-04-27 13:20:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:41,402 INFO L93 Difference]: Finished difference Result 1117 states and 1499 transitions. [2022-04-27 13:20:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1499 transitions. [2022-04-27 13:20:41,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:41,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:41,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:41,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 797 states have (on average 1.191969887076537) internal successors, (950), 808 states have internal predecessors, (950), 234 states have call successors, (234), 27 states have call predecessors, (234), 25 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-27 13:20:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1416 transitions. [2022-04-27 13:20:41,447 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1416 transitions. Word has length 183 [2022-04-27 13:20:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:41,448 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 1416 transitions. [2022-04-27 13:20:41,448 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-27 13:20:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1416 transitions. [2022-04-27 13:20:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-04-27 13:20:41,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:41,450 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 10, 10, 10, 10, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:41,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 13:20:41,663 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-27 13:20:41,663 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1152868147, now seen corresponding path program 4 times [2022-04-27 13:20:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:41,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846194532] [2022-04-27 13:20:41,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:41,680 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:41,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830486905] [2022-04-27 13:20:41,680 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:20:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:41,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:41,681 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-27 13:20:41,682 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-27 13:20:41,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:20:41,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:20:41,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:20:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:41,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:20:42,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {53012#true} call ULTIMATE.init(); {53012#true} is VALID [2022-04-27 13:20:42,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {53012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {53012#true} is VALID [2022-04-27 13:20:42,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:42,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53012#true} {53012#true} #102#return; {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {53012#true} call #t~ret9 := main(); {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {53012#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; {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L272 TraceCheckUtils]: 6: Hoare triple {53012#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53012#true} {53012#true} #90#return; {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L272 TraceCheckUtils]: 11: Hoare triple {53012#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)); {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,000 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53012#true} {53012#true} #92#return; {53012#true} is VALID [2022-04-27 13:20:43,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {53012#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {53065#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {53065#(<= 1 main_~v~0)} assume !!(#t~post6 < 20);havoc #t~post6; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,002 INFO L272 TraceCheckUtils]: 19: Hoare triple {53065#(<= 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)); {53012#true} is VALID [2022-04-27 13:20:43,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,003 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {53012#true} {53065#(<= 1 main_~v~0)} #94#return; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {53065#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {53065#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {53065#(<= 1 main_~v~0)} assume !!(#t~post7 < 20);havoc #t~post7; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,004 INFO L272 TraceCheckUtils]: 27: Hoare triple {53065#(<= 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)); {53012#true} is VALID [2022-04-27 13:20:43,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,004 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {53012#true} {53065#(<= 1 main_~v~0)} #96#return; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {53065#(<= 1 main_~v~0)} assume !(~r~0 > 0); {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {53065#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {53065#(<= 1 main_~v~0)} assume !!(#t~post8 < 20);havoc #t~post8; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,005 INFO L272 TraceCheckUtils]: 35: Hoare triple {53065#(<= 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)); {53012#true} is VALID [2022-04-27 13:20:43,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,006 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {53012#true} {53065#(<= 1 main_~v~0)} #98#return; {53065#(<= 1 main_~v~0)} is VALID [2022-04-27 13:20:43,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {53065#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 20);havoc #t~post8; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,008 INFO L272 TraceCheckUtils]: 43: Hoare triple {53138#(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)); {53012#true} is VALID [2022-04-27 13:20:43,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,008 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {53012#true} {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 20);havoc #t~post6; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,009 INFO L272 TraceCheckUtils]: 51: Hoare triple {53138#(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)); {53012#true} is VALID [2022-04-27 13:20:43,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,010 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {53012#true} {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,010 INFO L290 TraceCheckUtils]: 56: Hoare triple {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 20);havoc #t~post7; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,011 INFO L272 TraceCheckUtils]: 59: Hoare triple {53138#(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)); {53012#true} is VALID [2022-04-27 13:20:43,011 INFO L290 TraceCheckUtils]: 60: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,011 INFO L290 TraceCheckUtils]: 62: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,011 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53012#true} {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {53138#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-27 13:20:43,012 INFO L290 TraceCheckUtils]: 64: Hoare triple {53138#(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; {53211#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-27 13:20:43,013 INFO L290 TraceCheckUtils]: 65: Hoare triple {53211#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53211#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-27 13:20:43,013 INFO L290 TraceCheckUtils]: 66: Hoare triple {53211#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {53211#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-27 13:20:43,013 INFO L272 TraceCheckUtils]: 67: Hoare triple {53211#(< (+ 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)); {53012#true} is VALID [2022-04-27 13:20:43,013 INFO L290 TraceCheckUtils]: 68: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,013 INFO L290 TraceCheckUtils]: 69: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,013 INFO L290 TraceCheckUtils]: 70: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,013 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {53012#true} {53211#(< (+ main_~r~0 3) main_~u~0)} #96#return; {53211#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-27 13:20:43,014 INFO L290 TraceCheckUtils]: 72: Hoare triple {53211#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:20:43,014 INFO L290 TraceCheckUtils]: 73: Hoare triple {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:20:43,015 INFO L290 TraceCheckUtils]: 74: Hoare triple {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:20:43,015 INFO L272 TraceCheckUtils]: 75: Hoare triple {53236#(< (+ 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)); {53012#true} is VALID [2022-04-27 13:20:43,015 INFO L290 TraceCheckUtils]: 76: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,015 INFO L290 TraceCheckUtils]: 77: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,015 INFO L290 TraceCheckUtils]: 78: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,015 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {53012#true} {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:20:43,015 INFO L290 TraceCheckUtils]: 80: Hoare triple {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !(~r~0 > 0); {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:20:43,016 INFO L290 TraceCheckUtils]: 81: Hoare triple {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:20:43,016 INFO L290 TraceCheckUtils]: 82: Hoare triple {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post8 < 20);havoc #t~post8; {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:20:43,016 INFO L272 TraceCheckUtils]: 83: Hoare triple {53236#(< (+ 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)); {53012#true} is VALID [2022-04-27 13:20:43,016 INFO L290 TraceCheckUtils]: 84: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,016 INFO L290 TraceCheckUtils]: 85: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,016 INFO L290 TraceCheckUtils]: 86: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,017 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {53012#true} {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #98#return; {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:20:43,017 INFO L290 TraceCheckUtils]: 88: Hoare triple {53236#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,018 INFO L290 TraceCheckUtils]: 89: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,018 INFO L290 TraceCheckUtils]: 90: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} assume !!(#t~post8 < 20);havoc #t~post8; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,018 INFO L272 TraceCheckUtils]: 91: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 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)); {53012#true} is VALID [2022-04-27 13:20:43,018 INFO L290 TraceCheckUtils]: 92: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,018 INFO L290 TraceCheckUtils]: 93: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,018 INFO L290 TraceCheckUtils]: 94: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,018 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {53012#true} {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} #98#return; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,019 INFO L290 TraceCheckUtils]: 96: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} assume !(~r~0 < 0); {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,019 INFO L290 TraceCheckUtils]: 97: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,019 INFO L290 TraceCheckUtils]: 98: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} assume !!(#t~post6 < 20);havoc #t~post6; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,019 INFO L272 TraceCheckUtils]: 99: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 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)); {53012#true} is VALID [2022-04-27 13:20:43,019 INFO L290 TraceCheckUtils]: 100: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,019 INFO L290 TraceCheckUtils]: 101: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,019 INFO L290 TraceCheckUtils]: 102: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,020 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {53012#true} {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} #94#return; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,020 INFO L290 TraceCheckUtils]: 104: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} assume !!(0 != ~r~0); {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,020 INFO L290 TraceCheckUtils]: 105: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,021 INFO L290 TraceCheckUtils]: 106: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,021 INFO L272 TraceCheckUtils]: 107: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 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)); {53012#true} is VALID [2022-04-27 13:20:43,021 INFO L290 TraceCheckUtils]: 108: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,021 INFO L290 TraceCheckUtils]: 109: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,021 INFO L290 TraceCheckUtils]: 110: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,021 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {53012#true} {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} #96#return; {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,022 INFO L290 TraceCheckUtils]: 112: Hoare triple {53285#(< (+ (div (+ (- 2) (* (- 1) main_~v~0) (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,023 INFO L290 TraceCheckUtils]: 113: Hoare triple {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,023 INFO L290 TraceCheckUtils]: 114: Hoare triple {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} assume !!(#t~post7 < 20);havoc #t~post7; {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,023 INFO L272 TraceCheckUtils]: 115: Hoare triple {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 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)); {53012#true} is VALID [2022-04-27 13:20:43,023 INFO L290 TraceCheckUtils]: 116: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,023 INFO L290 TraceCheckUtils]: 117: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,023 INFO L290 TraceCheckUtils]: 118: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,023 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {53012#true} {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} #96#return; {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} is VALID [2022-04-27 13:20:43,024 INFO L290 TraceCheckUtils]: 120: Hoare triple {53358#(< (+ main_~v~0 (div (+ 2 (* (- 1) main_~r~0)) (- 2)) 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53383#(< 2 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,024 INFO L290 TraceCheckUtils]: 121: Hoare triple {53383#(< 2 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53383#(< 2 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,025 INFO L290 TraceCheckUtils]: 122: Hoare triple {53383#(< 2 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {53383#(< 2 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,025 INFO L272 TraceCheckUtils]: 123: Hoare triple {53383#(< 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)); {53012#true} is VALID [2022-04-27 13:20:43,025 INFO L290 TraceCheckUtils]: 124: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,025 INFO L290 TraceCheckUtils]: 125: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,025 INFO L290 TraceCheckUtils]: 126: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,025 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {53012#true} {53383#(< 2 (+ main_~u~0 main_~r~0))} #96#return; {53383#(< 2 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,025 INFO L290 TraceCheckUtils]: 128: Hoare triple {53383#(< 2 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {53383#(< 2 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,026 INFO L290 TraceCheckUtils]: 129: Hoare triple {53383#(< 2 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53383#(< 2 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,026 INFO L290 TraceCheckUtils]: 130: Hoare triple {53383#(< 2 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {53383#(< 2 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,026 INFO L272 TraceCheckUtils]: 131: Hoare triple {53383#(< 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)); {53012#true} is VALID [2022-04-27 13:20:43,026 INFO L290 TraceCheckUtils]: 132: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,026 INFO L290 TraceCheckUtils]: 133: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,026 INFO L290 TraceCheckUtils]: 134: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,027 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {53012#true} {53383#(< 2 (+ main_~u~0 main_~r~0))} #98#return; {53383#(< 2 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,027 INFO L290 TraceCheckUtils]: 136: Hoare triple {53383#(< 2 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53432#(< 2 main_~r~0)} is VALID [2022-04-27 13:20:43,028 INFO L290 TraceCheckUtils]: 137: Hoare triple {53432#(< 2 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53432#(< 2 main_~r~0)} is VALID [2022-04-27 13:20:43,028 INFO L290 TraceCheckUtils]: 138: Hoare triple {53432#(< 2 main_~r~0)} assume !!(#t~post8 < 20);havoc #t~post8; {53432#(< 2 main_~r~0)} is VALID [2022-04-27 13:20:43,028 INFO L272 TraceCheckUtils]: 139: Hoare triple {53432#(< 2 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)); {53012#true} is VALID [2022-04-27 13:20:43,028 INFO L290 TraceCheckUtils]: 140: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,028 INFO L290 TraceCheckUtils]: 141: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,028 INFO L290 TraceCheckUtils]: 142: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,029 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {53012#true} {53432#(< 2 main_~r~0)} #98#return; {53432#(< 2 main_~r~0)} is VALID [2022-04-27 13:20:43,029 INFO L290 TraceCheckUtils]: 144: Hoare triple {53432#(< 2 main_~r~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53013#false} is VALID [2022-04-27 13:20:43,029 INFO L290 TraceCheckUtils]: 145: Hoare triple {53013#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,029 INFO L290 TraceCheckUtils]: 146: Hoare triple {53013#false} assume !!(#t~post8 < 20);havoc #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,029 INFO L272 TraceCheckUtils]: 147: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53013#false} is VALID [2022-04-27 13:20:43,029 INFO L290 TraceCheckUtils]: 148: Hoare triple {53013#false} ~cond := #in~cond; {53013#false} is VALID [2022-04-27 13:20:43,029 INFO L290 TraceCheckUtils]: 149: Hoare triple {53013#false} assume !(0 == ~cond); {53013#false} is VALID [2022-04-27 13:20:43,029 INFO L290 TraceCheckUtils]: 150: Hoare triple {53013#false} assume true; {53013#false} is VALID [2022-04-27 13:20:43,029 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {53013#false} {53013#false} #98#return; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 152: Hoare triple {53013#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 153: Hoare triple {53013#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 154: Hoare triple {53013#false} assume !!(#t~post8 < 20);havoc #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L272 TraceCheckUtils]: 155: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 156: Hoare triple {53013#false} ~cond := #in~cond; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 157: Hoare triple {53013#false} assume !(0 == ~cond); {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 158: Hoare triple {53013#false} assume true; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {53013#false} {53013#false} #98#return; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 160: Hoare triple {53013#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 161: Hoare triple {53013#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 162: Hoare triple {53013#false} assume !!(#t~post8 < 20);havoc #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L272 TraceCheckUtils]: 163: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 164: Hoare triple {53013#false} ~cond := #in~cond; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 165: Hoare triple {53013#false} assume !(0 == ~cond); {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 166: Hoare triple {53013#false} assume true; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {53013#false} {53013#false} #98#return; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 168: Hoare triple {53013#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 169: Hoare triple {53013#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 170: Hoare triple {53013#false} assume !!(#t~post8 < 20);havoc #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L272 TraceCheckUtils]: 171: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53013#false} is VALID [2022-04-27 13:20:43,030 INFO L290 TraceCheckUtils]: 172: Hoare triple {53013#false} ~cond := #in~cond; {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L290 TraceCheckUtils]: 173: Hoare triple {53013#false} assume !(0 == ~cond); {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L290 TraceCheckUtils]: 174: Hoare triple {53013#false} assume true; {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {53013#false} {53013#false} #98#return; {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L290 TraceCheckUtils]: 176: Hoare triple {53013#false} assume !(~r~0 < 0); {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L290 TraceCheckUtils]: 177: Hoare triple {53013#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L290 TraceCheckUtils]: 178: Hoare triple {53013#false} assume !(#t~post6 < 20);havoc #t~post6; {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L272 TraceCheckUtils]: 179: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L290 TraceCheckUtils]: 180: Hoare triple {53013#false} ~cond := #in~cond; {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L290 TraceCheckUtils]: 181: Hoare triple {53013#false} assume 0 == ~cond; {53013#false} is VALID [2022-04-27 13:20:43,031 INFO L290 TraceCheckUtils]: 182: Hoare triple {53013#false} assume !false; {53013#false} is VALID [2022-04-27 13:20:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 402 proven. 144 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-04-27 13:20:43,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:20:43,850 INFO L290 TraceCheckUtils]: 182: Hoare triple {53013#false} assume !false; {53013#false} is VALID [2022-04-27 13:20:43,850 INFO L290 TraceCheckUtils]: 181: Hoare triple {53013#false} assume 0 == ~cond; {53013#false} is VALID [2022-04-27 13:20:43,850 INFO L290 TraceCheckUtils]: 180: Hoare triple {53013#false} ~cond := #in~cond; {53013#false} is VALID [2022-04-27 13:20:43,850 INFO L272 TraceCheckUtils]: 179: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53013#false} is VALID [2022-04-27 13:20:43,850 INFO L290 TraceCheckUtils]: 178: Hoare triple {53013#false} assume !(#t~post6 < 20);havoc #t~post6; {53013#false} is VALID [2022-04-27 13:20:43,850 INFO L290 TraceCheckUtils]: 177: Hoare triple {53013#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53013#false} is VALID [2022-04-27 13:20:43,850 INFO L290 TraceCheckUtils]: 176: Hoare triple {53013#false} assume !(~r~0 < 0); {53013#false} is VALID [2022-04-27 13:20:43,850 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {53012#true} {53013#false} #98#return; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 174: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 173: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 172: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L272 TraceCheckUtils]: 171: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 170: Hoare triple {53013#false} assume !!(#t~post8 < 20);havoc #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 169: Hoare triple {53013#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 168: Hoare triple {53013#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {53012#true} {53013#false} #98#return; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 166: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 165: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 164: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L272 TraceCheckUtils]: 163: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 162: Hoare triple {53013#false} assume !!(#t~post8 < 20);havoc #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 161: Hoare triple {53013#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 160: Hoare triple {53013#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {53012#true} {53013#false} #98#return; {53013#false} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 158: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 157: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L290 TraceCheckUtils]: 156: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,851 INFO L272 TraceCheckUtils]: 155: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53012#true} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 154: Hoare triple {53013#false} assume !!(#t~post8 < 20);havoc #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 153: Hoare triple {53013#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 152: Hoare triple {53013#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53013#false} is VALID [2022-04-27 13:20:43,852 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {53012#true} {53013#false} #98#return; {53013#false} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 150: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 149: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 148: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,852 INFO L272 TraceCheckUtils]: 147: Hoare triple {53013#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {53012#true} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 146: Hoare triple {53013#false} assume !!(#t~post8 < 20);havoc #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 145: Hoare triple {53013#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53013#false} is VALID [2022-04-27 13:20:43,852 INFO L290 TraceCheckUtils]: 144: Hoare triple {53685#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53013#false} is VALID [2022-04-27 13:20:43,853 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {53012#true} {53685#(not (< main_~r~0 0))} #98#return; {53685#(not (< main_~r~0 0))} is VALID [2022-04-27 13:20:43,853 INFO L290 TraceCheckUtils]: 142: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,853 INFO L290 TraceCheckUtils]: 141: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,853 INFO L290 TraceCheckUtils]: 140: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,853 INFO L272 TraceCheckUtils]: 139: Hoare triple {53685#(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)); {53012#true} is VALID [2022-04-27 13:20:43,853 INFO L290 TraceCheckUtils]: 138: Hoare triple {53685#(not (< main_~r~0 0))} assume !!(#t~post8 < 20);havoc #t~post8; {53685#(not (< main_~r~0 0))} is VALID [2022-04-27 13:20:43,853 INFO L290 TraceCheckUtils]: 137: Hoare triple {53685#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53685#(not (< main_~r~0 0))} is VALID [2022-04-27 13:20:43,854 INFO L290 TraceCheckUtils]: 136: Hoare triple {53710#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53685#(not (< main_~r~0 0))} is VALID [2022-04-27 13:20:43,855 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {53012#true} {53710#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {53710#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,855 INFO L290 TraceCheckUtils]: 134: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,855 INFO L290 TraceCheckUtils]: 133: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,855 INFO L290 TraceCheckUtils]: 132: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,855 INFO L272 TraceCheckUtils]: 131: Hoare triple {53710#(<= 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)); {53012#true} is VALID [2022-04-27 13:20:43,855 INFO L290 TraceCheckUtils]: 130: Hoare triple {53710#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 20);havoc #t~post8; {53710#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,855 INFO L290 TraceCheckUtils]: 129: Hoare triple {53710#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53710#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,855 INFO L290 TraceCheckUtils]: 128: Hoare triple {53710#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {53710#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,856 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {53012#true} {53710#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {53710#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,856 INFO L290 TraceCheckUtils]: 126: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,856 INFO L290 TraceCheckUtils]: 125: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,856 INFO L290 TraceCheckUtils]: 124: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,856 INFO L272 TraceCheckUtils]: 123: Hoare triple {53710#(<= 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)); {53012#true} is VALID [2022-04-27 13:20:43,856 INFO L290 TraceCheckUtils]: 122: Hoare triple {53710#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {53710#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,857 INFO L290 TraceCheckUtils]: 121: Hoare triple {53710#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53710#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,857 INFO L290 TraceCheckUtils]: 120: Hoare triple {53759#(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; {53710#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:20:43,858 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {53012#true} {53759#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {53759#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:20:43,858 INFO L290 TraceCheckUtils]: 118: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,858 INFO L290 TraceCheckUtils]: 117: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,858 INFO L290 TraceCheckUtils]: 116: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,858 INFO L272 TraceCheckUtils]: 115: Hoare triple {53759#(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)); {53012#true} is VALID [2022-04-27 13:20:43,858 INFO L290 TraceCheckUtils]: 114: Hoare triple {53759#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {53759#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:20:43,858 INFO L290 TraceCheckUtils]: 113: Hoare triple {53759#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53759#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:20:43,859 INFO L290 TraceCheckUtils]: 112: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53759#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:20:43,860 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {53012#true} {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} #96#return; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,860 INFO L290 TraceCheckUtils]: 110: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,860 INFO L290 TraceCheckUtils]: 109: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,860 INFO L290 TraceCheckUtils]: 108: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,860 INFO L272 TraceCheckUtils]: 107: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~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)); {53012#true} is VALID [2022-04-27 13:20:43,860 INFO L290 TraceCheckUtils]: 106: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} assume !!(#t~post7 < 20);havoc #t~post7; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,861 INFO L290 TraceCheckUtils]: 105: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,861 INFO L290 TraceCheckUtils]: 104: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} assume !!(0 != ~r~0); {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,861 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {53012#true} {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} #94#return; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,861 INFO L290 TraceCheckUtils]: 102: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,861 INFO L290 TraceCheckUtils]: 101: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,861 INFO L290 TraceCheckUtils]: 100: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,861 INFO L272 TraceCheckUtils]: 99: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~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)); {53012#true} is VALID [2022-04-27 13:20:43,862 INFO L290 TraceCheckUtils]: 98: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} assume !!(#t~post6 < 20);havoc #t~post6; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,862 INFO L290 TraceCheckUtils]: 97: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,862 INFO L290 TraceCheckUtils]: 96: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} assume !(~r~0 < 0); {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,863 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {53012#true} {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} #98#return; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,863 INFO L290 TraceCheckUtils]: 94: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,863 INFO L290 TraceCheckUtils]: 93: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,863 INFO L290 TraceCheckUtils]: 92: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,863 INFO L272 TraceCheckUtils]: 91: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~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)); {53012#true} is VALID [2022-04-27 13:20:43,863 INFO L290 TraceCheckUtils]: 90: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} assume !!(#t~post8 < 20);havoc #t~post8; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,864 INFO L290 TraceCheckUtils]: 89: Hoare triple {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,865 INFO L290 TraceCheckUtils]: 88: Hoare triple {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53784#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:20:43,865 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {53012#true} {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} #98#return; {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:20:43,865 INFO L290 TraceCheckUtils]: 86: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,865 INFO L290 TraceCheckUtils]: 85: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,865 INFO L290 TraceCheckUtils]: 84: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,865 INFO L272 TraceCheckUtils]: 83: Hoare triple {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~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)); {53012#true} is VALID [2022-04-27 13:20:43,866 INFO L290 TraceCheckUtils]: 82: Hoare triple {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post8 < 20);havoc #t~post8; {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:20:43,866 INFO L290 TraceCheckUtils]: 81: Hoare triple {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:20:43,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} assume !(~r~0 > 0); {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:20:43,867 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {53012#true} {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} #96#return; {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:20:43,867 INFO L290 TraceCheckUtils]: 78: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,867 INFO L290 TraceCheckUtils]: 77: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,867 INFO L272 TraceCheckUtils]: 75: Hoare triple {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~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)); {53012#true} is VALID [2022-04-27 13:20:43,867 INFO L290 TraceCheckUtils]: 74: Hoare triple {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post7 < 20);havoc #t~post7; {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:20:43,867 INFO L290 TraceCheckUtils]: 73: Hoare triple {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:20:43,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {53906#(<= main_~r~0 (+ main_~u~0 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53857#(or (<= (+ main_~u~0 main_~r~0) main_~v~0) (<= main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:20:43,869 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {53012#true} {53906#(<= main_~r~0 (+ main_~u~0 2))} #96#return; {53906#(<= main_~r~0 (+ main_~u~0 2))} is VALID [2022-04-27 13:20:43,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,869 INFO L290 TraceCheckUtils]: 69: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,869 INFO L290 TraceCheckUtils]: 68: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,869 INFO L272 TraceCheckUtils]: 67: Hoare triple {53906#(<= main_~r~0 (+ 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)); {53012#true} is VALID [2022-04-27 13:20:43,869 INFO L290 TraceCheckUtils]: 66: Hoare triple {53906#(<= main_~r~0 (+ main_~u~0 2))} assume !!(#t~post7 < 20);havoc #t~post7; {53906#(<= main_~r~0 (+ main_~u~0 2))} is VALID [2022-04-27 13:20:43,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {53906#(<= main_~r~0 (+ main_~u~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53906#(<= main_~r~0 (+ main_~u~0 2))} is VALID [2022-04-27 13:20:43,870 INFO L290 TraceCheckUtils]: 64: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53906#(<= main_~r~0 (+ main_~u~0 2))} is VALID [2022-04-27 13:20:43,870 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53012#true} {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} #96#return; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,870 INFO L272 TraceCheckUtils]: 59: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 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)); {53012#true} is VALID [2022-04-27 13:20:43,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} assume !!(#t~post7 < 20);havoc #t~post7; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} assume !!(0 != ~r~0); {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,872 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {53012#true} {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} #94#return; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,872 INFO L272 TraceCheckUtils]: 51: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 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)); {53012#true} is VALID [2022-04-27 13:20:43,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} assume !!(#t~post6 < 20);havoc #t~post6; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} assume !(~r~0 < 0); {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,873 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {53012#true} {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} #98#return; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,873 INFO L272 TraceCheckUtils]: 43: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 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)); {53012#true} is VALID [2022-04-27 13:20:43,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} assume !!(#t~post8 < 20);havoc #t~post8; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53931#(<= main_~r~0 (+ main_~v~0 main_~u~0 2))} is VALID [2022-04-27 13:20:43,875 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {53012#true} {54004#(<= 0 (+ 5 main_~v~0))} #98#return; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,876 INFO L272 TraceCheckUtils]: 35: Hoare triple {54004#(<= 0 (+ 5 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)); {53012#true} is VALID [2022-04-27 13:20:43,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} assume !!(#t~post8 < 20);havoc #t~post8; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} assume !(~r~0 > 0); {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,877 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {53012#true} {54004#(<= 0 (+ 5 main_~v~0))} #96#return; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,877 INFO L272 TraceCheckUtils]: 27: Hoare triple {54004#(<= 0 (+ 5 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)); {53012#true} is VALID [2022-04-27 13:20:43,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} assume !!(#t~post7 < 20);havoc #t~post7; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} assume !!(0 != ~r~0); {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,878 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {53012#true} {54004#(<= 0 (+ 5 main_~v~0))} #94#return; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,878 INFO L272 TraceCheckUtils]: 19: Hoare triple {54004#(<= 0 (+ 5 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)); {53012#true} is VALID [2022-04-27 13:20:43,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} assume !!(#t~post6 < 20);havoc #t~post6; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {54004#(<= 0 (+ 5 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {53012#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {54004#(<= 0 (+ 5 main_~v~0))} is VALID [2022-04-27 13:20:43,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53012#true} {53012#true} #92#return; {53012#true} is VALID [2022-04-27 13:20:43,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,879 INFO L272 TraceCheckUtils]: 11: Hoare triple {53012#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)); {53012#true} is VALID [2022-04-27 13:20:43,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53012#true} {53012#true} #90#return; {53012#true} is VALID [2022-04-27 13:20:43,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {53012#true} assume !(0 == ~cond); {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {53012#true} ~cond := #in~cond; {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L272 TraceCheckUtils]: 6: Hoare triple {53012#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {53012#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; {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {53012#true} call #t~ret9 := main(); {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53012#true} {53012#true} #102#return; {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {53012#true} assume true; {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {53012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {53012#true} call ULTIMATE.init(); {53012#true} is VALID [2022-04-27 13:20:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 142 proven. 156 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2022-04-27 13:20:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846194532] [2022-04-27 13:20:43,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:20:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830486905] [2022-04-27 13:20:43,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830486905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:20:43,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:20:43,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-27 13:20:43,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043358833] [2022-04-27 13:20:43,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:20:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 18 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (37), 18 states have call predecessors, (37), 18 states have call successors, (37) Word has length 183 [2022-04-27 13:20:43,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:43,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 18 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (37), 18 states have call predecessors, (37), 18 states have call successors, (37) [2022-04-27 13:20:44,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:44,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:20:44,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:20:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:20:44,043 INFO L87 Difference]: Start difference. First operand 1057 states and 1416 transitions. Second operand has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 18 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (37), 18 states have call predecessors, (37), 18 states have call successors, (37) [2022-04-27 13:20:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:52,251 INFO L93 Difference]: Finished difference Result 2347 states and 3182 transitions. [2022-04-27 13:20:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 13:20:52,251 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 18 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (37), 18 states have call predecessors, (37), 18 states have call successors, (37) Word has length 183 [2022-04-27 13:20:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 18 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (37), 18 states have call predecessors, (37), 18 states have call successors, (37) [2022-04-27 13:20:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 381 transitions. [2022-04-27 13:20:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 18 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (37), 18 states have call predecessors, (37), 18 states have call successors, (37) [2022-04-27 13:20:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 381 transitions. [2022-04-27 13:20:52,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 381 transitions. [2022-04-27 13:20:52,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:52,825 INFO L225 Difference]: With dead ends: 2347 [2022-04-27 13:20:52,825 INFO L226 Difference]: Without dead ends: 1822 [2022-04-27 13:20:52,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=379, Invalid=953, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 13:20:52,827 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 253 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:52,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 803 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 13:20:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2022-04-27 13:20:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1329. [2022-04-27 13:20:54,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:54,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1822 states. Second operand has 1329 states, 1004 states have (on average 1.1643426294820718) internal successors, (1169), 1015 states have internal predecessors, (1169), 299 states have call successors, (299), 27 states have call predecessors, (299), 25 states have return successors, (297), 286 states have call predecessors, (297), 297 states have call successors, (297) [2022-04-27 13:20:54,908 INFO L74 IsIncluded]: Start isIncluded. First operand 1822 states. Second operand has 1329 states, 1004 states have (on average 1.1643426294820718) internal successors, (1169), 1015 states have internal predecessors, (1169), 299 states have call successors, (299), 27 states have call predecessors, (299), 25 states have return successors, (297), 286 states have call predecessors, (297), 297 states have call successors, (297) [2022-04-27 13:20:54,908 INFO L87 Difference]: Start difference. First operand 1822 states. Second operand has 1329 states, 1004 states have (on average 1.1643426294820718) internal successors, (1169), 1015 states have internal predecessors, (1169), 299 states have call successors, (299), 27 states have call predecessors, (299), 25 states have return successors, (297), 286 states have call predecessors, (297), 297 states have call successors, (297) [2022-04-27 13:20:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:55,000 INFO L93 Difference]: Finished difference Result 1822 states and 2433 transitions. [2022-04-27 13:20:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2433 transitions. [2022-04-27 13:20:55,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:55,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:55,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 1329 states, 1004 states have (on average 1.1643426294820718) internal successors, (1169), 1015 states have internal predecessors, (1169), 299 states have call successors, (299), 27 states have call predecessors, (299), 25 states have return successors, (297), 286 states have call predecessors, (297), 297 states have call successors, (297) Second operand 1822 states. [2022-04-27 13:20:55,006 INFO L87 Difference]: Start difference. First operand has 1329 states, 1004 states have (on average 1.1643426294820718) internal successors, (1169), 1015 states have internal predecessors, (1169), 299 states have call successors, (299), 27 states have call predecessors, (299), 25 states have return successors, (297), 286 states have call predecessors, (297), 297 states have call successors, (297) Second operand 1822 states. [2022-04-27 13:20:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:55,099 INFO L93 Difference]: Finished difference Result 1822 states and 2433 transitions. [2022-04-27 13:20:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2433 transitions. [2022-04-27 13:20:55,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:55,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:55,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:55,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1004 states have (on average 1.1643426294820718) internal successors, (1169), 1015 states have internal predecessors, (1169), 299 states have call successors, (299), 27 states have call predecessors, (299), 25 states have return successors, (297), 286 states have call predecessors, (297), 297 states have call successors, (297) [2022-04-27 13:20:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1765 transitions. [2022-04-27 13:20:55,170 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1765 transitions. Word has length 183 [2022-04-27 13:20:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:55,171 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1765 transitions. [2022-04-27 13:20:55,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 18 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (37), 18 states have call predecessors, (37), 18 states have call successors, (37) [2022-04-27 13:20:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1765 transitions. [2022-04-27 13:20:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-04-27 13:20:55,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:55,174 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 11, 11, 11, 11, 8, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:55,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-27 13:20:55,391 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-27 13:20:55,392 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:55,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1274488939, now seen corresponding path program 5 times [2022-04-27 13:20:55,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:55,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943430629] [2022-04-27 13:20:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:55,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:55,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927307924] [2022-04-27 13:20:55,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 13:20:55,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:55,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:55,425 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-27 13:20:55,426 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-27 13:20:55,817 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-04-27 13:20:55,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 13:20:55,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:20:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:20:55,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:20:55,915 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:20:55,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:20:55,923 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-27 13:20:56,121 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-27 13:20:56,124 INFO L356 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:56,127 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:20:56,199 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:20:56,199 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:20:56,199 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:20:56,199 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:20:56,199 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:20:56,199 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:20:56,199 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:20:56,200 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:20:56,201 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:20:56,201 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:20:56,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:20:56 BoogieIcfgContainer [2022-04-27 13:20:56,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:20:56,202 INFO L158 Benchmark]: Toolchain (without parser) took 260995.10ms. Allocated memory was 185.6MB in the beginning and 318.8MB in the end (delta: 133.2MB). Free memory was 131.6MB in the beginning and 142.7MB in the end (delta: -11.1MB). Peak memory consumption was 122.9MB. Max. memory is 8.0GB. [2022-04-27 13:20:56,202 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 148.3MB in the beginning and 148.2MB in the end (delta: 72.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:20:56,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.10ms. Allocated memory is still 185.6MB. Free memory was 131.5MB in the beginning and 156.7MB in the end (delta: -25.3MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-27 13:20:56,203 INFO L158 Benchmark]: Boogie Preprocessor took 49.98ms. Allocated memory is still 185.6MB. Free memory was 156.7MB in the beginning and 155.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:20:56,203 INFO L158 Benchmark]: RCFGBuilder took 276.35ms. Allocated memory is still 185.6MB. Free memory was 155.0MB in the beginning and 142.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:20:56,203 INFO L158 Benchmark]: TraceAbstraction took 260436.52ms. Allocated memory was 185.6MB in the beginning and 318.8MB in the end (delta: 133.2MB). Free memory was 141.5MB in the beginning and 142.7MB in the end (delta: -1.2MB). Peak memory consumption was 132.5MB. Max. memory is 8.0GB. [2022-04-27 13:20:56,203 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 148.3MB in the beginning and 148.2MB in the end (delta: 72.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.10ms. Allocated memory is still 185.6MB. Free memory was 131.5MB in the beginning and 156.7MB in the end (delta: -25.3MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.98ms. Allocated memory is still 185.6MB. Free memory was 156.7MB in the beginning and 155.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 276.35ms. Allocated memory is still 185.6MB. Free memory was 155.0MB in the beginning and 142.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 260436.52ms. Allocated memory was 185.6MB in the beginning and 318.8MB in the end (delta: 133.2MB). Free memory was 141.5MB in the beginning and 142.7MB in the end (delta: -1.2MB). Peak memory consumption was 132.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=26, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(counter)=0, A=573, counter=0, R=23] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=573, counter=0, R=23] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [\old(counter)=0, A=573, counter=0, r=-44, R=23, u=47, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=573, counter=1, counter++=0, r=-44, R=23, u=47, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=1, R=23, r=-44, u=47, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=573, counter=1, R=23, r=-44, u=47, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=2, counter++=1, R=23, r=-44, u=47, v=1] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=2, R=23, r=-44, u=47, v=1] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=573, counter=2, r=-44, R=23, u=47, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=573, counter=3, counter++=2, R=23, r=-44, u=47, v=1] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=3, r=-44, R=23, u=47, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=573, counter=3, r=3, R=23, u=49, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=573, counter=4, counter++=3, R=23, r=3, u=49, v=1] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=4, R=23, r=3, u=49, v=1] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=573, counter=4, R=23, r=3, u=49, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=573, counter=5, counter++=4, r=3, R=23, u=49, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=5, r=3, R=23, u=49, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=573, counter=5, r=3, R=23, u=49, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=6, counter++=5, r=3, R=23, u=49, v=1] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=6, R=23, r=3, u=49, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=573, counter=6, R=23, r=2, u=49, v=3] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=7, counter++=6, R=23, r=2, u=49, v=3] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=7, R=23, r=2, u=49, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=573, counter=7, R=23, r=-1, u=49, v=5] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=8, counter++=7, r=-1, R=23, u=49, v=5] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=8, R=23, r=-1, u=49, v=5] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=573, counter=8, R=23, r=-1, u=49, v=5] [L47] EXPR counter++ VAL [\old(counter)=0, A=573, counter=9, counter++=8, r=-1, R=23, u=49, v=5] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=9, R=23, r=-1, u=49, v=5] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=573, counter=9, R=23, r=48, u=51, v=5] [L47] EXPR counter++ VAL [\old(counter)=0, A=573, counter=10, counter++=9, R=23, r=48, u=51, v=5] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=10, r=48, R=23, u=51, v=5] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=573, counter=10, r=48, R=23, u=51, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=573, counter=11, counter++=10, R=23, r=48, u=51, v=5] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=11, r=48, R=23, u=51, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=573, counter=11, R=23, r=48, u=51, v=5] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=12, counter++=11, r=48, R=23, u=51, v=5] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=12, R=23, r=48, u=51, v=5] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=573, counter=12, r=43, R=23, u=51, v=7] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=13, counter++=12, r=43, R=23, u=51, v=7] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=13, R=23, r=43, u=51, v=7] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=573, counter=13, R=23, r=36, u=51, v=9] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=14, counter++=13, r=36, R=23, u=51, v=9] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=14, r=36, R=23, u=51, v=9] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=573, counter=14, R=23, r=27, u=51, v=11] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=15, counter++=14, r=27, R=23, u=51, v=11] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=15, r=27, R=23, u=51, v=11] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=573, counter=15, R=23, r=16, u=51, v=13] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=16, counter++=15, R=23, r=16, u=51, v=13] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=16, R=23, r=16, u=51, v=13] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=573, counter=16, r=3, R=23, u=51, v=15] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=17, counter++=16, r=3, R=23, u=51, v=15] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=17, R=23, r=3, u=51, v=15] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=573, counter=17, R=23, r=-12, u=51, v=17] [L39] EXPR counter++ VAL [\old(counter)=0, A=573, counter=18, counter++=17, r=-12, R=23, u=51, v=17] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=18, r=-12, R=23, u=51, v=17] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=573, counter=18, R=23, r=-12, u=51, v=17] [L47] EXPR counter++ VAL [\old(counter)=0, A=573, counter=19, counter++=18, r=-12, R=23, u=51, v=17] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=19, r=-12, R=23, u=51, v=17] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=573, counter=19, R=23, r=39, u=53, v=17] [L47] EXPR counter++ VAL [\old(counter)=0, A=573, counter=20, counter++=19, R=23, r=39, u=53, v=17] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=573, counter=20, R=23, r=39, u=53, v=17] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=573, counter=20, r=39, R=23, u=53, v=17] [L34] EXPR counter++ VAL [\old(counter)=0, A=573, counter=21, counter++=20, R=23, r=39, u=53, v=17] [L34] COND FALSE !(counter++<20) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 260.3s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 99.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2989 SdHoareTripleChecker+Valid, 18.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2969 mSDsluCounter, 6482 SdHoareTripleChecker+Invalid, 17.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 945 IncrementalHoareTripleChecker+Unchecked, 5090 mSDsCounter, 1845 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3455 IncrementalHoareTripleChecker+Invalid, 6247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1845 mSolverCounterUnsat, 1392 mSDtfsCounter, 3455 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3097 GetRequests, 2760 SyntacticMatches, 9 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1329occurred in iteration=20, InterpolantAutomatonStates: 324, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1738 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 131.1s InterpolantComputationTime, 2008 NumberOfCodeBlocks, 1737 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2935 ConstructedInterpolants, 44 QuantifiedInterpolants, 10300 SizeOfPredicates, 86 NumberOfNonLiveVariables, 4126 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 8903/11070 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:20:56,411 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-27 13:20:56,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...